Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Activities
Research Labs / Equipment
Datasets
Projects
Search by expertise, name or affiliation
The state complexity of random DFAs
Daniel Berend
,
Aryeh Kontorovich
Department of Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The state complexity of random DFAs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Computer Science
State Automaton
100%
Design for Assembly
100%
Deterministic Finite
100%
Automaton
50%
Keyphrases
State Complexity
100%
Deterministic Finite Automata
66%
High Probability
33%
Automata
33%
Number of States
33%
Explicit Constants
33%