State complexity of binary coded regular languages (Q6120344): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2024.114399 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4390941915 / rank | |||
Normal rank | |||
Revision as of 09:54, 30 July 2024
scientific article; zbMATH DE number 7807469
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | State complexity of binary coded regular languages |
scientific article; zbMATH DE number 7807469 |
Statements
State complexity of binary coded regular languages (English)
0 references
20 February 2024
0 references
state complexity
0 references
finite automata
0 references
don't care automata
0 references
prefix codes
0 references
promise problems
0 references
