메뉴 건너뛰기




Volumn 3340, Issue , 2004, Pages 63-75

Regular expressions for two-dimensional languages over one-letter alphabet

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; PATTERN MATCHING;

EID: 20344401399     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30550-7_6     Document Type: Article
Times cited : (4)

References (17)
  • 4
    • 0001954323 scopus 로고
    • Two-dimensional languages and recognizable functions
    • Finland, 1993, Rozenberg, G., Salomaa A. (Eds), World Scientific Publishing Co.
    • Giammarresi, D.: Two-dimensional languages and recognizable functions. (Proc., Developments in language theory, Finland, 1993), Rozenberg, G., Salomaa A. (Eds), World Scientific Publishing Co. (1994)
    • (1994) Proc., Developments in Language Theory
    • Giammarresi, D.1
  • 5
    • 0037826948 scopus 로고    scopus 로고
    • Two-dimensional finite state recognizability
    • Giammarresi, D., Restivo, A.: Two-dimensional finite state recognizability. Fundamenta Informaticae 25:3, 4 (1996) 399-422
    • (1996) Fundamenta Informaticae , vol.25 , Issue.3-4 , pp. 399-422
    • Giammarresi, D.1    Restivo, A.2
  • 6
    • 0011975194 scopus 로고    scopus 로고
    • Two-dimensional languages
    • G. Rozenberg et al Eds: Springer Verlag
    • Giammarresi, D., Restivo, A.: Two-dimensional languages. In: G. Rozenberg et al Eds: Handbook of Formal Languages Vol. III. Springer Verlag (1997) 215-268
    • (1997) Handbook of Formal Languages , vol.3 , pp. 215-268
    • Giammarresi, D.1    Restivo, A.2
  • 8
    • 0017731929 scopus 로고    scopus 로고
    • Some properties of two-dimensional on-line tessellation acceptors
    • Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tessellation acceptors. Information Sciences. 13 (1997) 95-121
    • (1997) Information Sciences , vol.13 , pp. 95-121
    • Inoue, K.1    Nakamura, A.2
  • 9
    • 0018737170 scopus 로고
    • Two-dimensional finite automata and unacceptable functions
    • Inoue, K., Nakamura, A.: Two-dimensional finite automata and unacceptable functions. Intern. J. Comput. Math. Sec. A 7 (1979) 207-213
    • (1979) Intern. J. Comput. Math. Sec. A , vol.7 , pp. 207-213
    • Inoue, K.1    Nakamura, A.2
  • 10
    • 0346384393 scopus 로고
    • A Characterization of recognizable picture languages
    • Proc., Second International Colloquium on Parallel Image Processing Springer-Verlag, Berlin
    • Inoue, K., Takanami, I.: A Characterization of recognizable picture languages. (Proc., Second International Colloquium on Parallel Image Processing) LNCS 654 Springer-Verlag, Berlin (1993)
    • (1993) LNCS , vol.654
    • Inoue, K.1    Takanami, I.2
  • 13
    • 0021873698 scopus 로고
    • Three-way Automata on Rectangular Tapes over a One-Letter Alphabet
    • Elsevier Sc. Publ.
    • Kinber, E. B.: Three-way Automata on Rectangular Tapes over a One-Letter Alphabet. Information Sciences 35 Elsevier Sc. Publ. (1985) 61-77
    • (1985) Information Sciences , vol.35 , pp. 61-77
    • Kinber, E.B.1
  • 14
    • 84949641867 scopus 로고    scopus 로고
    • Regular expressions and Context-free Grammars for picture languages
    • (Proc. STACS'97) Springer Verlag
    • Matz, O.: Regular expressions and Context-free Grammars for picture languages. (Proc. STACS'97) LNCS 1200 Springer Verlag (1997) 283-294
    • (1997) LNCS , vol.1200 , pp. 283-294
    • Matz, O.1
  • 15
    • 0000973916 scopus 로고
    • Finite automata and their decision problems
    • Rabin, M., Scott, T.: Finite automata and their decision problems. IBM Journal Res. and Dev. 3 (1959) 114-125
    • (1959) IBM Journal Res. and Dev. , vol.3 , pp. 114-125
    • Rabin, M.1    Scott, T.2
  • 16
    • 0347026522 scopus 로고    scopus 로고
    • A characterization of recognizable picture languages by tilings by finite sets
    • Simplot, D.: A characterization of recognizable picture languages by tilings by finite sets. Theoretical Computer Science 218:2 (1999) 297-323
    • (1999) Theoretical Computer Science , vol.218 , Issue.2 , pp. 297-323
    • Simplot, D.1
  • 17
    • 21744460612 scopus 로고    scopus 로고
    • Star-free picture expressions are strictly weaker than first-order logic
    • (Proc. ICALP'97) Springer-Verlag
    • Wilke, T.: Star-free picture expressions are strictly weaker than first-order logic. (Proc. ICALP'97) LNCS 1256 Springer-Verlag (1997) 347-357
    • (1997) LNCS , vol.1256 , pp. 347-357
    • Wilke, T.1


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