Regular languages of words over countable linear orderings

DOI10.1007/978-3-642-22012-8_9MaRDI QIDQ3012914zbMATH OpenOpenAlexFDO

Authors Olivier Carton, Thomas Colcombet, Gabriele Puppis

Publication date 7 July 2011

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.712.6475

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Total orders (06A05) Algebraic theory of languages and automata (68Q70)

Recommendations

• An algebraic approach to MSO-definability on countable linear orderings
• Logic and rational languages of words indexed by linear orderings
• Logic and Rational Languages of Words Indexed by Linear Orderings
• Automata on linear orderings
• scientific article; zbMATH DE number 1834651

Cites work

• Automata on linear orderings
• COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Factorization forests for infinite words and applications to countable scattered linear orderings
• scientific article; zbMATH DE number 3767656 (Why is no real title available?)
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• Logic and rational languages of words indexed by linear orderings
• The first order properties of products of algebraic systems
• The monadic theory of order

Cited in

(20)

• The factorisation forest theorem
• On the Weihrauch degree of the additive Ramsey theorem over the rationals
• Pro-aperiodic monoids via saturated models
• Algebraic characterization of FO for scattered linear orderings
• Limited set quantifiers over countable linear orderings
• Recognisable languages over monads
• Logic and Rational Languages of Words Indexed by Linear Orderings
• Overlap-Free Regular Languages
• Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
• scientific article; zbMATH DE number 622491 (Why is no real title available?)
• The covering problem
• An algebraic approach to MSO-definability on countable linear orderings
• Equational Theories of Scattered and Countable Series-Parallel Posets
• A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
• Mathematical Foundations of Computer Science 2004
• First-order separation over countable ordinals
• Regular planar monoidal languages
• Monadic monadic second order logic
• On the Weihrauch degree of the additive Ramsey theorem
• Logic and rational languages of words indexed by linear orderings

This page was built for publication: Regular languages of words over countable linear orderings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3012914)