Operational characterization of scattered MCFLs -- Technical Report

2013/04/23 by Zoltan Esik, Esik, Zoltan, Szabolcs Ivan +1
Computer Science · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #cs.FL

paper · pdf · doi:10.48550/arxiv.1304.6388

arxiv created 2013/04/23 · arxiv updated 2013/04/24

Abstract

We give a Kleene-type operational characterization of Muller context-free languages (MCFLs) of well-ordered and scattered words.

Related

• On context-free languages of scattered words
• Scattered context-free linear orderings
• A short proof that O₂ is an MCFL
• Scattered one-counter languges have rank less than ω²
• Zipf Distributions from Two-Stage Symbolic Processes: Stability Under Stochastic Lexical Filtering