On Languages Generated by Signed Grammars
arXiv:2309.08718 · doi:10.4204/EPTCS.388.5
Abstract
We 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.
In Proceedings NCMA 2023, arXiv:2309.07333