메뉴 건너뛰기




Volumn 1450 LNCS, Issue , 1998, Pages 665-673

Minimal forbidden words and factor automata

Author keywords

Anti factorial language; Avoiding a word; Factor automaton; Factor code; Factorial language; Failure function; Forbidden word

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; ARTIFICIAL INTELLIGENCE;

EID: 84896772724     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055817     Document Type: Conference Paper
Times cited : (6)

References (9)
  • 1
    • 0016518897 scopus 로고
    • Efficient string matching: An aid to bibliographic search
    • A. V. Aho and M. J. Corasick. Efficient string matching: an aid to bibliographic search, Comm. ACM 18:6 (1975) 333-340.
    • (1975) Comm. ACM , vol.18 , Issue.6 , pp. 333-340
    • Aho, A.V.1    Corasick, M.J.2
  • 3
    • 0039460251 scopus 로고    scopus 로고
    • Complexité et facteurs spéciaux
    • J. Cassaigne. Complexité et Facteurs Spéciaux, Bull. Belg. Math. Soc. 4 (1997) 67-88.
    • (1997) Bull. Belg. Math. Soc. , vol.4 , pp. 67-88
    • Cassaigne, J.1
  • 4
    • 0000138270 scopus 로고    scopus 로고
    • Automata for matching patterns
    • G. Rozenberg, A. Salomaa, eds. "Springer-Verlag," Linear Modeling: Background and Application, Chapter 9
    • M. Crochemore, C. Hancart. Automata for matching patterns, in Handbook of Formal Languages, G. Rozenberg, A. Salomaa, eds. "Springer-Verlag,", 1997, Volume 2, Linear Modeling: Background and Application, Chapter 9, 399-462.
    • (1997) Handbook of Formal Languages , vol.2 , pp. 399-462
    • Crochemore, M.1    Hancart, C.2
  • 5
    • 0042174528 scopus 로고    scopus 로고
    • Some identities related to automata, determinants, and möbius functions
    • Fakultät Informatik, Universität Stuttgart
    • V. Diekert, Y. Kobayashi. Some identities related to automata, determinants, and Möbius functions, Report 1997/05, Fakultät Informatik, Universität Stuttgart, 1997.
    • (1997) Report 1997/05
    • Diekert, V.1    Kobayashi, Y.2
  • 6
    • 0028740618 scopus 로고
    • Some combinatorial properties of sturmian words
    • A. de Luca, F. Mignosi. Some Combinatorial Properties of Sturmian Words, Theor. Comp. Sci. 136 (1994) 361-385.
    • (1994) Theor. Comp. Sci. , vol.136 , pp. 361-385
    • De Luca, A.1    Mignosi, F.2
  • 7
    • 0028375266 scopus 로고
    • On bispecial factors of the thue-morse word
    • A. de Luca, L. Mione. On Bispecial Factors of the Thue-Morse Word, Inf. Proc. Lett. 49 (1994) 179-183.
    • (1994) Inf. Proc. Lett. , vol.49 , pp. 179-183
    • De Luca, A.1    Mione, L.2
  • 9
    • 84896798420 scopus 로고
    • Symbolic dynamics and finite automata, invited lecture
    • LNCS 969, Springer, Berlin
    • D. Perrin. Symbolic Dynamics and Finite Automata, invited lecture in Proc. MFCS'95, LNCS 969, Springer, Berlin 1995.
    • (1995) Proc. MFCS'95
    • Perrin, D.1


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