Journal
Scientific and technical journal «Priborostroenie»
UDK510.5
Issue:10 (55)
Download PDF366 Kbyte
Conversion of regular expressions to finite automata and inverse conversion related to the theory of algorithms and automata are considered. Conversions of these models to block diagrams and backwards are presented. Application of the theory of algorithms to practical problems in algorithmic programming languages and testing of programs is discussed.