Generalizations of 1-deterministic regular languages

Yo Sub Han; Derick Wood

doi:10.1016/j.ic.2008.03.013

Generalizations of 1-deterministic regular languages

Yo Sub Han, Derick Wood

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

9 Citations (Scopus)

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 w₁ w₂ ⋯ w_k of the current input string as lookahead to process the first symbol w₁. On the other hand, the k-block-determinism takes kw₁ w₂ ⋯ w_k 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	https://doi.org/10.1016/j.ic.2008.03.013
Publication status	Published - 2008 Sep

Bibliographical note

Funding Information:
* Corresponding author. E-mail addresses: emmous@kist.re.kr (Y.-S. Han), dwood@cs.ust.hk (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

Access to Document

10.1016/j.ic.2008.03.013

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

Cite this

@article{b2533d3f20fb478cb7af1c76e2630d02,

title = "Generalizations of 1-deterministic regular languages",

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.",

author = "Han, {Yo Sub} and Derick Wood",

note = "Funding Information: * Corresponding author. E-mail addresses: emmous@kist.re.kr (Y.-S. Han), dwood@cs.ust.hk (D. Wood). 1 Han was supported by the KIST TSI Grant.",

year = "2008",

month = sep,

doi = "10.1016/j.ic.2008.03.013",

language = "English",

volume = "206",

pages = "1117--1125",

journal = "Information and Computation",

issn = "0890-5401",

publisher = "Elsevier Inc.",

number = "9-10",

}

TY - JOUR

T1 - Generalizations of 1-deterministic regular languages

AU - Han, Yo Sub

AU - Wood, Derick

N1 - Funding Information: * Corresponding author. E-mail addresses: emmous@kist.re.kr (Y.-S. Han), dwood@cs.ust.hk (D. Wood). 1 Han was supported by the KIST TSI Grant.

PY - 2008/9

Y1 - 2008/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=50349091522&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=50349091522&partnerID=8YFLogxK

U2 - 10.1016/j.ic.2008.03.013

DO - 10.1016/j.ic.2008.03.013

M3 - Article

AN - SCOPUS:50349091522

VL - 206

SP - 1117

EP - 1125

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

IS - 9-10

ER -

Generalizations of 1-deterministic regular languages

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this