On the family of finite index matrix languages
From MaRDI portal
Publication:1259431
DOI10.1016/0022-0000(79)90035-7zbMath0411.68062OpenAlexW2087723103MaRDI QIDQ1259431
Publication date: 1979
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(79)90035-7
Related Items (5)
Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the generative capacity of compound string and array grammars ⋮ Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The generative capacity of the compound grammars
- On the index of grammars and languages
- On the complexity of regulated context-free rewriting
- Parallel context-free languages
- On equal matrix languages
- On the index of a context-free grammar and language
- An analog of a theorem about context-free languages
- Full AFLs and nested iterated substitution
- Simple matrix languages
- A few remarks on the index of context-free grammars and languages
- Compound and serial grammars
This page was built for publication: On the family of finite index matrix languages