Automatic presentations of structures

DOI10.1007/3-540-60178-3_93OpenAlexW1517606395MaRDI QIDQ6064290

Bakhadyr Khoussainov

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60178-3_93

zbMATH Keywords

Boolean algebrafinite automatoncongruence relationfinite indexunary operation

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Related Items (12)

Second-order finite automata: expressive power and simple proofs using automatic structures ⋮ Symbolic automatic relations and their applications to SMT and CHC solving ⋮ The isomorphism problem for FST injection structures ⋮ The inclusion structure of partially lossy queue monoids and their trace submonoids ⋮ Alternating automatic register machines ⋮ Unnamed Item ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ The back-and-forth method and computability without delay ⋮ Tree-Automatic Well-Founded Trees ⋮ On the width of regular classes of finite structures ⋮ On decidability of list structures ⋮ Complexity and categoricity of injection structures induced by finite state transducers

Cites Work

• Synchronized rational relations of finite and infinite words
• Problem of the number of non-self-equivalent constructivizations
• Polynomial-time versus recursive models
• Effective procedures in field theory
• Computable Algebra, General Theory and Theory of Computable Fields
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automatic presentations of structures