Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity.
Arturo CarpiFlavio D'AlessandroOscar H. IbarraIan McQuillanPublished in: Theor. Comput. Sci. (2021)
Keyphrases
- closure properties
- grammatical inference
- context free grammars
- mildly context sensitive
- grammar induction
- expressive power
- finite automata
- context free
- context free languages
- finite state automata
- formal language
- databases
- monadic datalog
- regular languages
- language independent
- visual languages
- natural language
- tree automata
- database
- continuous functions
- inverted index
- bounded treewidth
- special case
- formal languages
- multi dimensional
- first order logic
- data structure
- b tree