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, Tree-automatic scattered linear orders, 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, On block pumpable languages, 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, Semiautomatic structures, Recognizable sets of power series over finite fields, Ostrowski numeration systems, addition, and finite automata, 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, An example of an automatic graph of intermediate growth, On von Neumann regular rings with an automorphism, The modular decomposition of countable graphs. Definition and construction in monadic second-order logic, Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences, Robust learning of automatic classes of languages, Automatic learners with feedback queries, Learning Pattern Languages over Groups, Automatic Learners with Feedback Queries, Finitely Generated Semiautomatic Groups, A Hierarchy of Automaticω-Words having a Decidable MSO Theory
