The design of checkable automata. I

zbMATH Open0548.68060MaRDI QIDQ799376FDOQ799376

Authors: L. F. Kashirova 

Publication date: 1983

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

Recommendations

• The design of checkable automata. II
• scientific article; zbMATH DE number 1165603
• scientific article; zbMATH DE number 2101008
• Experiments with automata when the upper bound of the number of their states is unknown
• scientific article; zbMATH DE number 1855662

zbMATH Keywords

Upper boundscheckable automatalength of the checking sequence

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (7)

• Checking of automata faults specified by an evaluating function
• Presentations of automata in locally defined classes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The design of checkable automata. II
• Transition count testing of automata

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

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