Operational characterization of scattered MCFLs -- Technical Report
Formal Languages and Automata Theory
2013-04-24 v1
Abstract
We give a Kleene-type operational characterization of Muller context-free languages (MCFLs) of well-ordered and scattered words.
Cite
@article{arxiv.1304.6388,
title = {Operational characterization of scattered MCFLs -- Technical Report},
author = {Zoltan Esik and Szabolcs Ivan},
journal= {arXiv preprint arXiv:1304.6388},
year = {2013}
}
Related papers
View all related →
Formal Languages and Automata Theory · Computer Science
On context-free languages of scattered words
Zoltan Esik, Satoshi Okawa
2015-03-19
Formal Languages and Automata Theory · Computer Science
Scattered context-free linear orderings
Zoltan Esik
2015-03-18
Formal Languages and Automata Theory · Computer Science
On the Order Type of Scattered Context-Free Orderings
Kitti Gelle, Szabolcs Iván
2019-09-19
Formal Languages and Automata Theory · Computer Science
Context-free ordinals
Zoltan Esik, Szabolcs Ivan
2015-03-19
Formal Languages and Automata Theory · Computer Science
Partially-commutative context-free languages
Wojciech Czerwiński, Sławomir Lasota
2012-08-15
Logic in Computer Science · Computer Science
Non-Deterministic Kleene Coalgebras
Alexandra Silva, Marcello Bonsangue, Jan Rutten
2015-07-01
Formal Languages and Automata Theory · Computer Science
Precedence Automata and Languages
Violetta Lonati, Dino Mandrioli, Matteo Pradella
2011-12-01
Formal Languages and Automata Theory · Computer Science
Formalization of context-free language theory
Marcus V. M. Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira, José Carlos Bacelar Almeida
2015-11-02
Formal Languages and Automata Theory · Computer Science
Logic for Unambiguous Context-Free Languages
Yassine Hachaïchi
2016-04-15
Formal Languages and Automata Theory · Computer Science
Scattered one-counter languges have rank less than $\omega^2$
Szabolcs Ivan
2023-03-07
Formal Languages and Automata Theory · Computer Science
Structural Complexity of Multi-Valued Partial Functions Computed by Nondeterministic Pushdown Automata
Tomoyuki Yamakami
2015-08-25
Computation and Language · Computer Science
Masked Language Modeling and the Distributional Hypothesis: Order Word Matters Pre-training for Little
Koustuv Sinha, Robin Jia, Dieuwke Hupkes, Joelle Pineau +2
2021-09-13
Formal Languages and Automata Theory · Computer Science
The order type of scattered context-free orderings of rank one is computable
Kitti Gelle, Szabolcs Ivan
2019-07-29
Computation and Language · Computer Science
Phrase Based Language Model For Statistical Machine Translation
Jia Xu, Geliang Chen
2015-01-20
Programming Languages · Computer Science
A Word Sampler for Well-Typed Functions
Breandan Considine
2025-12-02
Formal Languages and Automata Theory · Computer Science
Logic Characterization of Floyd Languages
Violetta Lonati, Dino Mandrioli, Matteo Pradella
2012-04-23
Formal Languages and Automata Theory · Computer Science
A short proof that $O_2$ is an MCFL
Mark-Jan Nederhof
2016-03-14
Computation and Language · Computer Science
A Typologically Grounded Evaluation Framework for Word Order and Morphology Sensitivity in Multilingual Masked LMs
Anna Feldman, Libby Barak, Jing Peng
2026-03-03
Formal Languages and Automata Theory · Computer Science
An automata characterisation for multiple context-free languages
Tobias Denkinger
2016-09-26
Formal Languages and Automata Theory · Computer Science
Formalization of the pumping lemma for context-free languages
Marcus V. M. Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira, José Carlos Bacelar Almeida
2015-10-19
Logic in Computer Science · Computer Science
On Omega Context Free Languages which are Borel Sets of Infinite Rank
Olivier Finkel
2010-06-02
Computation and Language · Computer Science
Classifying German Language Proficiency Levels Using Large Language Models
Elias-Leander Ahlers, Witold Brunsmann, Malte Schilling
2025-12-09
Formal Languages and Automata Theory · Computer Science
Shuffles of Context-Free Languages along Regular Trajectories
Corentin Barloy, Michaël Cadilhac, Kyle Ockerlund
2026-05-14
Formal Languages and Automata Theory · Computer Science
Kleene Theorem for Higher-Dimensional Automata
Uli Fahrenberg, Christian Johansen, Georg Struth, Krzysztof Ziemiański
2024-12-18
Formal Languages and Automata Theory · Computer Science
Rational index of bounded-oscillation languages
Ekaterina Shemetova, Alexander Okhotin, Semyon Grigorev
2020-12-08