Pages that link to "Item:Q5452188"
From MaRDI portal
The following pages link to Tree Automata over Infinite Alphabets (Q5452188):
Displaying 15 items.
- Forward and backward application of symbolic tree transducers (Q404011) (← links)
- Symbolic tree automata (Q483051) (← links)
- Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. (Q1001895) (← links)
- Alternating automata on infinite trees (Q1098325) (← links)
- Regular expressions for data words (Q2353403) (← links)
- A note on the emptiness problem for alternating finite-memory automata (Q2437765) (← links)
- Complexity results on register context-free grammars and related formalisms (Q2672616) (← links)
- FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT (Q3056277) (← links)
- Prolog infinite trees and automata (Q3991295) (← links)
- (Q4036177) (← links)
- (Q4510804) (← links)
- (Q5090498) (← links)
- Projection for Büchi Tree Automata with Constraints between Siblings (Q5859646) (← links)
- Succinct ordering and aggregation constraints in algebraic array theories (Q6561348) (← links)
- Automata and grammars for data words (Q6666782) (← links)