The equivalence problem for deterministic MSO tree transducers is decidable (Q845868)
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: The equivalence problem for deterministic MSO tree transducers is decidable |
scientific article; zbMATH DE number 5664717
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The equivalence problem for deterministic MSO tree transducers is decidable |
scientific article; zbMATH DE number 5664717 |
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
0 references
0 references
0 references
0.9999999
0 references
0.9098449
0 references
0.90930736
0 references
0.9043113
0 references
0.8966123
0 references
0.89475965
0 references
0.8917813
0 references
