Every finite sequential machine is linearly realizable

DOI10.1016/S0022-0000(71)80012-0zbMath0222.94056MaRDI QIDQ2547885

Gabor T. Herman

Publication date: 1971

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

Mathematics Subject Classification ID

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

Related Items (5)

When is a sequential machine the realization of another? ⋮ Continuous state models for finite state machines† ⋮ Lineare Realisierbarkeit endlicher Automaten über endlichen Körpern ⋮ Linear realization of finite automata ⋮ Every discrete input machine is linearly simulatable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinite linear sequential machines
• Computable Algebra, General Theory and Theory of Computable Fields
• Decomposition of linear sequential machines
• Computability Over Arbitrary Fields
• Decomposition of linear sequential machines. II
• When is a sequential machine the realization of another?

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