Pages that link to "Item:Q5300841"
From MaRDI portal
The following pages link to The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages (Q5300841):
Displaying 11 items.
- Characterizations of recognizable weighted tree languages by logic and bimorphisms (Q1797776) (← links)
- Weighted automata (Q2074206) (← links)
- Weighted automata with storage (Q2280328) (← links)
- Weighted iterated linear control (Q2422779) (← links)
- Weighted Symbolic Automata with Data Storage (Q2817389) (← links)
- Non-erasing Variants of the Chomsky–Schützenberger Theorem (Q3167489) (← links)
- The conjecture of Fliess on commutative context-free languages (Q3476286) (← links)
- THE BENFORD-NEWCOMB DISTRIBUTION AND UNAMBIGUOUS CONTEXT-FREE LANGUAGES (Q3538858) (← links)
- Quotient and bounded context-free languages (Q3804216) (← links)
- A Necessary and Sufficient Condition for Chomsky-Productions Over Partially Ordered Symbol Sets (Q5672211) (← links)
- Greibach normal form for \(\omega\)-algebraic systems and weighted simple \(\omega\)-pushdown automata (Q5875673) (← links)