On enumeration of Müller automata

Authors:
Michael Domaratzki
Affiliations:
School of Computing, Queen's University, Kingston, ON, Canada
Venue:
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Year:
2003

Citing 4
Cited 0

Counting strongly connected finite automata

Graph theory with applications to algorithms and computer science
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
On the number of distinct languages accepted by finite automata with n states

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Improved bounds on the number of automata accepting finite languages

DLT'02 Proceedings of the 6th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

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 F is admissible if, for each element f ∈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.