Complexity in Union-Free Regular Languages (Q3584898)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5776428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity in Union-Free Regular Languages |
scientific article; zbMATH DE number 5776428 |
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
0 references
0.93135494
0 references
0.9294121
0 references
0.9294121
0 references
0.9148074
0 references
0.9117094
0 references
0.9117093
0 references
0.9113019
0 references
0.9110247
0 references
