Generalizations of 1-deterministic regular languages

Yo Sub Han, Derick Wood

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)1117-1125
Number of pages9
JournalInformation and Computation
Issue number9-10
Publication statusPublished - 2008 Sep

Bibliographical note

Funding Information:
* Corresponding author. E-mail addresses: (Y.-S. Han), (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


Dive into the research topics of 'Generalizations of 1-deterministic regular languages'. Together they form a unique fingerprint.

Cite this