Le cylindre des langages linéaires

DOI10.1007/BF01768473zbMath0352.68087OpenAlexW2002276227MaRDI QIDQ4122824

Luc Boasson, Maurice Nivat

Publication date: 1977

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01768473

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

The hardest \(\operatorname{LL}(k)\) language ⋮ Unnamed Item ⋮ The hardest language for grammars with context operators ⋮ The Hardest LL(k) Language ⋮ On hardest languages for one-dimensional cellular automata ⋮ Hardest languages for conjunctive and Boolean grammars ⋮ The Hardest Language for Conjunctive Grammars ⋮ On characterisation of language families in terms of inverse morphisms ⋮ On hardest languages for one-dimensional cellular automata ⋮ Générateurs algébriques et systèmes de paires iterantes ⋮ Remarks on multihead pushdown automata and multihead stack automata

Cites Work

• Unnamed Item
• Langages algébriques, paires iterantes et transductions rationnelles
• Sur diverses familles de langages fermées par transduction rationnelle
• A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
• Non-prinicipalité du cylindre des langages à compteur
• The Hardest Context-Free Language
• Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
• A helpful result for proving inherent ambiguity