On Languages Generated by Signed Grammars

Ömer Eğecioğlu
(Department of Computer Science, University of California, Santa Barbara, CA 93106, USA) 		Benedek Nagy
(Department of Mathematics, Eastern Mediterranean University 99628 Famagusta, North Cyprus, Mersin-10, Turkey, Department of Computer Science, Institute of Mathematics and Informatics, Eszterhazy Karoly Catholic University, Eger, Hungary)

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 Benedek Nagy and Rudolf Freund: Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2023), Famagusta, North Cyprus, 18th-19th September, 2023, Electronic Proceedings in Theoretical Computer Science 388, pp. 28–37.
Published: 15th September 2023.
ArXived at: https://dx.doi.org/10.4204/EPTCS.388.5 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org