SCOPUS 정보 검색 플랫폼

Volumn 79, Issue 3, 2001, Pages 105-109

Efficient minimization of deterministic weak ω-automata

Author keywords

automaton minimization; Algorithms; Computational complexity

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY;

DETERMINISTIC WEAK AUTOMATA (DWA); FINITE AUTOMATA MINIMIZATION;

FINITE AUTOMATA;

EID: 0035979446 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/S0020-0190(00)00183-6 Document Type: Article

Times cited : (65)

References (11)

1
- 0020876535
- Finite-state ω-languages
- (1983) J. Comput. System Sci. , vol.27 , pp. 434-448
- Staiger, L.¹

2
- 0004774414
- Tech. Rep. Reihe Informatik I-9, BTU Cottbus, Fak. f. Mathematik, Naturwissenschaften und Informatik, December
- (1996) On the minimization of Muller-automata
- Gutleben, N.¹

3
- 0001497021
- Automatentheoretische und automatenfreie charakterisierungen topologischer klassen regulärer folgenmengen
- (1974) Elektron. Informationsverarbeitung und Kybernetik EIK , vol.10 , pp. 379-392
- Staiger, L.¹ Wagner, K.²

4
- 0018542186
- On ω-regular sets
- (1979) Inform. and Control , vol.43 , pp. 123-177
- Wagner, K.¹

5
- 0031209059
- On syntactic congruences for ω-languages
- (1997) Theoret. Comput. Sci. , vol.183 , Issue.1 , pp. 93-112
- Maler, O.¹ Staiger, L.²

6
- 0002921593
- On a decision method in restricted second order arithmetic
- (1960) Proc. International Congress on Logic, Method and Philos. Sci. , pp. 1-11
- Büchi, J.¹

7
- 0001568609
- Languages, automata, and logic
- G. Rozenberg, A. Salomaa (Eds.), Springer, Berlin
- (1997) Handbook of Formal Language Theory , vol.3 , pp. 385-455
- Thomas, W.¹

10
- 0002197352
- An nlogn algorithm for minimizing states in a finite automaton
- Academic Press, New York
- (1971) Theory of Machines and Computations , pp. 189-196
- Hopcroft, J.¹

11
- 0003130583
- Describing an algorithm by Hopcroft
- (1973) Acta Inform. , vol.2 , pp. 97-109
- Gries, D.¹

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