메뉴 건너뛰기




Volumn 1099, Issue , 1996, Pages 336-347

Recognizing regular expressions by means of dataflow networks

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; PATTERN MATCHING;

EID: 84947743084     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_140     Document Type: Conference Paper
Times cited : (16)

References (11)
  • 1
    • 0003160094 scopus 로고
    • Algorithms for finding patterns in strings
    • J. van Leeuwen,editor, chapter 5, Elsevier Science Publishers В. V
    • A. V. Aho. Algorithms for finding patterns in strings. In J. van Leeuwen, editor, Handbook of theoretical computer science, chapter 5, pages 257-300. Elsevier Science Publishers В. V., 1990.
    • (1990) Handbook of Theoretical Computer Science , pp. 257-300
    • van Aho, A.1
  • 2
    • 84947726782 scopus 로고    scopus 로고
    • V. Antimirov. Partial derivatives of regular expressions and finite automata constructions. In E. W. Mayr and C. Puech, editors, Proceedings of STACS '95, pages 455-466, Munich, Germany, March 1995. LNCS 900, Springer Verlag.
    • Antimirov, V.1
  • 3
    • 0022989344 scopus 로고
    • From regular expressions to deterministic automata
    • G. Berry and R. Sethi. From regular expressions to deterministic automata. Theoretical Computer Science, 48:117-126, 1986.
    • (1986) Theoretical Computer Science , vol.48 , pp. 117-126
    • Berry, G.1    Sethi, R.2
  • 4
    • 84945709734 scopus 로고
    • Derivatives of regular expressions
    • J. A. Brzozowski. Derivatives of regular expressions. Journal of the ACM, 11(4):481-494, October 1964.
    • (1964) Journal of the ACM , vol.11 , Issue.4 , pp. 481-494
    • Brzozowski, J.A.1
  • 5
    • 0002824996 scopus 로고
    • On equations for regular languages, finite automata, and sequential networks
    • J. A. Brzozowski and E. Leiss. On equations for regular languages, finite automata, and sequential networks. Theoretical Computer Science, 10:19-35, 1980.
    • (1980) Theoretical Computer Science , vol.10 , pp. 19-35
    • Brzozowski, J.A.1    Leiss, E.2
  • 6
    • 0042641553 scopus 로고
    • From regular expressions to DFA's using compressed NFA's
    • Apostolico, Crochemore, Galil, and Manber, editors, LNCS 644, SpringerVerlag
    • C. H. Chang and R. Paige. From regular expressions to DFA's using compressed NFA's. In Apostolico, Crochemore, Galil, and Manber, editors, Combinatorial Pattern Matching. Proceedings, pages 88-108. LNCS 644, Springer Verlag, 1992.
    • (1992) Combinatorial Pattern Matching. Proceedings , pp. 88-108
    • Chang, C.H.1    Paige, R.2
  • 7
    • 0020159687 scopus 로고
    • The compilation of regular expressions into integrated circuits
    • R. W. Floyd and J. D. Ullman. The compilation of regular expressions into integrated circuits. Journal of the ACM, 29(3):603-622, 1982.
    • (1982) Journal of the ACM , vol.29 , Issue.3 , pp. 603-622
    • Floyd, R.W.1    Ullman, J.D.2
  • 9
    • 2742590801 scopus 로고
    • Synchronous observers and the verification of reactive systems
    • M. Nivat, C. Rattray, T. Rus, and G. Scollo, editors, Twente, Workshops in Computing, Springer Verlag
    • N. Halbwachs, F. Lagnier, and P. Raymond. Synchronous observers and the verification of reactive systems. In M. Nivat, C. Rattray, T. Rus, and G. Scollo, editors, Third Int. Conf. on Algebraic Methodology and Software Technology, AMAST'93, Twente, June 1993. Workshops in Computing, Springer Verlag.
    • (1993) Third Int. Conf. On Algebraic Methodology and Software Technology, AMAST'93
    • Halbwachs, N.1    Lagnier, F.2    Raymond, P.3
  • 11
    • 84945708555 scopus 로고
    • Regular expression search algorithm
    • K. Thompson. Regular expression search algorithm. Communications of the ACM, 11(6):419-423, June 1968.
    • (1968) Communications of the ACM , vol.11 , Issue.6 , pp. 419-423
    • Thompson, K.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.