COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS

DOI10.1142/S0129054105003285zbMath1161.68551MaRDI QIDQ5462675

Chloé Rispal, Olivier Carton

Publication date: 3 August 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (14)

Equational Theories of Scattered and Countable Series-Parallel Posets ⋮ Limited Set quantifiers over Countable Linear Orderings ⋮ Factorization forests for infinite words and applications to countable scattered linear orderings ⋮ Unnamed Item ⋮ Automata on linear orderings ⋮ Schützenberger and Eilenberg theorems for words on linear orderings ⋮ Temporal logics over linear time domains are in PSPACE ⋮ First-order separation over countable ordinals ⋮ Regular Languages of Words over Countable Linear Orderings ⋮ Complementation of Branching Automata for Scattered and Countable N-Free Posets ⋮ Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings ⋮ AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS ⋮ Tree Automata and Automata on Linear Orderings ⋮ Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets

Cites Work

• Bilimites de langages reconnaissables
• Finite automata and ordinals
• Unambiguous Büchi automata.
• Star-free sets of words on ordinals
• Weak Second‐Order Arithmetic and Finite Automata
• Automata, Semigroups and Recognizability of Words on Ordinals
• On finite monoids having only trivial subgroups
• Decision methods in the theory of ordinals
• Testing and generating infinite sequences by a finite automaton

This page was built for publication: COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS