scientific article; zbMATH DE number 5005932

MaRDI QIDQ3365841zbMATH OpenFDO

Authors Valerii B. Kudryavtsev

Publication date 13 February 2006

zbMATH Keywords

completenessexpressibility

Mathematics Subject Classification ID

Many-valued logic (03B50) Algebraic theory of languages and automata (68Q70)

Recommendations

• On the automata functional systems
• Some properties of \(P\)-sets of finite-automaton functions
• scientific article; zbMATH DE number 3988715
• scientific article; zbMATH DE number 2032360
• scientific article; zbMATH DE number 3898772
• Solvability of the problem of completeness of automaton basis depending on its Boolean part
• On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems
• Finiteness of the set of automaton Post bases with solvable completeness problem
• scientific article; zbMATH DE number 3880688
• scientific article; zbMATH DE number 1567839

Cited in

(9)

• Functional aspects of the completeness problem for some classes of automaton functions
• scientific article; zbMATH DE number 4060698 (Why is no real title available?)
• Complete systems of monadic predicates for post classes
• scientific article; zbMATH DE number 1567839 (Why is no real title available?)
• scientific article; zbMATH DE number 3924150 (Why is no real title available?)
• scientific article; zbMATH DE number 3898772 (Why is no real title available?)
• The classes of automata embeddable to pre-complete classes
• Some properties of \(P\)-sets of finite-automaton functions
• Functional systems with the superposition operation

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