ACM International Conference Proceeding Series.
Association for Computing Machinery.
2020.
P. 108-112
Polyhedra of finite state machines and their use in the identification problem
The possible sets of joint distribution of the word occurrence frequencies in the finite state machine input and output sequences are considered. A geometric description of such sets as convex polyhedra in a real unit cube of suitable dimension is proposed. A method has been developed for comparison of unknown and reference automata by the observed input and output sequence fragments. The method does not require installation to the fixed initial state. © Springer Nature Switzerland AG 2020.
Authors
Melnikov S.Yu.
1
,
Samouylov K.E.
1,
2
Language
English
Pages
110-121
Status
Published
Volume
12526 LNCS
Year
2020
Organizations
- 1 Peoples’ Friendship University of Russia (RUDN University), Moscow, Russian Federation
- 2 Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, Moscow, Russian Federation
Keywords
FSM identification; Statistical properties of automata; Word occurrence statistics
Date of creation
20.04.2021
Date of change
20.04.2021
Share
Other records
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).
Vol. 12525 LNCS.
2020.
P. 71-85