Polynomial-time equivalence testing for deterministic fresh-register automata (Q5005176)
From MaRDI portal
scientific article; zbMATH DE number 7378389
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time equivalence testing for deterministic fresh-register automata |
scientific article; zbMATH DE number 7378389 |
Statements
4 August 2021
0 references
automata over infinite alphabets
0 references
language equivalence
0 references
bisimilarity
0 references
computational group theory
0 references
Polynomial-time equivalence testing for deterministic fresh-register automata (English)
0 references
