We examine two generalizations of 1-deterministic regular languages that are used for the content models of DTDs in XML. They are k-lookahead determinism and k-block-determinism. The k-lookahead determinism uses the first k symbols w1 w2 ⋯ wk of the current input string as lookahead to process the first symbol w1. On the other hand, the k-block-determinism takes kw1 w2 ⋯ wk as lookahead and process the whole k symbols. We show that there is a hierarchy in k-lookahead determinism and there is a proper hierarchy in k-block-determinism. Moreover, we prove that k-block-deterministic regular languages are a proper subfamily of deterministic k-lookahead regular languages.
Bibliographical noteFunding Information:
* Corresponding author. E-mail addresses: firstname.lastname@example.org (Y.-S. Han), email@example.com (D. Wood). 1 Han was supported by the KIST TSI Grant.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics