On direct products of automaton decidable theories

DOI10.1016/0304-3975(82)90042-1zbMath0493.03002OpenAlexW1998523218MaRDI QIDQ1168306

Bernard R. Hodgson

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90042-1

zbMATH Keywords

automata on infinite wordsproducts of algebraic systems

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Structure theory of algebraic structures (08A05)

Related Items (24)

Tree-automatic scattered linear orders ⋮ Second-order finite automata: expressive power and simple proofs using automatic structures ⋮ A computation model with automatic functions and relations as primitive operations ⋮ Model Theoretic Complexity of Automatic Structures (Extended Abstract) ⋮ Automata Presenting Structures: A Survey of the Finite String Case ⋮ String compression in FA-presentable structures ⋮ Effective categoricity of automatic equivalence and nested equivalence structures ⋮ Deciding the isomorphism problem in classes of unary automatic structures ⋮ Model-theoretic complexity of automatic structures ⋮ Injection Structures Specified by Finite State Transducers ⋮ Isomorphisms of scattered automatic linear orders ⋮ First-order and counting theories ofω-automatic structures ⋮ Learnability of automatic classes ⋮ Unnamed Item ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Analysing Complexity in Classes of Unary Automatic Structures ⋮ ALGEBRAIC LINEAR ORDERINGS ⋮ Where Automatic Structures Benefit from Weighted Automata ⋮ Automatic Structures of Bounded Degree Revisited ⋮ Automatic structures of bounded degree revisited ⋮ BREAKING UP FINITE AUTOMATA PRESENTABLE TORSION-FREE ABELIAN GROUPS ⋮ The isomorphism problem on classes of automatic structures with transitive relations ⋮ Unnamed Item ⋮ Complexity and categoricity of injection structures induced by finite state transducers

Cites Work

• Theories of automata on \(\omega\)-tapes: a simplified approach
• Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition
• The first order properties of products of algebraic systems
• Decidability of Second-Order Theories and Automata on Infinite Trees
• On direct products of theories
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On direct products of automaton decidable theories