Le cylindre des langages linéaires

DOI10.1007/BF01768473zbMATH Open0352.68087OpenAlexW2002276227MaRDI QIDQ4122824FDOQ4122824

Authors: Luc Boasson, M. 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)

Cites Work

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

Cited In (11)

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

This page was built for publication: Le cylindre des langages linéaires

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4122824)