On Languages Generated by Signed Grammars

Simple item page
dc.contributor.authorEgccioglu, Omer
dc.contributor.authorNagy, Benedek
dc.date.accessioned2026-02-06T18:17:04Z
dc.date.issued2023
dc.departmentDoğu Akdeniz Üniversitesi
dc.description27th International Conference of the Implementation and Application of Automata (CIAA) -- SEP 19-22, 2023 -- Famagusta, CYPRUS
dc.description.abstractWe 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.
dc.identifier.doi10.4204/EPTCS.388.5
dc.identifier.endpage37
dc.identifier.issn2075-2180
dc.identifier.scopus2-s2.0-85173066167
dc.identifier.scopusqualityQ4
dc.identifier.startpage28
dc.identifier.urihttps://doi.org/10.4204/EPTCS.388.5
dc.identifier.urihttps://hdl.handle.net/11129/8786
dc.identifier.volume388
dc.identifier.wosWOS:001113966700006
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherOpen Publ Assoc
dc.relation.ispartofElectronic Proceedings in Theoretical Computer Science
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.snmzKA_WoS_20260204
dc.subjectAmbiguity
dc.titleOn Languages Generated by Signed Grammars
dc.typeConference Object

Files

Collections

WoS Indexed Publications Collection
Scopus İndeksli Yayınlar Koleksiyonu