scientific article; zbMATH DE number 2040323

zbMath1058.68070MaRDI QIDQ4449538

Bakhadyr Khoussainov, Sasha Rubin

Publication date: 11 February 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

model theoryautomatic presentationssynchronous \(n\)-tape automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computable structure theory, computable model theory (03C57)

Related Items (12)

Robust learning of automatic classes of languages ⋮ The growth ratio of synchronous rational relations is unique ⋮ Automatic models of first order theories ⋮ Graphs are not universal for online computability ⋮ Finite automata presentable Abelian groups ⋮ A Hierarchy of Automaticω-Words having a Decidable MSO Theory ⋮ A hierarchy of tree-automatic structures ⋮ FA-presentable groups and rings ⋮ The isomorphism relation between tree-automatic structures ⋮ The isomorphism problem for tree-automatic ordinals with addition ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Left and Right Synchronous Relations

This page was built for publication: