COMPLEXITY IN UNION-FREE REGULAR LANGUAGES (Q2909101): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0129054111008933 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980726210 / rank | |||
Normal rank | |||
Latest revision as of 09:24, 30 July 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
