Pages that link to "Item:Q5247168"
From MaRDI portal
The following pages link to THE CHOMSKY-SCHÜTZENBERGER THEOREM FOR QUANTITATIVE CONTEXT-FREE LANGUAGES (Q5247168):
Displaying 13 items.
- A unifying approach to algebraic systems over semirings (Q2000006) (← links)
- Weighted parsing for grammar-based language models over multioperator monoids (Q2051800) (← links)
- Approximate minimization of weighted tree automata (Q2064525) (← links)
- A Kleene theorem for weighted tree automata over tree valuation monoids (Q2280327) (← links)
- Weighted automata with storage (Q2280328) (← links)
- Weighted simple reset pushdown automata (Q2422031) (← links)
- Weighted iterated linear control (Q2422779) (← links)
- Non-erasing Variants of the Chomsky–Schützenberger Theorem (Q3167489) (← links)
- THE BENFORD-NEWCOMB DISTRIBUTION AND UNAMBIGUOUS CONTEXT-FREE LANGUAGES (Q3538858) (← links)
- Quotient and bounded context-free languages (Q3804216) (← links)
- The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages (Q5300841) (← links)
- A Necessary and Sufficient Condition for Chomsky-Productions Over Partially Ordered Symbol Sets (Q5672211) (← links)
- Weighted automata and logics meet computational complexity (Q6647756) (← links)