Mostra el registre d'ítem simple
Automatic evaluation of context-free grammars (system description)
dc.contributor.author | Creus López, Carles |
dc.contributor.author | Godoy Balil, Guillem |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2014-10-03T07:01:26Z |
dc.date.created | 2014 |
dc.date.issued | 2014 |
dc.identifier.citation | Creus, C.; Godoy, G. Automatic evaluation of context-free grammars (system description). A: International Conference on Rewriting Techniques and Applications. "Rewriting and Typed Lambda Calculi : Joint International Conference, RTA-TLCA 2014, held as part of the Vienna Summer of Logic, VSL 2014 : Vienna, Austria, July 14-17, 2014 : Proceedings". Viena: Springer, 2014, p. 139-148. |
dc.identifier.isbn | 978-3-319-08917-1 |
dc.identifier.uri | http://hdl.handle.net/2117/24226 |
dc.description.abstract | We implement an online judge for context-free grammars. Our system contains a list of problems describing formal languages, and asking for grammars generating them. A submitted proposal grammar receives a verdict of acceptance or rejection depending on whether the judge determines that it is equivalent to the reference solution grammar provided by the problem setter. Since equivalence of context-free grammars is an undecidable problem, we consider a maximum length l and only test equivalence of the generated languages up to words of length l. This length restriction is very often sufficient for the well-meant submissions. Since this restricted problem is still NP-complete, we design and implement methods based on hashing, SAT, and automata that perform well in practice. © 2014 Springer International Publishing Switzerland. |
dc.format.extent | 10 p. |
dc.language.iso | eng |
dc.publisher | Springer |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Sistemes d'informació |
dc.subject.lcsh | Context-free grammar |
dc.subject.other | Automata theory |
dc.subject.other | Biomineralization |
dc.subject.other | Context free grammars |
dc.subject.other | Differentiation (calculus) |
dc.subject.other | automata |
dc.subject.other | equivalence |
dc.subject.other | grammars |
dc.subject.other | hashing |
dc.subject.other | SAT |
dc.subject.other | Context free languages |
dc.title | Automatic evaluation of context-free grammars (system description) |
dc.type | Conference report |
dc.subject.lemac | Gramàtica lliure de context |
dc.contributor.group | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.identifier.doi | 10.1007/978-3-319-08918-8-10 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://link.springer.com/chapter/10.1007%2F978-3-319-08918-8_10 |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 15206523 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Creus, C.; Godoy, G. |
local.citation.contributor | International Conference on Rewriting Techniques and Applications |
local.citation.pubplace | Viena |
local.citation.publicationName | Rewriting and Typed Lambda Calculi : Joint International Conference, RTA-TLCA 2014, held as part of the Vienna Summer of Logic, VSL 2014 : Vienna, Austria, July 14-17, 2014 : Proceedings |
local.citation.startingPage | 139 |
local.citation.endingPage | 148 |