메뉴 건너뛰기




Volumn 8, Issue 2, 2002, Pages 363-367

A fast and simple algorithm for constructing minimal acyclic deterministic finite automata

Author keywords

Automata construction algorithms; Minimal acyclic deterministic finite automata

Indexed keywords


EID: 33947380215     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (6)

References (4)
  • 2
    • 33947370327 scopus 로고    scopus 로고
    • A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Automata
    • Potsdam, Germany
    • Watson, B.W.: "A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Automata"; Proc. Workshop on Implementing Automata 1999, Potsdam, Germany (1999)
    • (1999) Proc. Workshop on Implementing Automata
    • Watson, B.W.1
  • 3
    • 33947414891 scopus 로고    scopus 로고
    • A History of Brzozowski's DFA Minimization Algorithm
    • University of Pretoria, South Africa
    • Watson, B.W.: "A History of Brzozowski's DFA Minimization Algorithm"; Computer Science Technical Report, University of Pretoria, South Africa (2001)
    • (2001) Computer Science Technical Report
    • Watson, B.W.1
  • 4
    • 33947378782 scopus 로고    scopus 로고
    • Constructing Minimal Acyclic Deterministic Finite Automata
    • to appear
    • Watson, B.W.: "Constructing Minimal Acyclic Deterministic Finite Automata"; to appear (2002)
    • (2002)
    • Watson, B.W.1


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