Generalizations of 1-deterministic regular languages

Authors:
Yo-Sub Han;Derick Wood
Affiliations:
Intelligence and Interaction Research Center, Korea Institute of Science and Technology, P.O. Box 131, Cheongnyang, Seoul, Republic of Korea;Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong
Venue:
Information and Computation
Year:
2008

Citing 9
Cited 1

Regular expressions into finite automata

Theoretical Computer Science
One-unambiguous regular languages

Information and Computation
Deterministic generalized automata

Theoretical Computer Science
Characterization of Glushkov automata

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
Theory of Computation: A Primer

Theory of Computation: A Primer
The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
Block-Deterministic Regular Languages

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Predictable semiautomata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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"1w"2...w"k of the current input string as lookahead to process the first symbol w"1. On the other hand, the k-block-determinism takes kw"1w"2...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.