ON CONTEXT-FREE LANGUAGES OF SCATTERED WORDS

DOI10.1142/S0129054113400297zbMath1293.68185OpenAlexW2101721701MaRDI QIDQ5495418

Satoshi Okawa, Zoltán Ésik

Publication date: 4 August 2014

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054113400297

zbMATH Keywords

context-free languageinfinite wordlinear ordering

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (1)

OPERATIONAL CHARACTERIZATION OF SCATTERED MCFLs

Cites Work

• Büchi context-free languages
• On Müller context-free grammars
• Automata on linear orderings
• Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
• Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
• Finite automata and ordinals
• The equational theory of regular words
• An undecidable property of context-free linear orders
• On iteration semiring-semimodule pairs.
• A characterization of context-free languages
• ALGEBRAIC LINEAR ORDERINGS
• On frontiers of regular trees
• Axiomatizing omega and omega-op powers of words
• Long words: The theory of concatenation and \(\omega\)-power

This page was built for publication: ON CONTEXT-FREE LANGUAGES OF SCATTERED WORDS