On Expressive Power of Regular Expressions over Infinite Orders

DOI10.1007/978-3-319-34171-2_27zbMath1475.68166OpenAlexW2483992842MaRDI QIDQ5740199

Alexander Rabinovich

Publication date: 25 July 2016

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-34171-2_27

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The monadic theory of order
• Star free expressions over the reals
• Weak Second‐Order Arithmetic and Finite Automata
• Decision Problems of Finite Automata Design and Related Arithmetics
• Star-free regular sets of ω-sequences
• On the elementary theory of linear order
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: On Expressive Power of Regular Expressions over Infinite Orders