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...
محفوظ في:
| المؤلفون الرئيسيون: | , , , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Logical Methods in Computer Science e.V.
2025-01-01
|
| سلاسل: | Logical Methods in Computer Science |
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://lmcs.episciences.org/13044/pdf |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|