Every finite sequential machine is linearly realizable

DOI10.1016/S0022-0000(71)80012-0MaRDI QIDQ2547885zbMATH OpenFDO

Authors Gabor T. Herman

Publication date 1971

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0022-0000(71)80012-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cites work

• Computability Over Arbitrary Fields
• Computable Algebra, General Theory and Theory of Computable Fields
• Decomposition of linear sequential machines
• Decomposition of linear sequential machines. II
• scientific article; zbMATH DE number 3248552 (Why is no real title available?)
• scientific article; zbMATH DE number 3276159 (Why is no real title available?)
• scientific article; zbMATH DE number 3332490 (Why is no real title available?)
• scientific article; zbMATH DE number 3336831 (Why is no real title available?)
• scientific article; zbMATH DE number 3341946 (Why is no real title available?)
• scientific article; zbMATH DE number 3083503 (Why is no real title available?)
• Infinite linear sequential machines
• When is a sequential machine the realization of another?

Cited in

(6)

• Linear realization of finite automata
• Lineare Realisierbarkeit endlicher Automaten über endlichen Körpern
• Every discrete input machine is linearly simulatable
• Continuous state models for finite state machines†
• When is a sequential machine the realization of another?
• The school of V. B. Kudryavtsev at the chair of mathematical theory of intelligent systems: traditions and development

This page was built for publication: Every finite sequential machine is linearly realizable

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