4 research outputs found
On Languages Generated by Signed Grammars
Full text linkWe consider languages defined by signed grammars which are similar to
context-free grammars except productions with signs associated to them are
allowed. As a consequence, the words generated also have signs. We use the
structure of the formal series of yields of all derivation trees over such a
grammar as a method of specifying a formal language and study properties of the
resulting family of languages.Comment: In Proceedings NCMA 2023, arXiv:2309.0733
The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages
No full textSeymour Ginsburg and Joseph Ullian. Ambiguity in context free languages. Journal of the Association for Computing Machinery, vol. 13 (1966), pp. 62–89. - Seymour Ginsburg and Joseph Ullian. Preservation of unambiguity and inherent ambiguity in context-free languages.Journal of the Association for Computing Machinery, vol. 13 (1966), pp. 364–368. - Thomas N. Hibbard and Joseph Ullian, The independence of inherent ambiguity from complementedness among context-free languages. Journal of the Association for Computing Machinery, vol. 13 (1966), pp. 588–593.
No full text
