On languages satisfying “interchange Lemma”
From MaRDI portal
Publication:5286056
DOI10.1051/ITA/1993270100711zbMATH Open0770.68083OpenAlexW163929907WikidataQ124972115 ScholiaQ124972115MaRDI QIDQ5286056FDOQ5286056
Authors: 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
Recommendations
- An “Interchange Lemma” for Context-Free Languages
- Languages of k -interval exchange transformations
- scientific article; zbMATH DE number 4039335
- Inverse morphic equivalence on languages
- The interchange or pump (di)lemmas for context-free languages
- On Conjugacy of Languages
- On the commutative equivalence of context-free languages
- A note on the emptiness of intersection problem for left Szilard languages
- scientific article; zbMATH DE number 3903987
- Intercalation theorems for stack languages
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on undecidable properties of formal languages
- Algebraic linguistics; analytical models
- A method for proving programming languages non context-free
- A helpful result for proving inherent ambiguity
- An “Interchange Lemma” for Context-Free Languages
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: On languages satisfying “interchange Lemma”
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286056)
