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