scientific article; zbMATH DE number 1400048

MaRDI QIDQ4939601zbMATH OpenFDO

Authors Arnaud Maes

Publication date 6 February 2000

zbMATH Keywords

finite alphabetfinite deterministic incomplete automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Foundations of Software Science and Computation Structures
• First-order and counting theories ofω-automatic structures
• Automated Deduction – CADE-20
• Publication:3204451
• Construction of an automaton from a formula of the monadic first-order theory of natural numbers
• DETERMINISTIC AUTOMATA AND THE MONADIC THEORY OF ORDINALS < ω2
• A decidability result for homomorphic representation of automata by \(\alpha _ 0\)-products
• On first-order theories with provability operator
• scientific article; zbMATH DE number 4210102
• A new method for undecidability proofs of first order theories

Cited in

(8)

• scientific article; zbMATH DE number 3841819 (Why is no real title available?)
• A Hierarchy of Automaticω-Words having a Decidable MSO Theory
• Multidimensional generalized automatic sequences and shape-symmetric morphic words
• The monadic theory of morphic infinite words and generalizations
• Substitutions par des motifs en dimension 1
• Iterated pushdown automata and sequences of rational numbers
• scientific article; zbMATH DE number 1759414 (Why is no real title available?)
• A characterization of multidimensional \(S\)-automatic sequences

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 Q4939601)