Pages that link to "Item:Q3974879"
From MaRDI portal
The following pages link to Representation of recursively enumerable languages using alternating finite tree recognizers (Q3974879):
Displaying 4 items.
- A representation of recursively enumerable languages by two homomorphisms and a quotient (Q1115633) (← links)
- Synchronized tree automata (Q1325832) (← links)
- Representing recursively enumerable languages by iterated deletion (Q1826643) (← links)
- Yield-languages recognized by alternating tree recognizers (Q3804222) (← links)