Pushdown automata with cancellation and commutation-augmented pregroups grammars.
Nissim FrancezMichael KaminskiPublished in: LATA (2007)
Keyphrases
- finite state automata
- context free
- finite automata
- grammatical inference
- finite state
- cellular automata
- context free grammars
- model checking
- finite state machines
- tree automata
- regular expressions
- probabilistic automata
- fuzzy control
- context free languages
- grammar rules
- natural language processing
- closure properties
- natural language
- syntactic pattern recognition
- parse tree
- expressive power
- fuzzy logic
- tree adjoining
- artificial intelligence
- mildly context sensitive
- timed automata
- turing machine
- context sensitive
- hidden markov models
- control system
- reinforcement learning