Relationships Between Bounded Languages, Counter Machines, Finite-Index Grammars, Ambiguity, and Commutative Regularity.
Arturo CarpiFlavio D'AlessandroOscar H. IbarraIan McQuillanPublished in: CoRR (2022)
Keyphrases
- closure properties
- grammatical inference
- context free grammars
- expressive power
- grammar induction
- context free
- mildly context sensitive
- language independent
- finite state automata
- context free languages
- special case
- inductive inference
- finite automata
- natural language processing
- index structure
- language model
- regular languages
- finite number
- formal language
- query language
- database