Please use this identifier to cite or link to this item: http://hdl.handle.net/10125/33097

Evaluating Terminal Heads Of Length K

File Size Format  
terminals.pdf 40.41 kB Adobe PDF View/Open

Item Summary

dc.contributor.author Pager, D.
dc.date.accessioned 2014-06-03T00:08:11Z
dc.date.available 2014-06-03T00:08:11Z
dc.date.issued 2009-06-01
dc.identifier.uri http://hdl.handle.net/10125/33097
dc.description.abstract This paper presents an alternative algorithm for finding the terminal heads of length k of a given string in a given context-free grammar for given k.
dc.language.iso en-US
dc.relation.ispartofseries ICS2009-06-03
dc.rights CC0 1.0 Universal
dc.rights.uri http://creativecommons.org/publicdomain/zero/1.0/
dc.title Evaluating Terminal Heads Of Length K
dc.type Report
dc.type.dcmi Text
Appears in Collections: Technical Reports


Please email libraryada-l@lists.hawaii.edu if you need this content in ADA-compliant format.

This item is licensed under a Creative Commons License Creative Commons