Complexity in Union-Free Regular Languages (Q3584898)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity in Union-Free Regular Languages |
scientific article |
Statements
Complexity in Union-Free Regular Languages (English)
0 references
31 August 2010
0 references
regular expressions
0 references
deterministic union-free languages as languages
0 references
one-cycle-free-path deterministic finite automata
0 references
