On Languages Generated by Signed Grammars
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Open Publ Assoc
Access Rights
info:eu-repo/semantics/openAccess
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.
Description
27th International Conference of the Implementation and Application of Automata (CIAA) -- SEP 19-22, 2023 -- Famagusta, CYPRUS
Keywords
Ambiguity
Journal or Series
Electronic Proceedings in Theoretical Computer Science
WoS Q Value
Scopus Q Value
Volume
388
