Langages satures et cônes decroissants. Langages et cônes bifideles

DOI10.1007/BF00625281zbMath0493.68084OpenAlexW2254764205MaRDI QIDQ1168750

Jeannine Leguy

Publication date: 1982

Published in: Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

bifaithful conesbifaithful languagesdecreasing conesinfinite hierarchy of non-erasable context-free languagesrestricted conessaturated languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

On the usefulness of bifaithful rational cones

Cites Work

• Syntactic operators on full semiAFLs
• A propos du lemme de substitution
• Transductions des langages de Chomsky
• Uniformly erasable AFL
• Some uniformly erasable families of languages
• Langages algébriques, paires iterantes et transductions rationnelles
• Sur diverses familles de langages fermées par transduction rationnelle
• Erasable context-free languages
• On Relations Defined by Generalized Finite Automata
• Chains of full AFL's
• Erasing in context-free AFLs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Langages satures et cônes decroissants. Langages et cônes bifideles