Polynomial-time equivalence testing for deterministic fresh-register automata (Q5005176): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Polynomial-time equivalence testing for deterministic fresh-register automata | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.4230/lipics.mfcs.2018.72 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2889196489 / rank | |||
Normal rank | |||
| Property / title | |||
Polynomial-time equivalence testing for deterministic fresh-register automata (English) | |||
| Property / title: Polynomial-time equivalence testing for deterministic fresh-register automata (English) / rank | |||
Normal rank | |||
Latest revision as of 10:13, 30 July 2024
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
