SCOPUS 정보 검색 플랫폼

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2129, Issue , 2015, Pages 261-272

Testing parenthesis languages

(3) Parnas, Michal a Ron, Dana b Rubinfeld, Ronitt c

a ACADEMIC COLLEGE OF TEL AVIV YAFFO (Israel)

b TEL AVIV UNIVERSITY (Israel)

c NEC LABORATORIES AMERICA (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ALUMINUM; APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL LINGUISTICS; FORMAL LANGUAGES; OPTIMIZATION; RANDOM PROCESSES;

DISTANCE PARAMETER; DYCK LANGUAGE; INPUT STRING; PARENTHESIS LANGUAGES; RUNNING TIME; SUBLINEAR TIME ALGORITHMS; TESTING ALGORITHM; TIME INDEPENDENTS;

CONTEXT FREE LANGUAGES;

EID: 84923081681 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: None Document Type: Conference Paper

Times cited : (8)

References (10)

1
- 0032607562
- Regular languages are testable with a constant number of queries
- N. Alon, M. Krivelevich, I. Newman, and M Szegedy. Regular languages are testable with a constant number of queries. In Proceedings of the Fortieth Annual Symposium on Foundations of Computer Science, pages 656–666, 1999.
- (1999) Proceedings of the Fortieth Annual Symposium on Foundations of Computer Science , pp. 656-666
- Alon, N.¹ Krivelevich, M.² Newman, I.³ Szegedy, M.⁴

2
- 0032108275
- Property testing and its connection to learning and approximation
- O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. JACM, 45(4):653–750, 1998.
- (1998) JACM , vol.45 , Issue.4 , pp. 653-750
- Goldreich, O.¹ Goldwasser, S.² Ron, D.³

3
- 0003626841
- Addison-Wesley
- M. Harrison. Introduction to formal language theory. Addison-Wesley, 1978.
- (1978) Introduction to Formal Language Theory
- Harrison, M.¹

4
- 0000904908
- Fast pattern matching in strings
- D. E. Knuth, J. H. Morris, and V. R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6(2):323–350, 1977.
- (1977) SIAM Journal on Computing , vol.6 , Issue.2 , pp. 323-350
- Knuth, D.E.¹ Morris, J.H.² Pratt, V.R.³

5
- 0003530610
- Springer Verlag
- D. Kozen. Automata and Computability. Springer Verlag, 1997.
- (1997) Automata and Computability
- Kozen, D.¹

6
- 0034512364
- Testing of functions that have small width branching programs
- I. Newman. Testing of functions that have small width branching programs. In Proceedings of the Forty-First Annual Symposium on Foundations of Computer Science, pages 251–258, 2000.
- (2000) Proceedings of the Forty-First Annual Symposium on Foundations of Computer Science , pp. 251-258
- Newman, I.¹

7
- 84923089896
- M. Parnas, D. Ron, and R. Rubinfeld. Testing parenthesis languages. Available from: http://www.eng.tau.ac.il/˜danar, 2001.
- (2001) Testing Parenthesis Languages
- Parnas, M.¹ Ron, D.² Rubinfeld, R.³

8
- 84923079009
- D. Ron. Property testing. To appear in the Handbook on Randomization. Currently available from: http://www.eng.tau.ac.il/˜danar, 2000.
- (2000) Property Testing. To Appear in the Handbook on Randomization
- Ron, D.¹

9
- 0030128622
- Robust characterization of polynomials with applications to program testing
- R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252–271, 1996.
- (1996) SIAM Journal on Computing , vol.25 , Issue.2 , pp. 252-271
- Rubinfeld, R.¹ Sudan, M.²

10
- 77956972992
- The algebraic theory of context-free languages
- P. Braffort and D. Hirschberg, Eds, North Holland
- N. Chomsky M. P. Schotzenberger. The algebraic theory of context-free languages. In Computer Programming and Formal Languages, P. Braffort and D. Hirschberg, Eds, North Holland, pages 118–161, 1963.
- (1963) Computer Programming and Formal Languages , pp. 118-161
- Chomsky, N.¹ Schotzenberger, M.P.²

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