Non-prinicipalité du cylindre des langages à compteur
From MaRDI portal
Publication:4121409
Cites work
- scientific article; zbMATH DE number 3495610 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- Counter machines and counter languages
- Finite counting automata
- Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
- Some uniformly erasable families of languages
- Studies in abstract families of languages
- Sur diverses familles de langages fermées par transduction rationnelle
- The Hardest Context-Free Language
- Transductions des langages de Chomsky
- Two iteration theorems for some families of languages
Cited in
(13)- Remarks on multihead pushdown automata and multihead stack automata
- On characterisation of language families in terms of inverse morphisms
- The hardest \(\operatorname{LL}(k)\) language
- Langages algébriques, paires iterantes et transductions rationnelles
- The hardest language for grammars with context operators
- Générateurs algébriques et systèmes de paires iterantes
- On hardest languages for one-dimensional cellular automata
- The Hardest LL(k) Language
- Langages à un compteur
- The hardest language for conjunctive grammars
- Le cylindre des langages linéaires
- On hardest languages for one-dimensional cellular automata
- Hardest languages for conjunctive and Boolean grammars
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)
