Data Structure Analysis to Represent Basic Models of Finite State Automation
<p>Complex system engineering based on the automaton models requires a reasoned data structure selection to implement them. The problem of automaton representation and data structure selection to be used in it has been understudied. Arbitrary data structure selection for automaton model softwa...
Main Authors: | V. V. Gurenko, B. I. Bychkov |
---|---|
Format: | Article |
Language: | Russian |
Published: |
MGTU im. N.È. Baumana
2015-01-01
|
Series: | Nauka i Obrazovanie |
Subjects: | |
Online Access: | http://technomag.edu.ru/jour/article/view/363 |
Similar Items
-
Some more on the basis finite automaton
by: Melnikov Boris, et al.
Published: (2013-12-01) -
Finite state automaton construction through regular expression hashing
by: Coetser, Rayner Johannes Lodewikus
Published: (2013) -
Model of the management program for a means complex of the design works automation as a finite-state automaton
by: Zakharchenko V. P., et al.
Published: (2017-12-01) -
Employing finite-state machines in data integrity problems
by: Malikov Andrey, et al.
Published: (2016-01-01) -
Some more algorithms for Conway’s universal automaton
by: Melnikov Boris, et al.
Published: (2014-06-01)