On the transition graphs of automata and grammars.
Didier CaucalRoland MonfortPublished in: WG (1990)
Keyphrases
- finite state automata
- context free
- finite automata
- context free grammars
- grammatical inference
- cellular automata
- graph theory
- graph matching
- graph mining
- natural language processing
- visual languages
- syntactic pattern recognition
- tree automata
- subgraph isomorphism
- finite state
- graph theoretic
- graph structures
- graph representation
- formal languages
- probabilistic automata
- graph structure
- information extraction
- stochastic grammar