SCOPUS 정보 검색 플랫폼

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

Volumn 147 LNCS, Issue , 1983, Pages 115-127

Polynomial time inference of extended regular pattern languages

(1) Shinohara, Takeshi a

a KYUSHU UNIVERSITY (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; SYSTEMS SCIENCE AND CYBERNETICS - LEARNING SYSTEMS;

FINITE SET; INFERENCE MACHINE; LONGEST COMMON SUBSEQUENCE PROBLEM; MINIMAL LANGUAGES; NON-EMPTY STRINGS; POLYNOMIAL-TIME; POSITIVE DATA; REGULAR PATTERNS;

POLYNOMIAL APPROXIMATION; COMPUTER PROGRAMMING LANGUAGES;

EXTENDED REGULAR PATTERN LANGUAGES; LONGEST COMMON SUBSEQUENCE PROBLEM; MINIMAL LANGUAGE; MINL CALCULATION; POLYNOMIAL TIME INFERENCE;

EID: 0020916765 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/3-540-11980-9_19 Document Type: Conference Paper

Times cited : (133)

References (10)

1
- 0003415652
- Addison-Wesley, Reading, Mass
- Aho, A.V., Hopcroft, J.E. and Ullman, J.D. (1974), “The Design and Analysis of Computer Algorithms,” Addison-Wesley, Reading, Mass.
- (1974) The Design and Analysis of Computer Algorithms
- Aho, A.V.¹ Hopcroft, J.E.² Ullman, J.D.³

2
- 84961379302
- Finding Patterns Common to a Set of Strings
- Angluin, D. (1979), Finding Patterns Common to a Set of Strings, in “Proceedings, 11th Annual ACM Symposium on Theory of Computing,” pp. 130-141.
- (1979) Proceedings, 11Th Annual ACM Symposium on Theory of Computing , pp. 130-141
- Angluin, D.¹

3
- 0000106131
- Inductive Inference of Formal Languages from Positive Data, Inform
- Angluin, D. (1980), Inductive Inference of Formal Languages from Positive Data, Inform. Contr. 45, 117-135.
- (1980) Contr , vol.45 , pp. 117-135
- Angluin, D.¹

4
- 85034834992
- A personal communication
- Arikawa, S. (1981), A personal communication.
- (1981)
- Arikawa, S.¹

5
- 49949150022
- Language Identification in the Limit, Inform
- Gold, E.M. (1967), Language Identification in the Limit, Inform. Contr. 10, 447-474.
- (1967) Contr , vol.10 , pp. 447-474
- Gold, E.M.¹

6
- 84976825385
- Algorithms for the Longest Common Subsequence Problem
- Hirschberg, D.S. (1977), Algorithms for the Longest Common Subsequence Problem, JACM 24, 664-675.
- (1977) JACM , vol.24 , pp. 664-675
- Hirschberg, D.S.¹

7
- 0003733548
- Addison-Wesley, Reading, Mass
- Hopcroft, J.E. and Ullman, J.D. (1969), “Formal Languages and their Relation to Automata,” Addison-Wesley, Reading, Mass.
- (1969) Formal Languages and Their Relation to Automata
- Hopcroft, J.E.¹ Ullman, J.D.²

8
- 84976657294
- The Complexity of Some Problems on Subsequences and Supersequences
- Maier, D. (1978), The Complexity of Some Problems on Subsequences and Supersequences, JACM 25, 322-336.
- (1978) JACM , vol.25 , pp. 322-336
- Maier, D.¹

9
- 0000896137
- Polynomial Time Inference of Pattern Languages and its Application, in
- Shinohara, T. (1982), Polynomial Time Inference of Pattern Languages and its Application, in “Proceedings, 7th IBM Symposium on Mathematical Foundation of Computer Science.”.
- (1982) Proceedings, 7Th IBM Symposium on Mathematical Foundation of Computer Science
- Shinohara, T.¹

10
- 0015960104
- The string-to-string Correction Problem
- Wagner, R.A., and Fischer, M.J. (1974), The string-to-string Correction Problem, JACM 21, 168-73.
- (1974) JACM , vol.21 , pp. 168-173
- Wagner, R.A.¹ Fischer, M.J.²

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