Random Deterministic Automata With One Added Transition
Every language recognized by a non-deterministic finite automaton can be recognized by a deterministic automaton, at the cost of a potential increase of the number of states, which in the worst case can go from $n$ states to $2^n$ states. In this article, we investigate this classical result in a pr...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Logical Methods in Computer Science e.V.
2025-01-01
|
| Schriftenreihe: | Logical Methods in Computer Science |
| Schlagworte: | |
| Online-Zugang: | http://lmcs.episciences.org/13044/pdf |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|