scientific article; zbMATH DE number 3254910
From MaRDI portal
Publication:5541343
Cited in
(18)- Transformation of a language \(L^\ast\) specification of an FSM into an automata equivalent specification in the language \(L\)
- Synthesis of a nondeterministic automaton from its logical specification. I
- Decision capabilities of diagnostic experiments with linear automata
- Nonlinear automata over a finite ring
- Fault-detection experiment with deterministic realizations and a nondeterministic model
- Generalized synchronization of linear sequential machines
- Generalized information-lossless automata. I
- On preset homing and synchronizing sequences for observable input/output automata
- Finite-state automata in information technologies
- scientific article; zbMATH DE number 7300422 (Why is no real title available?)
- Resolution approach to testing compatibility of interacting automata
- Two types of nonlinear automata over a finite ring
- Fictitiousness analysis of states of a finite-state machine synthesized from its specification transformed from the language L^* to the language L
- scientific article; zbMATH DE number 7301716 (Why is no real title available?)
- scientific article; zbMATH DE number 7301749 (Why is no real title available?)
- Simple-fault checking for automata generated by a fault function
- Zakrevskij's cipher based on reconfigurable FSM
- On the class of L\(^*\)-language formulas that specify finite-memory finite-state machines
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5541343)
