On the usefulness of bifaithful rational cones

DOI10.1007/BF01699459zbMath0604.68083OpenAlexW2050516132MaRDI QIDQ3741081

Jeannine Leguy, Michel Latteux

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1007/bf01699459

zbMATH Keywords

bounded languagesbifaithful rational transductionfaithful rational transductionquasirational languagestrongly f-saturated language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Every commutative quasirational language is regular ⋮ Commutative one-counter languages are regular

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Syntactic operators on full semiAFLs
• Cônes rationnels commutatifs
• A propos du lemme de substitution
• Langages satures et cônes decroissants. Langages et cônes bifideles
• Two iteration theorems for some families of languages
• One counter languages and the IRS condition
• Transductions des langages de Chomsky
• Uniformly erasable AFL
• 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
• Substitution and bounded languages
• Sur diverses familles de langages fermées par transduction rationnelle
• More about the “geography” of context-free languages
• A translational theorem for the class of EOL languages
• Studies in abstract families of languages
• Chains of full AFL's

This page was built for publication: On the usefulness of bifaithful rational cones