scientific article
From MaRDI portal
Publication:3312199
zbMath0531.03007MaRDI QIDQ3312199
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items (42)
Tree-automatic scattered linear orders ⋮ Automaticity of ordinals and of homogeneous graphs ⋮ Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences ⋮ Robust learning of automatic classes of languages ⋮ Automatic learners with feedback queries ⋮ Finitely Generated Semiautomatic Groups ⋮ Second-order finite automata ⋮ Learning pattern languages over groups ⋮ Lamplighter groups and automata ⋮ On Pascal triangles modulo a prime power ⋮ Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems ⋮ Automatic models of first order theories ⋮ Recognizable sets of numbers in nonstandard bases ⋮ A computation model with automatic functions and relations as primitive operations ⋮ Bertrand numeration systems and recognizability ⋮ Word automatic groups of nilpotency class 2 ⋮ On the existential arithmetics with addition and bitwise minimum ⋮ Addition machines, automatic functions and open problems of Floyd and Knuth ⋮ Alternating automatic register machines ⋮ String compression in FA-presentable structures ⋮ On block pumpable languages ⋮ Semiautomatic structures ⋮ Recognizable sets of power series over finite fields ⋮ Finite automata presentable Abelian groups ⋮ A Hierarchy of Automaticω-Words having a Decidable MSO Theory ⋮ The complexity of verbal languages over groups ⋮ A hierarchy of tree-automatic structures ⋮ Cobham's Theorem seen through Büchi's Theorem ⋮ On von Neumann regular rings with an automorphism ⋮ Ostrowski numeration systems, addition, and finite automata ⋮ The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable ⋮ Automatic learning of subclasses of pattern languages ⋮ The modular decomposition of countable graphs. Definition and construction in monadic second-order logic ⋮ The isomorphism relation between tree-automatic structures ⋮ The isomorphism problem for tree-automatic ordinals with addition ⋮ Unnamed Item ⋮ Learners based on transducers ⋮ Automatic Learners with Feedback Queries ⋮ Morphisms and almost-periodicity ⋮ Learning Pattern Languages over Groups ⋮ \( \omega \)-automata ⋮ An example of an automatic graph of intermediate growth
This page was built for publication:
