SCOPUS 정보 검색 플랫폼

Volumn 267, Issue 1-2, 2001, Pages 17-34

Subset construction complexity for homogeneous automata, position automata and ZPC-structures

Author keywords

Homogeneous automaton; Position automaton; Position sets; Subset construction; ZPC structure

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; SET THEORY;

SUBSET CONSTRUCTIONS;

FINITE AUTOMATA;

EID: 0035964960 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(00)00293-0 Document Type: Conference Paper

Times cited : (12)

References (21)

2
- 0030110111
- Partial derivatives of regular expressions and finite automaton constructions
- (1996) Theoret. Comput. Sci. , vol.155 , pp. 291-319
- Antimirov, V.¹

3
- 84992236606
- Automate, a computing package for automata and finite semigroups
- (1991) J. Symbolic Comput. , vol.12 , pp. 197-220
- Champarnaud, J.-M.¹ Hansel, G.²

4
- 0002833962
- The abstract theory of automata
- (1961) Russian Math. Surveys , vol.16 , pp. 1-53
- Glushkov, V.M.¹

6
- 0003491599
- Unpublished Report, University of Waterloo, Canada
- (1986) A program for computing finite automata
- Johnson, J.H.¹

7
- 84959041144
- Instruction computation in subset construction
- D. Raymond, D. Wood, S. Yu (Eds.) Automata Implementation: First Internat. Workshop on Implementing Automata, WIA'96, London, Ontario, Springer, Berlin
- (1997) Lecture Notes in Computer Science , vol.1260 , pp. 64-71
- Johnson, J.H.¹ Wood, D.²

8
- 0003067817
- Representation of events in nerve nets and finite automata
- Princeton University Press, Princeton
- (1956) Automata Studies, Ann. Math. Studies , vol.34 , pp. 3-41
- Kleene, S.¹

9
- 0003579995
- Tech. Report CS-92-29, Department of Computer Science, University of Waterloo, Waterloo, Ont., Canada
- (1992) Efficient approaches to subset construction
- Leslie, T.K.S.¹

11
- 84939030805
- Regular expressions and state graphs for automata
- (1960) IEEE Trans. Electron. Comput. , vol.9 , pp. 39-57
- McNaughton, R.F.¹ Yamada, H.²

12
- 0002689259
- Finite automata
- J. van Leeuwen (Ed.) Elsevier Amsterdam
- (1990) Handbook of Theoretical Computer Science, Formal Models and Semantics , vol.B , pp. 1-57
- Perrin, D.¹

13
- 84959065016
- A new quadratic algorithm to convert a regular expression into an automaton
- D. Raymond, D. Wood, S. Yu (Eds.) Automata Implementation: First Internat. Workshop on Implementing Automata, WIA'96, London, Ont., Springer, Berlin
- (1997) Lecture Notes in Computer Science , vol.1260 , pp. 109-119
- Ponty, J.-L.¹ Ziadi, D.² Champarnaud, J.-M.³

14
- 4243443674
- Thèse, Université de Rouen, France
- (1997) Algorithmique et implémentation des automates
- Ponty, J.-L.¹

15
- 0003649512
- An efficient null-free procedure for deciding regular language membership
- (2000) Theoret. Comput. Sci , vol.231 , pp. 89-101
- Ponty, J.-L.¹

16
- 0000973916
- Finite automata and their decision problems
- (1959) IBM J. Res. , vol.3 , Issue.2 , pp. 115-125
- Rabin, M.O.¹ Scott, D.²

17
- 0000817263
- Grail, a C++ library for automata and expressions
- (1994) J. Symbolic Comput. , vol.17 , pp. 341-350
- Raymond, D.¹ Wood, D.²

19
- 0002700117
- Regular languages
- G. Rozenberg, A. Salomaa (Eds.), Springer, Berlin
- (1997) Handbook of Formal Languages, Word, Language, Grammar , vol.1 , pp. 41-110
- Yu, S.¹

20
- 0000516784
- Passage d'une expression rationnelle à un automate fini non-déterministe, Journées Montoises
- (1995) Bull. Belg. Math. Soc. , vol.4 , pp. 177-203
- Ziadi, D.¹ Ponty, J.-L.² Champarnaud, J.-M.³

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