On direct products of automaton decidable theories

DOI10.1016/0304-3975(82)90042-1zbMath0493.03002MaRDI 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 words; products of algebraic systems

Mathematics Subject Classification ID

03D05: Automata and formal grammars in connection with logical questions

03B25: Decidability of theories and sets of sentences

08A05: Structure theory of algebraic structures

Related Items

AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES, First-order and counting theories ofω-automatic structures, Tree-automatic scattered linear orders, Model-theoretic complexity of automatic structures, Learnability of automatic classes, Deciding the isomorphism problem in classes of unary automatic structures, Isomorphisms of scattered automatic linear orders, The isomorphism problem on classes of automatic structures with transitive relations, Injection Structures Specified by Finite State Transducers, ALGEBRAIC LINEAR ORDERINGS, Where Automatic Structures Benefit from Weighted Automata, Automatic structures of bounded degree revisited, BREAKING UP FINITE AUTOMATA PRESENTABLE TORSION-FREE ABELIAN GROUPS, Model Theoretic Complexity of Automatic Structures (Extended Abstract), Automata Presenting Structures: A Survey of the Finite String Case, Analysing Complexity in Classes of Unary Automatic Structures, Automatic Structures of Bounded Degree Revisited

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