Abstract
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 language | English |
|---|---|
| Pages (from-to) | 1117-1125 |
| Number of pages | 9 |
| Journal | Information and Computation |
| Volume | 206 |
| Issue number | 9-10 |
| DOIs | |
| Publication status | Published - 2008 Sep |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics
Fingerprint Dive into the research topics of 'Generalizations of 1-deterministic regular languages'. Together they form a unique fingerprint.
Cite this
Han, Y. S., & Wood, D. (2008). Generalizations of 1-deterministic regular languages. Information and Computation, 206(9-10), 1117-1125. https://doi.org/10.1016/j.ic.2008.03.013