A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage.
Joost EngelfrietHeiko VoglerPublished in: CoRR (2019)
Keyphrases
- finite state
- regular expressions
- tree automata
- graph representation
- cellular automata
- graph theory
- graph structure
- bipartite graph
- data storage
- graph theoretic
- markov chain
- graph matching
- finite automata
- directed acyclic graph
- graph model
- storage and retrieval
- connected components
- random walk
- file system
- structured data
- markov decision processes
- graph partitioning
- storage requirements
- finite state machines
- graph databases
- graph mining
- directed graph
- weighted graph