Universal first-order quantification over automata

DOI10.1007/978-3-031-40247-0_6arXiv2306.04210MaRDI QIDQ6199866

Bernard Boigelot, Pascal Fontaine, Baptiste Vergain

Publication date: 28 February 2024

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2306.04210

zbMATH Keywords

first-order logicquantifier eliminationsatisfiabilityinfinite-word automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on definability in fragments of arithmetic with free unary predicates
• Automata on linear orderings
• Counting the solutions of Presburger equations without enumerating them.
• The dual of concatenation
• Weak Second‐Order Arithmetic and Finite Automata
• The Büchi Complementation Saga
• Presburger arithmetic with unary predicates is Π₁¹ complete
• An effective decision procedure for linear arithmetic over the integers and reals
• On the elementary theory of linear order
• Testing and generating infinite sequences by a finite automaton

This page was built for publication: Universal first-order quantification over automata