No label defined (Q3975178)
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 17834
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 17834 |
Statements
26 June 1992
0 references
probabilistic automata
0 references
deterministic automata
0 references
regular languages
0 references
probabilistic complexity
0 references
0.95445436
0 references
0.9049505
0 references
0 references
0.89400804
0 references
[For the entire collection see Zbl 0726.00018.] In \textit{F. Ablayev} [Lect. Notes Comp. Sci. 324, 154-161 (1986; Zbl 0652.68054)] we formulated a certain property \(F\) of the structure of regular languages in terms of property of states of \(DA\) representing them. It is proved that the probabilistic complexity of arbitrary regular language \(L\) depends upon the power of \(F\)-subset of states of DA representing \(L\) and upon required error probability. In this paper we generalize the results of [loc. cit.].
0 references
