Deux Familles de Langages Incomparables

DOI10.1016/S0019-9958(79)90642-9zbMath0427.68064MaRDI QIDQ3863094

Joffroy Beauquier

Publication date: 1979

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

context-free languagesincomparability of families of languagesmatrix languages of finite index

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Sur la structure des langages algébriques ⋮ The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index ⋮ Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity ⋮ Outils et résultats pour les transducteurs boustrophédons

This page was built for publication: Deux Familles de Langages Incomparables