Transformation of automata for simplified checking

DOI10.1007/BF02367770zbMath0886.68098OpenAlexW2022589601MaRDI QIDQ1375266

D. V. Speranskii

Publication date: 5 February 1998

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

Full work available at URL: https://doi.org/10.1007/bf02367770

zbMATH Keywords

testingbuilt-in checkerfunctional checking methods

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Finite-order automata having essentially no information losses
• Invertible Boolean Functions

This page was built for publication: Transformation of automata for simplified checking