scientific article; zbMATH DE number 3934415
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.) \]
- The method of forced enumeration for nondeterministic automata
- Almost optimal bound of recurrent word length for regular automata
- scientific article; zbMATH DE number 3913686 (Why is no real title available?)
- scientific article; zbMATH DE number 3918355 (Why is no real title available?)
- scientific article; zbMATH DE number 3933047 (Why is no real title available?)
- scientific article; zbMATH DE number 3948238 (Why is no real title available?)
- On the number of finite automata stabilized at a fixed state by a constant input
- Enumerated BSP Automata
- On the enumerative sequences of regular languages on k symbols
- scientific article; zbMATH DE number 822047 (Why is no real title available?)
- An algorithm for enumerating all infinite repetitions in a D0L-system
- Skeleton automata
- Applications of the finite state automata for counting restricted permutations and variations
- Enumeration and random generation of accessible automata
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 Q3706507)