Polynomial algorithm for equivalence problem of deterministic multitape finite automata (Q784484)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial algorithm for equivalence problem of deterministic multitape finite automata |
scientific article; zbMATH DE number 7226874
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial algorithm for equivalence problem of deterministic multitape finite automata |
scientific article; zbMATH DE number 7226874 |
Statements
Polynomial algorithm for equivalence problem of deterministic multitape finite automata (English)
0 references
3 August 2020
0 references
deterministic multitape finite automata
0 references
equivalence
0 references
polynomial complexity
0 references
0.8673726320266724
0 references
0.8581372499465942
0 references
0.8459312915802002
0 references
0.8044511079788208
0 references
0.7940967082977295
0 references
