On Infinite Words Determined by Indexed Languages
From MaRDI portal
Publication:2922044
DOI10.1007/978-3-662-44522-8_43zbMath1425.68233arXiv1406.3373OpenAlexW818531939MaRDI QIDQ2922044
No author found.
Publication date: 14 October 2014
Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.3373
Related Items
An Approach to Computing Downward Closures, A new pumping lemma for indexed languages, with an application to infinite words, On infinite words determined by L systems