No label defined (Q3706507)
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 3934415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3934415 |
Statements
1984
0 references
0.7854889035224915
0 references
0.7845318913459778
0 references
0.7721310257911682
0 references
A recurrent automaton is a finite automaton of which there is an input sequence transferring any states to the same state. Le \({\mathfrak A}_{mnk}\) be the set of all finite automata with fixed k-element state alphabet, m-element input alphabet and n-element output alphabet. Let \({\mathfrak A}^ B_{mnk}\) be the set of all recurrent automata in \({\mathfrak A}_{mnk}\). Clearly, \(| {\mathfrak A}_{mnk}| =(kn)^{km}\). In this paper, the following main results are proven: \[ | {\mathfrak A}^ B_{1nk}| =| {\mathfrak A}_{1nk}| k^{-1}; \] \[ | {\mathfrak A}_{mnk}| (1-\exp \{-mk^{-1}(1+0(k^{-1}))\})\leq | {\mathfrak A}^ B_{mnk}| \leq \] \[ | {\mathfrak A}_{mnk}| (1-(2\pi k)^{m/2}\exp \{-m(k+0(1))\})\quad (as\quad k\to \infty.) \]
0 references