Where Automatic Structures Benefit from Weighted Automata

DOI10.1007/978-3-642-24897-9_12zbMath1349.03039OpenAlexW140266893MaRDI QIDQ3098042

Dietrich Kuske

Publication date: 11 November 2011

Published in: Algebraic Foundations in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24897-9_12

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Decidability of theories and sets of sentences (03B25) Computable structure theory, computable model theory (03C57)

Related Items

Second-order finite automata: expressive power and simple proofs using automatic structures ⋮ The isomorphism problem on classes of automatic structures with transitive relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Easy multiplications. I: The realm of Kleene's theorem
• On the valuedness of finite transducers
• On direct products of automaton decidable theories
• Automatic semigroups
• Automaticity of ordinals and of homogeneous graphs
• On graph products of automatic and biautomatic monoids.
• Singular Artin Monoids of Finite Coxeter Type Are Automatic
• The additive group of the rationals does not have an automatic presentation
• BREAKING UP FINITE AUTOMATA PRESENTABLE TORSION-FREE ABELIAN GROUPS
• Automata Presenting Structures: A Survey of the Finite String Case
• Describing Groups
• Some natural decision problems in automatic graphs
• Decision Problems of Finite Automata Design and Related Arithmetics
• Automatic linear orders and trees
• STACS 2004
• Automatic Structures: Richness and Limitations
• First-order and counting theories ofω-automatic structures
• Invariants of Automatic Presentations and Semi-synchronous Transductions
• STACS 2005