FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS (Q5495421): 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/s0129054113400327 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2057653105 / rank | |||
Normal rank |
Latest revision as of 08:30, 30 July 2024
scientific article; zbMATH DE number 6324619
Language | Label | Description | Also known as |
---|---|---|---|
English | FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS |
scientific article; zbMATH DE number 6324619 |
Statements
FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS (English)
0 references
4 August 2014
0 references
computational complexity
0 references
almost-equivalence
0 references
minimal finite automata
0 references