The equivalence problem for deterministic MSO tree transducers is decidable (Q845868): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710401498911 |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2059690576 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: cs/0506014 / rank | |||
Normal rank | |||
Latest revision as of 18:09, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The equivalence problem for deterministic MSO tree transducers is decidable |
scientific article |
Statements
The equivalence problem for deterministic MSO tree transducers is decidable (English)
0 references
29 January 2010
0 references
formal languages
0 references
automata theory
0 references
equivalence problem
0 references
transducer
0 references
