Pages that link to "Item:Q1825038"
From MaRDI portal
The following pages link to On the finite degree of ambiguity of finite tree automata (Q1825038):
Displayed 11 items.
- Queries on XML streams with bounded delay and concurrency (Q553309) (← links)
- Single-valuedness of tree transducers is decidable in polynomial time (Q685348) (← links)
- On the degree of ambiguity of finite automata (Q1177168) (← links)
- Finite tree automata with cost functions (Q1325851) (← links)
- Finite sequentiality of unambiguous max-plus tree automata (Q2048206) (← links)
- On degrees of ambiguity for Büchi tree automata (Q2051784) (← links)
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids (Q2136289) (← links)
- On Finite and Polynomial Ambiguity of Weighted Tree Automata (Q2817402) (← links)
- Equivalence of finite-valued tree transducers is decidable (Q4301635) (← links)
- (Q5090506) (← links)
- On finitely generated monoids of matrices with entries in $\mathbb {N}$ (Q5752758) (← links)