On defining linear orders by automata

DOI10.2140/moscow.2020.9.253zbMath1484.06001OpenAlexW2995379413MaRDI QIDQ2211260

Irène Durand, Michael Raskin

Publication date: 10 November 2020

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/moscow.2020.9.253

zbMATH Keywords

linear orderenumeration algorithmdiagonal enumerationgraph-walking automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Paths and cycles (05C38) Total orders (06A05)

Cites Work

• Graph exploration by a finite automaton
• Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
• Computations by fly-automata beyond monadic second-order logic

This page was built for publication: On defining linear orders by automata