A pumping lemma for flip-pushdown languages
From MaRDI portal
Publication:2969981
DOI10.1051/ita/2016003zbMath1362.68147WikidataQ124832531 ScholiaQ124832531MaRDI QIDQ2969981
Publication date: 24 March 2017
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2016003
pumping lemma; flip-pushdown automaton; flip-pushdown language; reversal-generating context-free grammar
68Q45: Formal languages and automata