Automatic Structures of Bounded Degree Revisited

DOI10.1007/978-3-642-04027-6_27zbMath1257.03032OpenAlexW1649098425MaRDI QIDQ3644760

Markus Lohrey, Dietrich Kuske

Publication date: 12 November 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04027-6_27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (1)

Ehrenfeucht-Fraïssé goes automatic for real addition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A uniform method for proving lower bounds on the computational complexity of logical theories
• On the valuedness of finite transducers
• On direct products of automaton decidable theories
• Automatic structures of bounded degree revisited
• Automata Presenting Structures: A Survey of the Finite String Case
• Decision Problems of Finite Automata Design and Related Arithmetics
• STACS 2004
• First-order and counting theories ofω-automatic structures

This page was built for publication: Automatic Structures of Bounded Degree Revisited