Langages à un compteur

DOI10.1016/0022-0000(83)90018-1zbMath0508.68050OpenAlexW1968763185MaRDI QIDQ1838045

Michel Latteux

Publication date: 1983

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(83)90018-1

zbMATH Keywords

generatorpumping lemmarational transductionabstract families of languagestriorestricted one-counter languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Unnamed Item ⋮ On nonstochastic languages and homomorphic images of stochastic languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Wadge hierarchy of omega context-free languages ⋮ Shortest Paths in One-Counter Systems ⋮ Commutative one-counter languages are regular ⋮ Weighted systems of equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sur les générateurs algébriques et linéaires
• Cônes rationnels commutatifs
• Reset machines
• A propos du lemme de substitution
• Two iteration theorems for some families of languages
• One counter languages and the IRS condition
• Transductions des langages de Chomsky
• Uniformly erasable AFL
• Some uniformly erasable families of languages
• Produit dans le cône rationnel engendre par D
• Remarks on blind and partially blind one-way multicounter machines
• Sur diverses familles de langages fermées par transduction rationnelle
• Non-prinicipalité du cylindre des langages à compteur
• Linear Languages and the Intersection Closures of Classes of Languages
• The Hardest Context-Free Language
• On the index of a context-free grammar and language
• An Infinite Hierarchy of Context-Free Languages
• Inclusion relations among families of context-free languages

This page was built for publication: Langages à un compteur