An ambiguity hierarchy of weighted context-free grammars
Weighted context-free grammar (WCFG) is a quantitative extension of context-free grammar (CFG). It is known that unambiguous weighted automata (WA), finitely-ambiguous WA, polynomially-ambiguous WA and general WA over the tropical semiring have different expressive powers. We prove that there exists...
Saved in:
Published in | Theoretical computer science Vol. 974; p. 114112 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
29.09.2023
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!