A homomorphism theorem for weighted context-free grammars
- 1 June 1972
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 6 (3) , 217-232
- https://doi.org/10.1016/s0022-0000(72)80003-5
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Ambiguity in Graphs and ExpressionsIEEE Transactions on Computers, 1971
- Probabilistic and weighted grammarsInformation and Control, 1969
- Maximin sequential-like machines and chainsTheory of Computing Systems, 1969
- Note on fuzzy languagesInformation Sciences, 1969
- Maximin automataInformation and Control, 1968
- Some remarks on derivations in general rewriting systemsInformation and Control, 1968
- A representation theorem for algebraic and context-free power series in noncommuting variablesInformation and Control, 1967
- A New Normal-Form Theorem for Context-Free Phrase Structure GrammarsJournal of the ACM, 1965