Publication:3312199
From MaRDI portal
zbMath0531.03007MaRDI QIDQ3312199
Publication date: 1983
03D05: Automata and formal grammars in connection with logical questions
03B25: Decidability of theories and sets of sentences
Related Items
A hierarchy of tree-automatic structures, Automatic models of first order theories, Finite automata presentable Abelian groups, Automatic learning of subclasses of pattern languages, The isomorphism relation between tree-automatic structures, The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable, Morphisms and almost-periodicity, On Pascal triangles modulo a prime power, Bertrand numeration systems and recognizability, Automaticity of ordinals and of homogeneous graphs, Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems, On von Neumann regular rings with an automorphism, The modular decomposition of countable graphs. Definition and construction in monadic second-order logic, Robust learning of automatic classes of languages, Automatic learners with feedback queries, Automatic Learners with Feedback Queries, A Hierarchy of Automaticω-Words having a Decidable MSO Theory