Graph representation of context-free grammars

Simple item page
dc.creatorShkotin, Alex
dc.date2007-03-03
dc.date.accessioned2026-07-07T07:50:02Z
dc.date.available2026-07-07T07:50:02Z
dc.descriptionIn modern mathematics, graphs figure as one of the better-investigated class of mathematical objects. Various properties of graphs, as well as graph-processing algorithms, can be useful if graphs of a certain kind are used as denotations for CF-grammars. Furthermore, graph are well adapted to various extensions (one kind of such extensions being attributes).
dc.description4 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/cs/0703015
dc.identifierhttp://arxiv.org/abs/cs/0703015
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/125037
dc.subjectLogic in Computer Science
dc.subjectD.3.1; E.1
dc.titleGraph representation of context-free grammars
dc.typetext

Files

Collections

arXiv