Non-self-embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata.
Bruno GuillonGiovanni PighizziniLuca PrigionieroPublished in: CIAA (2018)
Keyphrases
- cellular automata
- finite automata
- finite state automata
- finite state
- context free
- grammatical inference
- regular expressions
- regular languages
- probabilistic automata
- finite state machines
- model checking
- formal language theory
- knowledge base
- lattice gas
- formal languages
- tree automata
- natural language processing
- information extraction
- turing machine
- markov chain
- timed automata
- relational databases
- finite state automaton
- high dimensional