SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Information and Control

Volumn 51, Issue 1, 1981, Pages 76-87

A note on the number of queries needed to identify regular languages

(1) Angluin, Dana a

a YALE UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003177228 PISSN: 00199958 EISSN: None Source Type: Journal
DOI: 10.1016/S0019-9958(81)90090-5 Document Type: Article

Times cited : (117)

References (7)

1
- 0003415652
- Addison-Wesley, Brooklyn
- (1974) The Design and Analysis of Computer Algorithms
- Aho¹ Hopcroft² Ullman³

2
- 0003690974
- McGraw-Hill, Reading, Mass
- (1962) Introduction to the Theory of Finite-State Machines
- Gill¹

3
- 0003626841
- Addison-Wesley, New York
- (1978) Introduction to Formal Language Theory
- Harrison¹

4
- 0003881270
- Prentice-Hall, Reading, Mass
- (1966) Algebraic Theory of Sequential Machines
- Hartmanis¹ Stearns²

5
- 0003620778
- Addison-Wesley, Englewood Cliffs, N. J.
- (1979) Introduction to Automata and Formal Languages
- Hopcroft¹ Ullman²

6
- 0002703887
- Gedanken-experiments on sequential machines
- C.E. Shannon, J. McCarthy, Princeton Univ. Press, Reading, Mass.
- (1956) Automata Studies , pp. 129-153
- Moore¹

7
- 0004787268
- A solution of the syntactical induction-inference problem for regular languages
- (1978) Comput. Lang. , vol.3 , pp. 53-64
- Pao¹ Carr²

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