Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines

DOI10.1109/12.508316zbMath1055.68549OpenAlexW2102631177MaRDI QIDQ4420875

P. Pal Chaudhuri, Dipanwita Roy Chowdhury, Supratik Chakraborty

Publication date: 1996

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.508316

zbMATH Keywords

synthesis for testabilitytestable sequential machines

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (6)

Analysis of pseudo-noise sequences generated by null boundary cellular automata ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Behavior of complemented CA whose complement vector is acyclic in a linear TPMACA. ⋮ Analysis of complemented CA derived from a linear TPMACA. ⋮ Analysis of 90/150 Two Predecessor Nongroup Cellular Automata ⋮ Analysis of complemented CA derived from linear hybrid group CA

This page was built for publication: Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines