Abstract
We introduce the notions of blocked, block-marked and block-deterministic regular expressions. We characterize block-deterministic regular expressions with deterministic Glushkov block automata. The results can be viewed as a generalization of the characterization of one-unambiguous regular expressions with deterministic Glushkov automata. In addition, when a language L has a block-deterministic expression E, we can construct a deterministic finite-state automaton for L that has size linear in the size of E.
The third author’s research was supported under a grant from the Research Grants Council of Hong Kong SAR. It was partiallyc arried out while the first author was visiting HKUST.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. V. Aho and J. D. Ullman. The Theory of Parsing, Translation, and Compiling, Vol. I: Parsing. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1972.
G. Berry and R. Sethi. From regular expressions to deterministic automata. Theoretical Computer Science, 48:117–126, 1986.
R. V. Book, S. Even, S. A. Greibach, and G. Ott. Ambiguity in graphs and expressions. IEEE Transactions on Electronic Computers, C-20:149–153, 1971.
A. Brüggemann-Klein and D. Wood. One-unambiguous regular languages. Information and Computation, 140:229–253, 1998.
P. Caron and D. Ziadi. Characterization of Glushkov automata. Theoretical Computer Science, 233(1-2):75–90, 2000.
J. M. Champarnaud. Subset Construction Complexityf or Homogeneous Automata, Position Automata and ZPC-Structures. Theoretical Computer Science, 269(1-2), to appear.
J. M. Champarnaud, D. Maurel, D. Ziadi. Determinization of Glushkov automata. Proc. WIA’98, LNCS, 1660:57–68, 1999.
S. Eilenberg. Automata, Languages, and Machines, volume A. Academic Press, New York, NY, 1974.
D. Giammarresi and R. Montalbano. Deterministic generalized automata. Theoretical Computer Science, vol 215, 1-2, 191–208, Elsevier 1998.
D. Giammarresi, J.-L. Ponty, and D. Wood. The Glushkov and Thompson constructions: A synthesis. Unpublished manuscript, July 1998.
V. M. Glushkov. On a synthesis algorithm for abstract automata. Ukr. atem. hurnal, 12(2):147–156, 1960. In Russian.
V. M. Glushkov. The abstract theoryof automata. Russian Mathematical Surveys, 16:1–53, 1961.
ISO 8879: Information processing—Text and office systems— Standard Generalized Markup Language (SGML), October 1986. Int. Organization for Standardization.
R. McNaughton and H. Yamada. Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers, 9:39–47, 1960.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giammarresi, D., Montalbano, R., Wood, D. (2001). Block-Deterministic Regular Languages. In: Theoretical Computer Science. ICTCS 2001. Lecture Notes in Computer Science, vol 2202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45446-2_12
Download citation
DOI: https://doi.org/10.1007/3-540-45446-2_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42672-1
Online ISBN: 978-3-540-45446-5
eBook Packages: Springer Book Archive