Decidability of Hierarchies of Regular Aperiodic Languages (original) (raw)
Related papers
A Logical Approach to Decidability of Hierarchies of Regular Star—Free Languages
Lecture Notes in Computer Science, 2001
Decidability of MSO Theories of Tree Structures
Lecture Notes in Computer Science, 2004
Decidability of Monadic Theories
Mathematical Foundations of Computer Science, Praha, Czechoslovakia, September 3–7, 1984. Proceedings. Lecture Notes in Computer Science. V. 176., 1984
Two collapsing hierarchies of subregularly tree controlled languages
Theoretical Computer Science, 2009
On Two Hierarchies of Subregularly Tree Controlled Languages
2008
Chapter 2 Languages , Decidability , and Complexity
2012
Hierarchies and reducibilities on regular languages related to modulo counting
RAIRO - Theoretical Informatics and Applications, 2009
E ective Topological Hierarchies of Recognizable Tree Languages
A Decidability Result for the Model Checking of Infinite-State Systems
Journal of Automated Reasoning, 2012
The gentzenization and decidability of RW
Journal of Philosophical Logic, 1990
Languages, decidability, and complexity
Lecture Notes in Control and Information Sciences, 2013
The Wadge Hierarchy of Deterministic Tree Languages
Logical Methods in Computer Science, 2008
Decidability and the finite model property
Journal of Philosophical Logic, 1981
Deterministic Automata and the Monadic Theory of Ordinals < ?2
Mlq, 1983
On decidability and axiomatizability of some ordered structures
Soft Computing
Decidability of the theory of the totally unbounded ω-layered structure
On countable chains having decidable monadic theory
The Journal of Symbolic Logic, 2012
Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
RAIRO - Theoretical Informatics and Applications, 2002
Some Logical Characterizations of the Dot-Depth Hierarchy and Applications
Journal of Computer and System Sciences, 1995
On the separation question for tree languages
2012
A reducibility for the dot-depth hierarchy
Theoretical Computer Science, 2005
Deterministic Automata and the Monadic Theory of Ordinals < Ω2
Mathematical Logic Quarterly, 1983
Decidable fragments of first-order language under stable model semantics and circumscription
2010
Modular proofs for completeness of hierarchical term rewriting systems
Theoretical Computer Science, 1995
Towards a proof of the decidability of the momentary stagnation of the growth function of systems
Theoretical Computer Science, 2005
Aperiodicity, Star-freeness, and First-order Definability of Structured Context-Free Languages
ArXiv, 2020
Decidability of the Theory of the Totally Unbounded omega-Layered Structure
Workshops, 2004
A Hierarchy of Automatic Words having a Decidable MSO Theory
2006
On the topological complexity of tree languages
2008
On the complexity of the syntax of tree languages
Lecture Notes in Computer Science, 2009
A Logical Characterization of Systolic Languages
1998
Decidability properties for fragments of CHR
Theory and Practice of Logic Programming, 2010