Universal first-order quantification over automata

DOI10.1142/S0129054125410011MaRDI QIDQ6857633zbMATH OpenFDO

Authors B. Boigelot, Pascal Fontaine, Baptiste Vergain

Publication date 17 February 2026

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

Full work available at URL https://doi.org/10.1142/S0129054125410011

zbMATH Keywords

first-order logicinfinite-word automataquantifier eliminationsatisfiability

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05)

Cites work

• A note on definability in fragments of arithmetic with free unary predicates
• An effective decision procedure for linear arithmetic over the integers and reals
• Automata on linear orderings
• Counting the solutions of Presburger equations without enumerating them.
• scientific article; zbMATH DE number 1223628 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• On the elementary theory of linear order
• Presburger arithmetic with unary predicates is Π₁¹ complete
• Testing and generating infinite sequences by a finite automaton
• The Büchi Complementation Saga
• The dual of concatenation
• Ultimately periodic words of rational ω-languages
• Universal first-order quantification over automata
• Weak Second‐Order Arithmetic and Finite Automata

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

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