One-Unambiguous Regular Languages

Information and Computation

Volumn 140, Issue 2, 1998, Pages 229-253

  Brüggemann Klein, Anne ^a   Wood, Derick ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0005523089     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2688     Document Type: Article

References (32)

1. Aho, A. V., Hopcroft, J. E., and Ullman, J. D. (1974), "The Design and Analysis of Computer Algorithms," Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley, Reading, MA.
2. Aho, A. V., Sethi, R., and Ullman, J. D. (1986), "Compilers: Principles, Techniques and Tools," Addison-Wesley Series in Computer Science, Addison-Wesley, Reading, MA.
3. Ahonen, H. (1997), Disambiguation of SGML content models, in "PODP 96" (C. Nicholas and D. Wood, Eds.), Lecture Notes in Computer Science, Vol. 1293, pp. 27-37, Springer-Verlag, Berlin.
4. Berstel, J., and Pin, J.-E. (1996), Local languages and the Berry-Sethi algorithm, Theoret. Comput. Sci. 155(2), 439-446.
5. Book, R., Even, S., Greibach, S., and Ott, G. (1971), Ambiguity in graphs and expressions, IEEE Trans. Comput. C-20(2), 149-153.
6. Brüggemann-Klein, A. (1992), Regular expressions into finite automata, in "Latin '92" (I. Simon, Ed.), Lecture Notes in Computer Science, Vol. 583, pp. 87-98, Springer-Verlag, Berlin.
7. Brüggemann-Klein, A. (1993), "Formal Models in Document Processing," Habilitationsschrift, Faculty of Mathematics at the University of Freiburg.
8. Brüggemann-Klein, A. (1993), Unambiguity of extended regular expressions in SGML document grammars, in "Algorithms - ESA '93" (Th. Lengauer, Ed.), pp. 73-84, Springer-Verlag, Berlin.
9. Brüggemann-Klein, A. (1993), Regular expressions into finite automata, 1992, Theoret. Comput. Sci. 120(2), 197-213.
10. Brüggemann-Klein, A., and Wood, D. (1992), Deterministic regular languages, in "STACS 92" (A. Finkel and M. Jantzen, Eds.), Lecture Notes in Computer Science, Vol. 577, pp. 173-184, Springer-Verlag, Berlin.
11. Brzozowski, J. A. (1964), Derivatives of regular expressions, Assoc. Comput. Mach. 11(4), 481-494.
12. Berry, G., and Sethi, R. (1986), From regular expressions to deterministic automata, Theoret. Comput. Sci. 48, 117-126.
13. Champarnaud, J.-M. (1997), "From a Regular Expression to an Automaton," Rapport Technique LIR9708, Laboratoire d'Informatique de Rouen, Université de Rouen.
14. Chen, C.-H., and Paige, R. (1992), "New Theoretical and Computational Results for Regular Languages," Technical Report 587, Courant Institute, New York University. [Also appeared in Proceedings of the Third Symposium on Combinatorial Pattern Matching]
15. Chen, C.-H., and Paige, R. (1992), "New Theoretical and Computational Results for Regular Languages," Technical Report 587, Courant Institute, New York University. [Also appeared in Proceedings of the Third Symposium on Combinatorial Pattern Matching]
16. Chen, C.-H., and Paige, R. (1997), From regular expressions to DFAs using compressed NFAs, Theoret. Comput. Sci. 178(1-2), 1-36.
17. Eilenberg, S. (1974), "Automata, Languages, and Machines," Vol. A, Academic Press, New York.
18. Ginsburg, S., and Harrison, M. A. (1967), Bracketed context-free languages, J. Comput. System Sci. 1(1), 1-23.
19. Glushkov, V. M. (1961), The abstract theory of automata, Russ. Math. Surv. 16, 1-53.
20. Goldfarb, C. F. (1990), "The SGML Handbook," Clarendon Press, Oxford.
21. Hopcroft, J. E., and Ullman, J. D. (1979), "Introduction to Automata Theory, Languages and Computation," Addison-Wesley Series in Computer Science, Addison-Wesley, Reading, MA.
22. ISO 8879: Information processing - Text and office systems - Standard Generalized Markup Language (SGML), October 1986. International Organization for Standardization.
23. Kilpeläinen, P., and Wood, D. (1997), SGML and exceptions, in "PODP 96" (C. Nicholas and D. Wood, Eds.), Lecture Notes in Computer Science, Vol. 1293, pp. 39-49, Springer-Verlag, Berlin.
24. Knuth, D. E., Morris, J., and Pratt, V. (1977), Fast pattern matching in strings, SIAM J. Comput. 6(2), 323-350.
25. Kintala, C. M. R., and Wotschke, D. (1980), Amounts of nondeterminism in finite automata, Acta Inform. 13, 199-204.
26. Leiss, E. (1981), The complexity of restricted regular expressions and the synthesis problem of finite automata, J. Comput. System Sci. 23(3), 348-354.
27. Mirkin, B. G. (1966), An algorithm for constructing a base in a language or regular expressions, Engrg. Cybernet. 5, 110-116.
28. McNaughton, R., and Yamada, H. (1960), Regular expressions and state graphs for automata, IRE Trans. Electron. Comput. EC-9(1), 39-47.
29. Perrin, D. (1990), Finite automata, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. B, pp. 1-57, Elsevier and MIT Press, Amsterdam and Cambridge, MA.
30. Ponty, J.-L., Zaidi, D., and Champarnaud, J.-M. (1997), A new quadratic algorithm to convert a regular expression into an automaton, in "WIA 96" (D. R. Raymond, D. Wood, and S. Yu, Eds.), Lecture Notes in Computer Science, Vol. 1260, pp. 109-119, Springer-Verlag, Berlin.
31. Watson, B. W. (1995), "Taxonomies and Toolkits of Regular Language Algorithms," Ph.D. thesis, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
32. Wood, D. (1987), "Theory of Computation," Wiley, New York.