On the public citation graph
Theory and application of nongroup cellular automata for synthesis of easily testable finite state machines
0 signed · 45 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00153859openalex-snapshot
Finite state machine synthesis with embedded test function
inferredcites →https://doi.org/10.1103/revmodphys.55.601openalex-snapshot
Statistical mechanics of cellular automata
inferredcites →https://doi.org/10.1109/12.210176openalex-snapshot
Vector space theoretic analysis of additive cellular automata and its application for pseudoexhaustive test pattern generation
inferredcites →https://doi.org/10.1109/12.286310openalex-snapshot
Design of CAECC - cellular automata based error correcting code
inferredcites →https://doi.org/10.1109/12.338094openalex-snapshot
Theory and applications of cellular automata in cryptography
inferredcites →https://doi.org/10.1109/12.35843openalex-snapshot
Parallel random number generation for VLSI systems using cellular automata
inferredcites →https://doi.org/10.1109/12.372030openalex-snapshot
CA-based byte error-correcting code
inferredcites →https://doi.org/10.1109/43.16807openalex-snapshot
MUSTANG: state assignment of finite state machines targeting multilevel logic implementations
inferredcites →https://doi.org/10.1109/43.39071openalex-snapshot
A synthesis and optimization procedure for fully and easily testable sequential machines
inferredcites →https://doi.org/10.1109/43.55213openalex-snapshot
The analysis of one-dimensional linear cellular automata and their aliasing properties
inferredcites →https://doi.org/10.1109/43.62788openalex-snapshot
Exact algorithms for output encoding, state assignment, and four-level Boolean minimization
inferredcites →https://doi.org/10.1109/43.62790openalex-snapshot
A unified approach to the synthesis of fully testable sequential machines
inferredcites →https://doi.org/10.1109/cicc.1991.164007openalex-snapshot
A system for synthesis of sequential machines with built-in testability
inferredcites →https://doi.org/10.1109/ftcs.1990.89393openalex-snapshot
Optimized synthesis of self-testable finite state machines
inferredcites →https://doi.org/10.1109/iccad.1993.580155openalex-snapshot
Cellular automata based synthesis of easily and fully testable FSMs
inferredcites →https://doi.org/10.1109/tc.1986.1676709openalex-snapshot
Group Properties of Cellular Automata and VLSI Applications
inferredcites →https://doi.org/10.1109/tct.1959.1086506openalex-snapshot
The Theory of Autonomous Linear Sequential Networks
inferredcites →https://doi.org/10.1109/test.1988.207858openalex-snapshot
An incomplete scan design approach to test generation for sequential machines
inferredcites →https://doi.org/10.5555/259794.259896openalex-snapshot
Cellular automata based synthesis of easily and fully testable FSMs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11861201_27openalex-snapshot
Analysis of Hybrid Group Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-1-4615-0853-3_6openalex-snapshot
Redundant Implementations of Linear Finite-State Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-30479-1_80openalex-snapshot
Characterization of a Class of Complemented Group Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-79992-4_17openalex-snapshot
Analysis of 90/150 Two Predecessor Nongroup Cellular Automata
inferred← citeshttps://doi.org/10.1007/bf02936572openalex-snapshot
Analysis of Pseudo-Noise sequences generated by Null Boundary Cellular Automata
inferred← citeshttps://doi.org/10.1007/s11047-018-9696-8openalex-snapshot
A survey of cellular automata: types, dynamics, non-uniformity and applications
inferred← citeshttps://doi.org/10.1016/j.camwa.2006.04.027openalex-snapshot
Analysis of complemented CA derived from linear hybrid group CA
inferred← citeshttps://doi.org/10.1016/j.vlsi.2020.04.001openalex-snapshot
A cellular automata guided two level obfuscation of Finite-State-Machine for IP protection
inferred← citeshttps://doi.org/10.1016/s0895-7177(02)00251-0openalex-snapshot
Behavior of complemented CA whose complement vector is acyclic in a linear TPMACA
inferred← citeshttps://doi.org/10.1016/s0898-1221(03)00028-2openalex-snapshot
Analysis of complemented CA derived from a linear TPMACA
inferred← citeshttps://doi.org/10.1080/10798587.2008.10642990openalex-snapshot
Modeling and Processing Using Reversible Conservative Noisy Elementary Cellular Automata Circuits and their M-Ary Quantum Computing
inferred← citeshttps://doi.org/10.1109/ats.1995.485330openalex-snapshot
Theory and applications of cellular automata for synthesis of easily testable combinational logic
inferred← citeshttps://doi.org/10.1109/icctd.2010.5646131openalex-snapshot
Generation of all unidirectional codes using Cellular Automata
inferred← citeshttps://doi.org/10.1109/icvd.1997.568207openalex-snapshot
On incorporation of BIST for the synthesis of easily and fully testable controllers
inferred← citeshttps://doi.org/10.1109/itc44778.2020.9325223openalex-snapshot
Hardware IP Protection Using Logic Encryption and Watermarking
inferred← citeshttps://doi.org/10.1109/tetc.2020.3046662openalex-snapshot
A Cellular Automata Guided Finite-State-Machine Watermarking Strategy for IP Protection of Sequential Circuits
inferred← citeshttps://doi.org/10.1109/tit.2004.839491openalex-snapshot
Coding Approaches to Fault Tolerance in Linear Dynamic Systems
inferred← citeshttps://doi.org/10.1109/wac.2006.376009openalex-snapshot
m-Valued Quantum Representations and Operations of Elementary Cellular Automata
inferred← citeshttps://doi.org/10.1145/3316781.3317738openalex-snapshot
A Cellular Automata Guided Obfuscation Strategy For Finite-State-Machine Synthesis
inferred← citeshttps://doi.org/10.13140/rg.2.2.35585.61283openalex-snapshot
Cellular Automata: Reversibility, Semi-reversibility and Randomness
inferred← citeshttps://doi.org/10.14569/ijacsa.2011.020517openalex-snapshot
Generating PNS for Secret Key Cryptography Using Cellular Automaton
inferred← citeshttps://doi.org/10.25088/complexsystems.19.1.89openalex-snapshot
Linear Time Algorithm for Identifying the Invertibility of Null-Boundary Three Neighborhood Cellular Automata
inferred← citeshttps://doi.org/10.5772/16155openalex-snapshot
Conservative Reversible Elementary Cellular Automata and their Quantum Computations
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.