The equivalence problem for LL- and LR-regular grammars


Share/Save/Bookmark

Nijholt, A. (1981) The equivalence problem for LL- and LR-regular grammars. In: Fundamentals of Computation Theory, 24-28 August 1981, Szeged, Hungary (pp. pp. 291-300).

open access
[img]
Preview
PDF
493kB
Abstract:It will be shown that the equivalence problem for LL-regular grammars is decidable. Apart from extending the known result for LL(k) grammar equivalence to LLregular
grammar equivalence, we obtain an alternative proof of the decidability of LL(k) equivalence. The equivalence prob]em for LL-regular grammars has been studied before, but not solved. Our proof that this equivalence problem is decidable is simple. However, this is mainly because we can reduce the problem to the equivalence problem for real-time strict deterministic grammlars, which is decidable.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66932
Official URL:http://dx.doi.org/10.1007/3-540-10854-8_32
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page