scientific article; zbMATH DE number 3988715

MaRDI QIDQ3751013zbMATH OpenFDO

Authors Anatoliy A. Chasovskikh

Publication date 1986

zbMATH Keywords

linear automatalinear functions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Completeness problem for the class of linear automata functions
• scientific article; zbMATH DE number 2032360
• scientific article; zbMATH DE number 468641
• Solvability of the problem of completeness of automaton basis depending on its Boolean part
• On the completeness of systems of finite automata

Cited in

(17)

• Theory of general linear automata
• On the linearity of on-line computable functions
• Linear problems and linear algorithms
• Maximum subclasses in classes of linear automata over finite fields
• Conditions of a-completeness for linear automata over dyadic rationals
• The algorithm for completeness recognizing in function algebra \(L(\mathbb{Z})\)
• Completeness problem for the class of linear automata functions
• scientific article; zbMATH DE number 3854421 (Why is no real title available?)
• scientific article; zbMATH DE number 5005932 (Why is no real title available?)
• scientific article; zbMATH DE number 3982522 (Why is no real title available?)
• scientific article; zbMATH DE number 468641 (Why is no real title available?)
• The laterality problem for non-erasing Turing machines on \lbrace 0,1\rbrace is completely solved
• scientific article; zbMATH DE number 2032360 (Why is no real title available?)
• On the completeness of systems of finite automata
• scientific article; zbMATH DE number 1406216 (Why is no real title available?)
• An exact correspondence of linear problems and randomizing linear algorithms
• scientific article; zbMATH DE number 3219607 (Why is no real title available?)

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