The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

논문검색

SIAM Journal on Computing
( Vol. 29 NO.1 / (1999))
Regular Closure of Deterministic Languages
Eberhard Bertsch, Mark-Jan Nederhof,
Pages. 81-102
Abstract
Contents 1. Introduction 2. Notation 3. Metadeterministic languages
4. Recognizing fragments of a string 5. Metadeterministic
recognition 6. On-line simulation 7. Producing parse trees 8.
Applications 8.1. Suffix recognition 8.2. Generalized pattern
matching 9. Conclusions
Key words context-free languages, regular languages
Mathmatical Subject Classification 68Q45, 68Q15