Equivalence of pushdown automata via first-order grammars.
Petr JancarPublished in: J. Comput. Syst. Sci. (2021)
Keyphrases
- context free
- finite state
- finite state automata
- decision diagrams
- grammatical inference
- finite automata
- context sensitive
- model checking
- higher order
- context free grammars
- context dependent
- tree automata
- first order logic
- cellular automata
- regular languages
- finite state machines
- regular expressions
- closure properties
- quantifier elimination
- graph grammars
- inductive inference
- phrase structure
- natural language
- linear temporal logic
- syntactic pattern recognition
- knowledge base
- horn clauses
- visual languages