Publication:710741

DOI10.1016/J.IC.2010.07.003zbMATH Open1204.68121OpenAlexW1963694783MaRDI QIDQ710741FDOQ710741

Felix Klaedtke

Publication date: 22 October 2010

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2010.07.003

zbMATH Keywords

complexityautomata theoryautomatic structuresupper boundsautomata-based decision procedures for logical theoriesfirst-order equivalencelinear arithmetic over the realsminimal sizes of automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• MONA IMPLEMENTATION SECRETS
• Theory of computation.
• A Decision Procedure for the First Order Theory of Real Addition with Order
• STACS 2004
• Automatic Structures: Richness and Limitations
• Weak Second‐Order Arithmetic and Finite Automata
• Finite-state \(\omega\)-languages
• Application of model theoretic games to discrete linear orders and finite automata
• Presburger arithmetic with bounded quantifier alternation
• Bounds on the automata size for Presburger arithmetic
• Finite presentations of infinite structures: Automata and interpretations
• An effective decision procedure for linear arithmetic over the integers and reals
• First-Order Queries on Finite Structures Over the Reals
• Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)
• Automatic Structures of Bounded Degree Revisited

Cited In (1)

• Uniformly Automatic Classes of Finite Structures

Uses Software

• MONA
• FAST
• LIRA

This page was built for publication: Ehrenfeucht-Fraïssé goes automatic for real addition

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