A generalization of the theory of incompletely specified machines
From MaRDI portal
Publication:1393206
DOI10.1016/S0022-0000(72)80012-6zbMath0275.94037MaRDI QIDQ1393206
Publication date: 1972
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
68Q45: Formal languages and automata
Cites Work
- Decision Problems of Finite Automata Design and Related Arithmetics
- Slave Memories and Dynamic Storage Allocation
- Minimal solutions of Paull-Unger problems
- Extending the Definition of Prime Compatibility Classes of States in Incomplete Sequential Machine Reduction
- State Assignments in Combinational Networks