Non-prinicipalité du cylindre des langages à compteur

DOI10.1007/BF01768474zbMATH Open0351.68026MaRDI QIDQ4121409FDOQ4121409

Authors: Jean-Michel Autebert 

Publication date: 1977

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• The Hardest Context-Free Language
• Counter machines and counter languages
• Transductions des langages de Chomsky
• Sur diverses familles de langages fermées par transduction rationnelle
• Studies in abstract families of languages
• Some uniformly erasable families of languages
• Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
• Two iteration theorems for some families of languages
• Finite counting automata
• Title not available (Why is that?)

Cited In (13)

• 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
• Langages algébriques, paires iterantes et transductions rationnelles
• On hardest languages for one-dimensional cellular automata
• Le cylindre des langages linéaires
• Remarks on multihead pushdown automata and multihead stack automata
• The hardest language for conjunctive grammars
• Langages à un compteur

This page was built for publication: Non-prinicipalité du cylindre des langages à compteur

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