The following pages link to A. A. Tal' (Q773245):
Displayed 25 items.
- Finite automata. II (Q773246) (← links)
- On methods for realizing a finite automaton whose cyclic nature is determined by the variation of the input state (Q773247) (← links)
- Finite automata. I (Q773387) (← links)
- Hierarchy and parallelism in Petri nets. II. Composite automaton Petri nets with parallelism (Q1056232) (← links)
- A new type of pneumatic computers. I (Q1131424) (← links)
- Formalized method for intra-factory on-line scheduling of multi-item production (Q1154924) (← links)
- Hierarchy and parallelism in Petri nets. I: Compositive Petri nets (Q1172926) (← links)
- Generalized-type languages of equivalence transformations (Q1233322) (← links)
- Sets realized by automata and described in the YaEP-2 language of equivalent transformations (Q1239136) (← links)
- On the a-posteriori error bounds for the solution of ordinary nonlinear differential equations (Q1247727) (← links)
- A version of the language of equivalent transformations (Q1394055) (← links)
- Clock conversion in sequential machines and the synthesis of relay networks (Q2520988) (← links)
- Questionnaire language and the abstract synthesis of minimal sequential machines (Q2541439) (← links)
- Description of a finite automaton by means of a finite set of input- output sequences. I,II (Q2543325) (← links)
- Application of equivalence relations to the description of events representable by finite automata (Q2545684) (← links)
- Logic, automata, and algorithms. Translation from the Russian (Q2545878) (← links)
- Application of the language of equivalence transformations to describe finite-automata sets (Q2551770) (← links)
- Algorithmic unsolvability of the problem of recognition of recursive event representability by finite automata (Q2625102) (← links)
- (Q3230597) (← links)
- (Q3318114) (← links)
- (Q5339296) (← links)
- (Q5529474) (← links)
- (Q5551170) (← links)
- (Q5599844) (← links)
- (Q5670558) (← links)