Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/11071
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKountouriotis, V.en
dc.contributor.authorNomikos, C.en
dc.contributor.authorRondogiannis, P.en
dc.date.accessioned2015-11-24T17:02:35Z-
dc.date.available2015-11-24T17:02:35Z-
dc.identifier.issn0304-3975-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/11071-
dc.rightsDefault Licence-
dc.subjectboolean grammarsen
dc.subjectgame semanticsen
dc.subjectsemanticsen
dc.titleA game-theoretic characterization of Boolean grammarsen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.identifier.primaryDOI 10.1016/j.tcs.2010.12.051-
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.publicationDate2011-
heal.abstractWe obtain a simple, purely game-theoretic characterization of Boolean grammars [A. Okhotin, Boolean grammars, Information and Computation, 194(1) (2004) 19-481. In particular, we propose a two-player infinite game of perfect information for Boolean grammars, which is equivalent to their well-founded semantics. The game is directly applicable to the simpler classes of conjunctive and context-free grammars, and offers a promising new connection between game theory and formal languages. (C) 2010 Elsevier B.V. All rights reserved.en
heal.journalNameTheoretical Computer Scienceen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)

Files in This Item:
File Description SizeFormat 
Kountouriotis-2011-A game-theoretic cha.pdf307.9 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons