Pages that link to "Item:Q4301635"
From MaRDI portal
The following pages link to Equivalence of finite-valued tree transducers is decidable (Q4301635):
Displayed 4 items.
- Queries on XML streams with bounded delay and concurrency (Q553309) (← links)
- Branching synchronization grammars with nested tables (Q596320) (← links)
- Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
- Decomposing a $k$-valued transducer into $k$ unambiguous ones (Q3126010) (← links)