No label defined (Q5551185)
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 3266647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3266647 |
Statements
1966
0 references
homogeneous experiments
0 references
non-initial automata
0 references
finite weakly non-initial automaton
0 references
decidability algorithm
0 references
The author considers non-initial automata \((I, S, f)\), where \(I\) is the input alphabet, \(S\) the state set (not necessarily finite) and \(f\) the transition function, as well as ``weakly'' non-initial automata \((I, S, f, S_1)\), where \(S_1\) is a subset of \(S\). A word \(P\) is a homogeneous experiment for a weakly non-initial automaton if and only if \(f(s, P)\), where \(s\) ranges over \(S_1\), does not depend on \(s\). Criteria for finding homogeneous experiments are obtained. It is shown that there is an algorithm for deciding whether or not a finite weakly non-initial automaton possesses a homogeneous experiment.
0 references