The emptiness problem is undecidable for domains of partial monadic 2- modular tree transformations (Q918726)
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 emptiness problem is undecidable for domains of partial monadic 2- modular tree transformations |
scientific article; zbMATH DE number 4160154
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The emptiness problem is undecidable for domains of partial monadic 2- modular tree transformations |
scientific article; zbMATH DE number 4160154 |
Statements
The emptiness problem is undecidable for domains of partial monadic 2- modular tree transformations (English)
0 references
1990
0 references
modular tree transducer
0 references
post correspondence problem
0 references
automata theory
0 references
0.7483347058296204
0 references
0.7467338442802429
0 references
