Completeness of automaton mappings with respect to equivalence relations

MaRDI QIDQ3365835zbMATH OpenFDO

Authors Jürgen Dassow

Publication date 13 February 2006

zbMATH Keywords

Automata mappingsCompleteness of function setsDecidability of completeness

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Recommendations

• Undecidability of the completeness and A-completeness problems for some systems of automaton functions
• On the classification of Post automaton bases by the decidability of the \(A\)-completeness property for definite automata
• scientific article; zbMATH DE number 468641
• Functional aspects of the completeness problem for some classes of automaton functions
• The completeness criterion for \(S\)-sets of determinate functions

Cited in

(5)

• scientific article; zbMATH DE number 468641 (Why is no real title available?)
• scientific article; zbMATH DE number 5654534 (Why is no real title available?)
• scientific article; zbMATH DE number 4030995 (Why is no real title available?)
• scientific article; zbMATH DE number 1268706 (Why is no real title available?)
• scientific article; zbMATH DE number 64152 (Why is no real title available?)

This page was built for publication: Completeness of automaton mappings with respect to equivalence relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3365835)