Where automatic structures benefit from weighted automata

DOI10.1007/978-3-642-24897-9_12MaRDI QIDQ3098042zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Automata, Languages and Programming
• Weighted automata and weighted logics
• What's decidable about weighted automata?
• Weighted automata and weighted logics
• Theories of Automatic Structures and Their Complexity

Cites work

• Automata Presenting Structures: A Survey of the Finite String Case
• Automatic linear orders and trees
• Automatic semigroups
• Automatic Structures: Richness and Limitations
• Automaticity of ordinals and of homogeneous graphs
• Breaking up finite automata presentable torsion-free Abelian groups.
• Cardinality and counting quantifiers on omega-automatic structures
• Decision Problems of Finite Automata Design and Related Arithmetics
• Describing Groups
• Easy multiplications. I: The realm of Kleene's theorem
• First-order and counting theories ofω-automatic structures
• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 1302869 (Why is no real title available?)
• Invariants of Automatic Presentations and Semi-synchronous Transductions
• Is Cantor's theorem automatic?
• On direct products of automaton decidable theories
• On graph products of automatic and biautomatic monoids.
• On the problem whether the image of an N-rational series equals N
• On the valuedness of finite transducers
• Singular Artin monoids of finite Coxeter type are automatic.
• Some natural decision problems in automatic graphs
• STACS 2004
• STACS 2005
• The additive group of the rationals does not have an automatic presentation

Cited in

(3)

• The isomorphism problem on classes of automatic structures with transitive relations
• Paths, ends and the separation problem for infinite graphs
• Second-order finite automata: expressive power and simple proofs using automatic structures

This page was built for publication: Where automatic structures benefit from weighted automata

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