z-logo
open-access-imgOpen Access
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
Author(s) -
Vladimir A. Zakharov
Publication year - 2020
Publication title -
modelirovanie i analiz informacionnyh sistem
Language(s) - English
Resource type - Journals
eISSN - 2313-5417
pISSN - 1818-1015
DOI - 10.18255/1818-1015-2020-3-260-303
Subject(s) - equivalence (formal languages) , automaton , finite state machine , deterministic automaton , prefix , pushdown automaton , deterministic finite automaton , regular language , model checking , discrete mathematics , computer science , algebraic theory , mathematics , algorithm , algebraic number , theoretical computer science , mathematical analysis , linguistics , philosophy

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here