State complexity of binary coded regular languages (Q6120344): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2024.114399 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129754596 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2024.114399 / rank | |||
Normal rank | |||
Latest revision as of 18:39, 30 December 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
0 references
0 references
0 references
