On the asymptotic enumeration of accessible automata
Automata, Logic and Semantics
Main Author: | Elcio Lebensztayn |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2010-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/512/pdf |
Similar Items
-
Asymptotic enumeration on self-similar graphs with two boundary vertices
by: Elmar Teufl, et al.
Published: (2009-01-01) -
q-Enumeration of words by their total variation
by: Ligia Loreta Cristea, et al.
Published: (2011-01-01) -
A perimeter enumeration of column-convex polyominoes
by: Svjetlan Feretić
Published: (2007-01-01) -
Baire and automata
by: Pierre Simonnet, et al.
Published: (2007-01-01) -
Enumeration of words by the sum of differences between adjacent letters
by: Toufik Mansour
Published: (2009-01-01)