On Languages Generated by Signed Grammars

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 gra...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Eğecioğlu, Ömer, Nagy, Benedek
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 15.09.2023
Subjects
Computer Science - Formal Languages and Automata Theory
Grammars
Languages
Online AccessGet full text
ISSN2331-8422
DOI10.48550/arxiv.2309.08718

Cover

More Information
Summary: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.
Bibliography:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:2331-8422
DOI:10.48550/arxiv.2309.08718