On languages satisfying “interchange Lemma”

DOI10.1051/ita/1993270100711zbMath0770.68083OpenAlexW163929907WikidataQ124972115 ScholiaQ124972115MaRDI QIDQ5286056

Victor Mitrana

Publication date: 29 June 1993

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92439

zbMATH Keywords

closure propertiesiteration conditions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• A method for proving programming languages non context-free
• Algebraic linguistics; analytical models
• An “Interchange Lemma” for Context-Free Languages
• A note on undecidable properties of formal languages
• A helpful result for proving inherent ambiguity
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On languages satisfying “interchange Lemma”