On context-free languages of scattered words

DOI10.1142/S0129054113400297MaRDI QIDQ5495418zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On context-free languages of scattered words
• Hausdorff rank of scattered context-free linear orders
• On Müller context-free grammars
• On Müller context-free grammars
• Büchi context-free languages

Cites work

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

Cited in

(4)

• Simon's theorem for scattered words
• Hausdorff rank of scattered context-free linear orders
• On context-free languages of scattered words
• OPERATIONAL CHARACTERIZATION OF SCATTERED MCFLs

This page was built for publication: On context-free languages of scattered words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495418)