scientific article; zbMATH DE number 17834

From MaRDI portal
Publication:3975178





[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.].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3975178)