SCOPUS 정보 검색 플랫폼

Volumn 380, Issue 1-2, 2007, Pages 100-114

Comparing the size of NFAs with and without ε-transitions

Author keywords

Descriptional complexity; Finite automata; Lower bounds on complexity

Indexed keywords

ASYMPTOTIC ANALYSIS; COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; PROBLEM SOLVING; PROGRAM COMPILERS;

DESCRIPTION COMPLEXITY; LOWER BOUNDS; NONDETERMINISTIC FINITE AUTOMATON (NFA); STANDARD CONVERSION;

FINITE AUTOMATA;

EID: 34248584382 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/j.tcs.2007.02.063 Document Type: Article

Times cited : (11)

References (13)

1
- 0015019424
- Ambiguity in graphs and expressions
- Book R., Even S., Greibach S., and Ott G. Ambiguity in graphs and expressions. IEEE Trans. Comput. 20 (1971) 149-153
- (1971) IEEE Trans. Comput. , vol.20 , pp. 149-153
- Book, R.¹ Even, S.² Greibach, S.³ Ott, G.⁴

2
- 0038575684
- Translation of binary regular expressions into nondeterministic ε-free automata with O (n log n) transitions
- Geffert V. Translation of binary regular expressions into nondeterministic ε-free automata with O (n log n) transitions. J. Comput. System Sci. 66 3 (2003) 451-472
- (2003) J. Comput. System Sci. , vol.66 , Issue.3 , pp. 451-472
- Geffert, V.¹

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

4
- 34248515371
- (Translation)
- Jackson J.M. Uspekhi. Mat. Nauk. 16 (1961) 3-41 (Translation)
- (1961) Uspekhi. Mat. Nauk. , vol.16 , pp. 3-41
- Jackson, J.M.¹

5
- 0003620778
- Addison-Wesley Longman Publishing Co., Boston,, MA
- Hopcroft J.E., and Ullman J.D. Introduction to Automata Theory, Languages and Computation (1990), Addison-Wesley Longman Publishing Co., Boston,, MA
- (1990) Introduction to Automata Theory, Languages and Computation
- Hopcroft, J.E.¹ Ullman, J.D.²

6
- 0035361928
- Translating regular expression into small ε-free nondeterministic automata
- Hromkovič J., Seibert S., and Wilke T. Translating regular expression into small ε-free nondeterministic automata. J. Comput. System Sci. 62 4 (2001) 565-588
- (2001) J. Comput. System Sci. , vol.62 , Issue.4 , pp. 565-588
- Hromkovič, J.¹ Seibert, S.² Wilke, T.³

7
- 0003392483
- Springer
- Hromkovic J. Computational Complexity and Parallel Computing (1997), Springer
- (1997) Computational Complexity and Parallel Computing
- Hromkovic, J.¹

8
- 77956759869
- Cambridge University Press
- Kushilevitz E., and Nisan N. Communication Complexity (1997), Cambridge University Press
- (1997) Communication Complexity
- Kushilevitz, E.¹ Nisan, N.²

9
- 0037475053
- A lower bound on the size of ε-free NFA corresponding to a regular expression
- Lifshits Y. A lower bound on the size of ε-free NFA corresponding to a regular expression. Inform. Process. Lett. 85 6 (2003) 293-299
- (2003) Inform. Process. Lett. , vol.85 , Issue.6 , pp. 293-299
- Lifshits, Y.¹

10
- 0000973916
- Finite automata and their decision problems
- Rabin M.O., and Scott D. Finite automata and their decision problems. IBM J. Res. Dev. 3 (1959) 114-125
- (1959) IBM J. Res. Dev. , vol.3 , pp. 114-125
- Rabin, M.O.¹ Scott, D.²

12
- 34248557575
- Springer-Verlag, Berlin
- Sippu S., and Soisalon-Soininen E. Parsing Theory, Vol. I: Languages and Parsing. EATCS Monographs on Theoretical Computer Science vol. 15 (1988), Springer-Verlag, Berlin
- (1988) EATCS Monographs on Theoretical Computer Science , vol.15
- Sippu, S.¹ Soisalon-Soininen, E.²

13
- 84945708555
- Regular expression search
- Thompson K. Regular expression search. Commun. ACM 11 (1968) 419-422
- (1968) Commun. ACM , vol.11 , pp. 419-422
- Thompson, K.¹

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