A new pumping lemma for indexed languages, with an application to infinite words

DOI10.1016/J.IC.2016.11.002zbMath1358.68176OpenAlexW2554501700WikidataQ125051964 ScholiaQ125051964MaRDI QIDQ729820

D. Kharzeev

Publication date: 22 December 2016

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2016.11.002

zbMATH Keywords

infinite wordspumping lemmamorphic wordsindexed languagesprefix languages

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A shrinking lemma for indexed languages
• On derivation trees of indexed grammars - an extension of the uvwxy- theorem
• A relationship between ETOL and EDTOL languages
• On proving that certain languages are not ETOL
• On Infinite Words Determined by L Systems
• Ogden’s Lemma for ET0L Languages
• On Infinite Words Determined by Indexed Languages
• On Infinite Words Determined by Stack Automata.
• Linear Orders in the Pushdown Hierarchy
• On languages with a certain prefix property
• Une note sur la propriété de préfixe
• ITERATIVE DEVICES GENERATING INFINITE WORDS
• Automatic Sequences
• Properties of infinite words : Recent results
• Indexed Grammars—An Extension of Context-Free Grammars
• Nested Stack Automata

This page was built for publication: A new pumping lemma for indexed languages, with an application to infinite words