메뉴 건너뛰기




Volumn 292, Issue 1, 2003, Pages 131-143

Minimizing subsequential transducers: A survey

Author keywords

Finite automata; Minimization; Sequential machines

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; GRAPH THEORY; PROBLEM SOLVING; SYNTACTICS;

EID: 0037427710     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00219-5     Document Type: Article
Times cited : (56)

References (14)
  • 5
    • 0000061584 scopus 로고    scopus 로고
    • The suffix tree of a tree and minimizing sequential transducers
    • Breslauer D. The suffix tree of a tree and minimizing sequential transducers. Theoret. Comput. Sci. 191:1998;131-144.
    • (1998) Theoret. Comput. Sci. , vol.191 , pp. 131-144
    • Breslauer, D.1
  • 6
    • 85036668306 scopus 로고
    • A combinatorial problem in the theory of free monoids
    • H.A. Maurer. Proc. 6th ICALP Conference, Berlin: Springer
    • Choffrut C. A combinatorial problem in the theory of free monoids. Maurer H.A. Proc. 6th ICALP Conference. Lecture Notes in Computer Science. vol. 71:1979;88-103 Springer, Berlin.
    • (1979) Lecture Notes in Computer Science , vol.71 , pp. 88-103
    • Choffrut, C.1
  • 7
    • 0011937375 scopus 로고
    • A characterization of machine mappings
    • Ginsburg S., Rose G.F. A characterization of machine mappings. Canad. J. Math. 18:1966;381-388.
    • (1966) Canad. J. Math. , vol.18 , pp. 381-388
    • Ginsburg, S.1    Rose, G.F.2
  • 8
    • 85026734155 scopus 로고
    • Minimisation of sequential transducers
    • Springer, Berlin
    • M. Mohri, Minimisation of Sequential Transducers, Lecture Notes in Computer Science, vol. 807, Springer, Berlin, 1994, pp. 151-163.
    • (1994) Lecture Notes in Computer Science , vol.807 , pp. 151-163
    • Mohri, M.1
  • 9
    • 0348198473 scopus 로고    scopus 로고
    • Finite-state transducers in language and speech processing
    • Mohri M. Finite-state transducers in language and speech processing. Comput. Linguistics. 23:1997;269-311.
    • (1997) Comput. Linguistics , vol.23 , pp. 269-311
    • Mohri, M.1
  • 10
    • 0000116303 scopus 로고    scopus 로고
    • Minimization algorithms for sequential transducers
    • Mohri M. Minimization algorithms for sequential transducers. Theoret. Comput. Sci. 234:2000;177-201.
    • (2000) Theoret. Comput. Sci. , vol.234 , pp. 177-201
    • Mohri, M.1
  • 11
    • 0027595230 scopus 로고
    • Learning subsequential transducers for pattern recognition and interpretation tasks
    • Oncina J., Garcia P., Vidal E. Learning subsequential transducers for pattern recognition and interpretation tasks. IEEE Trans. Pattern Anal. Mach. Intell. 15:1993;448-458.
    • (1993) IEEE Trans. Pattern Anal. Mach. Intell. , vol.15 , pp. 448-458
    • Oncina, J.1    Garcia, P.2    Vidal, E.3
  • 12
    • 85031926175 scopus 로고
    • Subsequential functions: Characterizations, minimization, examples
    • International Meeting of Young Computer Scientists, Springer, Berlin
    • C. Reutenauer, Subsequential functions: characterizations, minimization, examples, International Meeting of Young Computer Scientists, Lecture Notes in Computer Science, vol. 464, Springer, Berlin, 1990, pp. 62-79.
    • (1990) Lecture Notes in Computer Science , vol.464 , pp. 62-79
    • Reutenauer, C.1
  • 13
    • 0026203571 scopus 로고
    • Minimization of rational word functions
    • Reutenauer C., Schüzenberger M.P. Minimization of rational word functions. Siam J. Comput. 30(4):1991;669-685.
    • (1991) Siam J. Comput. , vol.30 , Issue.4 , pp. 669-685
    • Reutenauer, C.1    Schüzenberger, M.P.2
  • 14
    • 0000838443 scopus 로고
    • Sur une variante des fonctions séquentielles
    • Schüzenberger M.P. Sur une variante des fonctions séquentielles. Theoret. Comput. Sci. 11:1977;47-57.
    • (1977) Theoret. Comput. Sci. , vol.11 , pp. 47-57
    • Schüzenberger, M.P.1


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