A Hierarchy of Automatic<i>ω</i>-Words having a Decidable MSO Theory (Q3526410): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087899139 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q29395150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated GSMs and CO-CFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariants of Automatic Presentations and Semi-synchronous Transductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Monadic Theory of Tree-like Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite presentations of infinite structures: Automata and interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bertrand numeration systems and recognizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic and \(p\)-recognizable sets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-Sensitive Languages, Rational Graphs and Determinism / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic theory of morphic infinite words and generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Theorem for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. IX: Machines and their behaviours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order logic, graph coverings and unfoldings of transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability and undecidability of extensions of second (first) order theory of (generalized) successor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated pushdown automata and sequences of rational numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronized rational relations of finite and infinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, logics, and infinite games. A guide to current research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3312199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability questions related to abstract numeration systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic graphs and D0L-sequences of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of automata characterizing context-sensitive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of ends, pushdown automata, and second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3687741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A topological approach to transductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decidability of monadic logic of order over the naturals extended by monadic predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable Theories of the Ordering of Natural Numbers with Unary Predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4807827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata Presenting Structures: A Survey of the Finite String Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic theory of order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order logic on tree-like structures / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:42, 28 June 2024

scientific article
Language Label Description Also known as
English
A Hierarchy of Automatic<i>ω</i>-Words having a Decidable MSO Theory
scientific article

    Statements

    A Hierarchy of Automatic<i>ω</i>-Words having a Decidable MSO Theory (English)
    0 references
    0 references
    0 references
    25 September 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    morphic words
    0 references
    lexicographic word ordering
    0 references
    lexicographic hierarchies
    0 references
    monadic second-order logic
    0 references
    finite automaton
    0 references
    automatic structures
    0 references
    automatic sequences
    0 references
    recognizability by finite automata
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references