The design of checkable automata. II

zbMATH Open0548.68061MaRDI QIDQ799377FDOQ799377

Authors: L. F. Kashirova 

Publication date: 1983

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

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

zbMATH Keywords

upper boundcheckable automatalength of the checking sequence

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (6)

• Algorithms for designing cyclic checking experiments with group automata
• A generalized algorithm for constructing checking sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)