Completeness of automaton mappings with respect to equivalence relations

zbMATH Open1092.68057MaRDI QIDQ3365835FDOQ3365835

Authors: Jürgen Dassow 

Publication date: 13 February 2006

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

zbMATH Keywords

Automata mappingsCompleteness of function setsDecidability of completeness

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)