scientific article; zbMATH DE number 3993564
From MaRDI portal
Publication:4722056
zbMath0614.03038MaRDI QIDQ4722056
Françoise Point, Christian Michaux
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items (8)
On iterating linear transformations over recognizable sets of integers ⋮ Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems ⋮ Recognizable sets of power series over finite fields ⋮ Cobham's Theorem seen through Büchi's Theorem ⋮ The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable ⋮ Logic and rational languages of words indexed by linear orderings ⋮ Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings ⋮ Logic, semigroups and automata on words
This page was built for publication:
