Implementation of finite automata algorithms as structured programs. I (Q1058299)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3900172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Implementation of finite automata algorithms as structured programs. I |
scientific article; zbMATH DE number 3900172 |
Statements
Implementation of finite automata algorithms as structured programs. I (English)
0 references
1984
0 references
Implementation of finite-automaton algorithms (logical control algorithms) in the form of programs of specific form are discussed. A feature of such programs is use of the stack mechanism for calculations that permit control to be achieved using input information stored in the stack. The software implementation is performed by analysis and transformation of the original description of the finite automaton algorithm.
0 references
finite-automaton algorithms
0 references
logical control algorithms
0 references
software implementation
0 references
0.8739418387413025
0 references
0.7683331966400146
0 references
0.7564123868942261
0 references
