scientific article; zbMATH DE number 3841819
From MaRDI portal
Publication:3312199
Recommendations
Cited in
(52)- 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
- Learning pattern languages over groups
- Semiautomatic structures
- Recognizable sets of power series over finite fields
- The complexity of verbal languages over groups
- 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
- -automata
- Second-order finite automata
- Lamplighter groups and automata
- The isomorphism problem for tree-automatic ordinals with addition
- 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
- Tree-automatic scattered linear orders
- A computation model with automatic functions and relations as primitive operations
- String compression in FA-presentable structures
- Learning pattern languages over groups
- Automatic Learners with Feedback Queries
- Finitely generated semiautomatic groups
- scientific article; zbMATH DE number 3864503 (Why is no real title available?)
- Decidability, introduction rules and automata
- A Hierarchy of Automaticω-Words having a Decidable MSO Theory
- scientific article; zbMATH DE number 4025421 (Why is no real title available?)
- Automatic models of first order theories
- Cobham's Theorem seen through Büchi's Theorem
- Monadic decomposability of regular relations
- Recognizable sets of numbers in nonstandard bases
- A hierarchy of tree-automatic structures
- Learners based on transducers
- 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
- Finite automata presentable Abelian groups
- Quasi-isometric reductions between infinite strings
- Automatic learning of subclasses of pattern languages
- Finite-valued streaming string transducers
- Finite-valued streaming string transducers
- Computable classifications of continuous, transducer, and regular functions
- The isomorphism relation between tree-automatic structures
- Quasi-isometric reductions between infinite strings
- The algebras for automatic relations
- Games with -automatic preference relations
- On block pumpable languages
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)
