A game-theoretic characterization of Boolean grammars
| dc.contributor.author | Kountouriotis, V. | en |
| dc.contributor.author | Nomikos, C. | en |
| dc.contributor.author | Rondogiannis, P. | en |
| dc.date.accessioned | 2015-11-24T17:02:35Z | |
| dc.date.available | 2015-11-24T17:02:35Z | |
| dc.identifier.issn | 0304-3975 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/11071 | |
| dc.rights | Default Licence | - |
| dc.subject | boolean grammars | en |
| dc.subject | game semantics | en |
| dc.subject | semantics | en |
| dc.title | A game-theoretic characterization of Boolean grammars | en |
| heal.abstract | We 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.access | campus | - |
| heal.fullTextAvailability | TRUE | - |
| heal.identifier.primary | DOI 10.1016/j.tcs.2010.12.051 | - |
| heal.journalName | Theoretical Computer Science | en |
| heal.journalType | peer reviewed | - |
| heal.language | en | - |
| heal.publicationDate | 2011 | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.type | journalArticle | - |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.type.en | Journal article | en |
Αρχεία
Φάκελος/Πακέτο αδειών
1 - 1 of 1
Φόρτωση...
- Ονομα:
- license.txt
- Μέγεθος:
- 1.74 KB
- Μορφότυπο:
- Item-specific license agreed upon to submission
- Περιγραφή: