메뉴 건너뛰기




Volumn 186, Issue 1-2, 1997, Pages 231-248

On the equivalence problem for E-pattern languages

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; PROGRAMMING THEORY;

EID: 0031251093     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00289-7     Document Type: Article
Times cited : (17)

References (11)
  • 1
    • 71049171650 scopus 로고
    • Finding patterns common to a set of strings
    • D. Angluin, Finding patterns common to a set of strings, J. Comput. System Sci. 21 (1980) 46-62.
    • (1980) J. Comput. System Sci. , vol.21 , pp. 46-62
    • Angluin, D.1
  • 2
    • 0000106131 scopus 로고
    • Inductive inference of formal languages from positive data
    • D. Angluin, Inductive inference of formal languages from positive data, Inform. and Control 45 (1980) 117-135.
    • (1980) Inform. and Control , vol.45 , pp. 117-135
    • Angluin, D.1
  • 3
    • 0347671050 scopus 로고    scopus 로고
    • A note on the equivalence problem of E-patterns
    • G. Dányi and Z. Fülöp, A note on the equivalence problem of E-patterns, Inform. Processing Lett. 57 (1996) 125-128.
    • (1996) Inform. Processing Lett. , vol.57 , pp. 125-128
    • Dányi, G.1    Fülöp, Z.2
  • 4
    • 0026239119 scopus 로고
    • Learning regular languages from counterexamples
    • O. Ibarra and T. Jiang, Learning regular languages from counterexamples, J. Comput. System Sci. 43 (1991) 299-316.
    • (1991) J. Comput. System Sci. , vol.43 , pp. 299-316
    • Ibarra, O.1    Jiang, T.2
  • 7
    • 84955576747 scopus 로고
    • MDL learning of unions of simple pattern languages from positive examples
    • Proc. 2nd European Conf. on Computational Learning Theory, Springer, Berlin
    • P. Kilpeläinen, H. Mannila and E. Ukkonen, MDL learning of unions of simple pattern languages from positive examples, in: Proc. 2nd European Conf. on Computational Learning Theory, Lecture Notes in Computer Science, Vol. 904 (Springer, Berlin, 1995) 252-260.
    • (1995) Lecture Notes in Computer Science , vol.904 , pp. 252-260
    • Kilpeläinen, P.1    Mannila, H.2    Ukkonen, E.3
  • 8
    • 21344496526 scopus 로고
    • Nondeterminism in patterns
    • Proc. 11th Ann. Symp. on Theoretical Aspects of Computer Science, Springer, Berlin
    • A. Mateescu and A. Salomaa, Nondeterminism in patterns, in: Proc. 11th Ann. Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 775 (Springer, Berlin, 1994) 661-668.
    • (1994) Lecture Notes in Computer Science , vol.775 , pp. 661-668
    • Mateescu, A.1    Salomaa, A.2
  • 9
    • 21444434470 scopus 로고    scopus 로고
    • On the the equivalence problem for E-pattern languages
    • Proc. 21st Internat. Symp. on Mathematical Foundations of Computer Science
    • E. Ohlebusch and E. Ukkonen, On the the equivalence problem for E-pattern languages (Extended Abstract), in: Proc. 21st Internat. Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 1113 (1996) 457-468.
    • (1996) Lecture Notes in Computer Science , vol.1113 , pp. 457-468
    • Ohlebusch, E.1    Ukkonen, E.2


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