Scattered context-free linear orderings
Formal Languages and Automata Theory
2015-03-18 v2
Authors:
Zoltan Esik
Abstract
We show that it is decidable in exponential time whether the lexicographic ordering of a context-free language is scattered, or a well-ordering.
Cite
@article{arxiv.1102.0850,
title = {Scattered context-free linear orderings},
author = {Zoltan Esik},
journal= {arXiv preprint arXiv:1102.0850},
year = {2015}
}
Related papers
View all related →
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
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
Scattered one-counter languges have rank less than $\omega^2$
Szabolcs Ivan
2023-03-07
Formal Languages and Automata Theory · Computer Science
Context-free ordinals
Zoltan Esik, Szabolcs Ivan
2015-03-19
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
An undecidable property of context-free languages
Zoltan Esik
2010-04-13
Logic in Computer Science · Computer Science
Isomorphisms of scattered automatic linear orders
Dietrich Kuske
2012-04-26
Formal Languages and Automata Theory · Computer Science
Operational characterization of scattered MCFLs -- Technical Report
Zoltan Esik, Szabolcs Ivan
2013-04-24
Logic in Computer Science · Computer Science
Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable
Martin Huschenbett
2012-01-25
Formal Languages and Automata Theory · Computer Science
Ordered Context-Free Grammars Revisited
Brink van der Merwe
2023-09-19
Formal Languages and Automata Theory · Computer Science
Algebraic Linear Orderings
Stephen L. Bloom, Zoltan Esik
2010-02-10
Formal Languages and Automata Theory · Computer Science
Logic for Unambiguous Context-Free Languages
Yassine Hachaïchi
2016-04-15
Logic in Computer Science · Computer Science
Logic and Rational Languages of Scattered and Countable Series-Parallel Posets
Amazigh Amrane, Nicolas Bedon
2019-12-24
Formal Languages and Automata Theory · Computer Science
Well-Quasi-Orderings on Word Languages
Nathan Lhote, Aliaume Lopez, Lia Schütze
2025-01-14
Formal Languages and Automata Theory · Computer Science
Directed Regular and Context-Free Languages
Moses Ganardi, Irmak Saglam, Georg Zetzsche
2024-01-22
Formal Languages and Automata Theory · Computer Science
The First-Order Theory of Binary Overlap-Free Words is Decidable
L. Schaeffer, J. Shallit
2022-09-08
Group Theory · Mathematics
Explicit left orders on free groups extending the lexicographic order on free monoids
Zoran Sunic
2013-04-04
Logic · Mathematics
The complexity of Scott sentences of scattered linear orders
Rachael Alvir, Dino Rossegger
2021-07-01
Formal Languages and Automata Theory · Computer Science
On Even Linear Indexed Languages with a Reduction to the Learning of Context-Free Languages
Benjamin Caulfield
2014-08-26
Probability · Mathematics
Positions of the ranks of factors in certain finite long length words
Elahe Zohoorian Azad
2012-04-22
Formal Languages and Automata Theory · Computer Science
The FC-rank of a context-free language
Arnaud Carayol, Zoltan Esik
2015-03-20
Combinatorics · Mathematics
Normal ordering problem and the extensions of the Stirling grammar
Shi-Mei Ma, Toufik Mansour, Matthias Schork
2015-06-16
Formal Languages and Automata Theory · Computer Science
Splicing systems and the Chomsky hierarchy
Jean Berstel, Luc Boasson, Isabelle Fagnot
2011-02-07
Computation and Language · Computer Science
Consensus Sequence Segmentation
Tamal Chowdhury, Rabindra Rakshit, Arko Banerjee
2013-12-31
Combinatorics · Mathematics
Partially scattered linearized polynomials and rank metric codes
Giovanni Longobardi, Corrado Zanella
2021-05-05