On the family of finite index matrix languages

DOI10.1016/0022-0000(79)90035-7zbMath0411.68062OpenAlexW2087723103MaRDI QIDQ1259431

Gheorghe Păun

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

zbMATH Keywords

decidabilitycompositionabstract famity of languagesfinite index matrix languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25)

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