Pages that link to "Item:Q1325851"
From MaRDI portal
The following pages link to Finite tree automata with cost functions (Q1325851):
Displaying 15 items.
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations (Q557898) (← links)
- Branching automata with costs -- a way of reflecting parallelism in costs (Q703495) (← links)
- Automata-based axiom pinpointing (Q707741) (← links)
- Weighted tree automata and weighted logics (Q860890) (← links)
- Determinization of weighted finite automata over strong bimonoids (Q991892) (← links)
- Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
- Stochastically costed tree automata: Turakainen's theorem (Q1351787) (← links)
- Positive tree representations and applications to tree automata (Q1383144) (← links)
- Weighted automata (Q2074206) (← links)
- Cut sets as recognizable tree languages (Q2493984) (← links)
- Decidable first-order transition logics for PA-processes (Q2575856) (← links)
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics (Q3098032) (← links)
- Automata-Based Axiom Pinpointing (Q3541704) (← links)
- Crisp-determinization of weighted tree automata over strong bimonoids (Q5038197) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)