The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper

DOI10.1016/0020-0190(74)90050-7zbMath0329.68067OpenAlexW1992222837MaRDI QIDQ1227278

Luc Boasson

Publication date: 1973

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(74)90050-7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

On the usefulness of bifaithful rational cones ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Langages algébriques déterministes non générateurs ⋮ Unnamed Item ⋮ Formes de langages et de grammaires ⋮ Unnamed Item ⋮ One counter languages and the IRS condition ⋮ Langages algébriques, paires iterantes et transductions rationnelles

Cites Work

• Unnamed Item
• Computer programming and formal systems
• Sur diverses familles de langages fermées par transduction rationnelle
• On Relations Defined by Generalized Finite Automata
• A helpful result for proving inherent ambiguity
• Chains of full AFL's

This page was built for publication: The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper