Abstract
In this paper, we consider the problem of enumeration of Müller automata with a given number of states. Given a Müller automata, its acceptance table \( \mathcal{F} \) is admissible if, for each element \( f \in \mathcal{F} \), there exists an infinite word whose set of states visited infinitely often is exactly f.
We consider acceptance tables in Müller automata which are never admissible, regardless of the choice of transition function δ. We apply the results to enumeration of Müller automata by number of states.
Research supported in part by an NSERC PGS-B graduate scholarship.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Câmpeanu, C., Păun, A.: The number of similarity relations and the number of minimal deterministic finite cover automata. In Champarnaud, J.M., Maurel, D., eds.: Pre-Proceedings of the Seventh International Conference on Implementation and Application of Automata. (2002) 71–80
Domaratzki, M.: Improved bounds on the number of automata accepting finite languages. In Ito, M., Toyama, M., eds.: DLT 2002: Developments in Language Theory, Sixth International Conference. (2002) 159–181
Domaratzki, M., Kisman, D., Shallit, J.: On the number of distinct languages accepted by finite automata with n states. To appear, J. Automata, Languages and Combinatorics 7 (2002) 469–486
Liskovets, V.: Exact enumeration of acyclic automata. To appear, Formal Power Series and Algebraic Combinatorics 2003 (2003)
Perrin, D., Pin, J.E.: Infinite Words. Available electronically at http://www.liafa.jussieu.fr/~jep/Resumes/InfiniteWords.html (2003)
Thomas, W.: Automata on infinite objects. In van Leeuwen, J., ed.: Handbook of Theoretical Computer Science. Elsevier (1990) 133–192
Staiger, L.: Finite-state ω-languages. J. Comp. Sys. Sci. 37 (1983) 434–448
Robinson, R.W.: Counting strongly connected finite automata. In Alavi, Y., Chartrand, G., Lesniak, L., Lick, D., Wall, C., eds.: Graph Theory with Applications to Algorithms and Computer Science. (1985) 671–685
Liskovets, V.: The number of connected initial automata. Cybernetics 5 (1969) 259–262
Korshunov, A.: Enumeration of finite automata (in Russian). Problemy Kibernetiki 34 (1978) 5–82
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Domaratzki, M. (2003). On Enumeration of Müller Automata. In: Ésik, Z., Fülöp, Z. (eds) Developments in Language Theory. DLT 2003. Lecture Notes in Computer Science, vol 2710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45007-6_20
Download citation
DOI: https://doi.org/10.1007/3-540-45007-6_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40434-7
Online ISBN: 978-3-540-45007-8
eBook Packages: Springer Book Archive