Minimizing finite automata is computationally hard
Theoretical Computer Science - Developments in language theory
Language operations with regular expressions of polynomial size
Theoretical Computer Science
Minimizing finite automata is computationally hard
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Optimal simulation of self-verifying automata by deterministic automata
Information and Computation
Structurally unambiguous finite automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Extremal minimality conditions on automata
Theoretical Computer Science
State complexity and limited nondeterminism
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
| Hi-index | 0.00 |