Towards Alternating Automata for Graph Languages.
H. J. Sander BrugginkMathias HülsbuschBarbara KönigPublished in: Electron. Commun. Eur. Assoc. Softw. Sci. Technol. (2012)
Keyphrases
- expressive power
- random walk
- connected components
- graph theory
- finite state automata
- graph representation
- graph model
- graph structure
- graph mining
- probabilistic automata
- language identification
- finite automata
- bipartite graph
- graph matching
- cellular automata
- weighted graph
- finite state machines
- finite state
- language independent
- graph partitioning
- graph structures
- context free
- structured data
- regular languages
- markov chain
- information retrieval