Experiments with automata when the upper bound of the number of their states is unknown
| Autor: | I. I. Maksimenko, I. S. Grunskii |
|---|---|
| Rok vydání: | 1999 |
| Předmět: |
Discrete mathematics
TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES Nested word General Computer Science Timed automaton ω-automaton Nonlinear Sciences::Cellular Automata and Lattice Gases Mobile automaton TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES DFA minimization Continuous spatial automaton Quantum finite automata Automata theory Computer Science::Formal Languages and Automata Theory Mathematics |
| Zdroj: | Cybernetics and Systems Analysis. 35:563-571 |
| ISSN: | 1573-8337 1060-0396 |
| DOI: | 10.1007/bf02835853 |
| Popis: | The properties of a class of initial finite automata are investigated; the class is possibly infinite, and each input-output signal of a fixed set of automata from this class is produced by no more than one state. The exact finiteness conditions of this class and its important subclasses and exact existence conditions of check experiments related to these classes are found. The existence conditions of experiments on recognition of such automata are also described. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink