scientific article; zbMATH DE number 3898772

MaRDI QIDQ3677665zbMATH OpenFDO

Authors V. A. Buevich

Publication date 1982

Full work available at URL http://matwbn.icm.edu.pl/tresc.php?wyd=5&tom=7

zbMATH Keywords

A- precomplete classA-complete classbounded deterministic functionsfunctional system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 468641
• Completeness problem for the class of linear automata functions
• The completeness criterion for systems which contain all one-place finite-automaton functions
• scientific article; zbMATH DE number 5005932
• Undecidability of the completeness and A-completeness problems for some systems of automaton functions

Cited in

(11)

• Finite isomorphically complete systems
• Conditions of a-completeness for linear automata over dyadic rationals
• Completeness criterion in class of exponential-polynomial functions
• On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata
• scientific article; zbMATH DE number 5005932 (Why is no real title available?)
• Some properties of \(P\)-sets of finite-automaton functions
• scientific article; zbMATH DE number 4060698 (Why is no real title available?)
• Functional aspects of the completeness problem for some classes of automaton functions
• On algorithmic solvability of the \(A\)-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate \(S\)-functions
• On the existence of an algorithm for recognizing the A-completeness of systems containing all one-place bounded-determinate functions.
• The classes of automata embeddable to pre-complete classes

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