Ö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. |
ArXived at: https://dx.doi.org/10.4204/EPTCS.388.5 | bibtex | |
Comments and questions to: eptcs@eptcs.org |
For website issues: webmaster@eptcs.org |