The design of checkable automata. II

MaRDI QIDQ799377zbMATH OpenFDO

Authors L. F. Kashirova

Publication date 1983

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

upper boundcheckable automatalength of the checking sequence

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The design of checkable automata. I
• Automata-Theoretic Model Checking Revisited
• The power of two-way deterministic checking stack automata
• Automata theory and model checking
• Generalizations of Checking Stack Automata: Characterizations and Hierarchies
• Generalizations of checking stack automata: characterizations and hierarchies
• scientific article; zbMATH DE number 2079815
• scientific article; zbMATH DE number 3702558

Cited in

(6)

• scientific article; zbMATH DE number 3924680 (Why is no real title available?)
• Algorithms for designing cyclic checking experiments with group automata
• scientific article; zbMATH DE number 3846885 (Why is no real title available?)
• A generalized algorithm for constructing checking sequences
• The design of checkable automata. I
• Transition count testing of automata

This page was built for publication: The design of checkable automata. II

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