Mathematical principles of testing discrete devices by fragment counting

DOI10.1007/BF02366424zbMath0836.68072MaRDI QIDQ1905127

A. S. Barashko

Publication date: 8 January 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Generalized approach to statistical recognition of automata

Cites Work

• Unnamed Item
• Statistical recognition of automata as a function of the length of the analyzed input sequence fragment
• Excessive functions of continuous time Markov chains

This page was built for publication: Mathematical principles of testing discrete devices by fragment counting