A homomorphism theorem for weighted context-free grammars
From MaRDI portal
Publication:2554955
DOI10.1016/S0022-0000(72)80003-5zbMath0244.68034MaRDI QIDQ2554955
Publication date: 1972
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Rational transductions and complexity of counting problems, Sulla complessita di alcuni problemi di conteggio, On a kind of Fatou property of context-free groups, Classes of formal grammars
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- Some remarks on derivations in general rewriting systems
- A representation theorem for algebraic and context-free power series in noncommuting variables
- Maximin automata
- Maximin sequential-like machines and chains
- Probabilistic and weighted grammars
- Ambiguity in Graphs and Expressions