Complexity in Union-Free Regular Languages (Q3584898): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-14455-4_24 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2165473220 / rank | |||
Normal rank | |||
Latest revision as of 20:37, 19 March 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
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
