Growing Grammars and Length-reducing Automata.
Tomasz JurdzinskiPublished in: Fundam. Informaticae (2011)
Keyphrases
- finite state automata
- finite automata
- context free
- cellular automata
- context free grammars
- probabilistic automata
- databases
- fixed length
- finite state
- regular expressions
- natural language
- case study
- artificial intelligence
- grammatical inference
- regular languages
- real time
- lattice gas
- parse tree
- significantly reduced
- markov decision processes
- state space
- data model
- website