COMPLEXITY IN UNION-FREE REGULAR LANGUAGES (Q2909101): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:12, 3 February 2024
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
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
