On Languages Generated by Signed Grammars
Formal Languages and Automata Theory
2023-09-19 v1
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.
Cite
@article{arxiv.2309.08718,
title = {On Languages Generated by Signed Grammars},
author = {Ömer Eğecioğlu and Benedek Nagy},
journal= {arXiv preprint arXiv:2309.08718},
year = {2023}
}
Comments
In Proceedings NCMA 2023, arXiv:2309.07333