Please use this identifier to cite or link to this item:

Evaluating Terminal Heads Of Length K

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

Item Summary Pager, D. 2014-06-03T00:08:11Z 2014-06-03T00:08:11Z 2009-06-01
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.title Evaluating Terminal Heads Of Length K
dc.type Report
dc.type.dcmi Text
Appears in Collections: Technical Reports

Please email if you need this content in ADA-compliant format.

This item is licensed under a Creative Commons License Creative Commons