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
Theoretical Computer Science - Descriptional complexity of formal systems
Enumeration and random generation of accessible automata
Theoretical Computer Science
Enumeration and generation with a string automata representation
Theoretical Computer Science
Improved bounds on the number of automata accepting finite languages
DLT'02 Proceedings of the 6th international conference on Developments in language theory
On enumeration of Müller automata
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Geometrical regular languages and linear diophantine equations
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Geometrical regular languages and linear Diophantine equations: The strongly connected case
Theoretical Computer Science
Generating small automata and the Černý conjecture
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Hi-index | 0.00 |