On algorithmic solvability of a completeness problem for linear automata

MaRDI QIDQ1094142zbMATH OpenFDO

Authors Anatoliy A. Chasovskikh

Publication date 1986

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

linear automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Review text

Translation from Vestn. Mosk. Univ., Ser. I 1986, No.3, 82-84 (Russian) (1986; Zbl 0611.68027).

Cited in

(4)

• 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 1406216 (Why is no real title available?)
• scientific article; zbMATH DE number 3219607 (Why is no real title available?)

This page was built for publication: On algorithmic solvability of a completeness problem for linear automata

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