Complexity in union-free regular languages (Q2909101)
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 6073870
| 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 6073870 |
Statements
29 August 2012
0 references
union-free regular language
0 references
finite automaton
0 references
one-cycle-free-path automaton
0 references
descriptional complexity
0 references
closure properties
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
Complexity in union-free regular languages (English)
0 references
