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

DOI10.1109/12.508316MaRDI QIDQ4420875zbMATH OpenOpenAlexFDO

Authors Supratik Chakraborty, Dipanwita Roy Chowdhury, P. Pal Chaudhuri

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)

Recommendations

• scientific article; zbMATH DE number 5284209
• A deterministic built-in self-test generator based on cellular automata structures
• Modelling sequential circuits with cellular automata
• Publication:3210196
• Group properties of nonlinear cellular automata

Cited in

(6)

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

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

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