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

메뉴 건너뛰기

Theoretical Computer Science

Volumn 1, Issue 4, 1976, Pages 269-288

Remarks on the complexity of nondeterministic counter languages

(1) Greibach, S A a

a UNIVERSITY OF CALIFORNIA (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0006931760 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/0304-3975(76)90072-4 Document Type: Article

Times cited : (47)

References (17)

1
- 0342409168
- Time and tape complexity of pushdown automaton languages
- (1968) Information and Control , vol.13 , pp. 186-206
- Aho¹ Hopcroft² Ullman³

2
- 0040768578
- On languages accepted in polynomial time
- (1972) SIAM Journal on Computing , vol.1 , pp. 281-287
- Book¹

3
- 0016117637
- Comparing complexity classes
- (1974) J. Comput. System Sci. , vol.9 , pp. 213-229
- Book¹

4
- 0008356825
- J-space
- (1976) Theoret. Comput. Sci. , vol.1 , pp. 215-226
- Book¹

5
- 0014921910
- Tape-bounded Turing acceptors and principal AFLs
- (1970) J. Comput. System Sci. , vol.4 , pp. 622-625
- Book¹ Greibach² Ibarra³ Wegbreit⁴

6
- 0015112819
- A note on AFLs and bounded erasing
- (1971) Information and Control , vol.19 , pp. 18-29
- Book¹ Wegbreit²

7
- 0014979424
- Characterizations of pushdown machines in terms of time-bounded computers
- (1971) Journal of the ACM , vol.18 , pp. 4-18
- Cook¹

8
- 0004195499
- McGraw-Hill, New York
- (1958) Computability and Unsolvability
- Davis¹

9
- 0000471153
- Counter machines and counter languages
- (1968) Math. Systems Theory , vol.2 , pp. 265-283
- Fischer¹ Meyer² Rosenberg³

10
- 84918290917
- S.A Greibach, A note on the recognition of one-counter languages, Rev. Française Automat. Informat. Recherche Opérationnelle Sér. Rouge, to appear.

11
- 84918290916
- S. Greibach, Erasable context-free languages, submitted for publication.

12
- 0001693491
- Some results on tape-bounded Turing machines
- (1969) Journal of the ACM , vol.3 , pp. 168-177
- Hopcroft¹ Ullman²

13
- 0010050577
- On two-way multihead automata
- (1963) Journal of Computer and System Sciences , vol.7 , pp. 28-36
- Ibarra¹

14
- 0001699148
- Recursive unsolvability of Post's problem of tag and other topics in the theory of Turing machines
- (1961) The Annals of Mathematics , vol.74 , pp. 437-455
- Minsky¹

15
- 0014776888
- Relationships between nondeterministic and deterministic tape complexities
- (1970) J. Comput. System Sci. , vol.4 , pp. 177-192
- Savitch¹

16
- 0346374258
- Refinements of the nondeterministic time and space hierarchies
- Iowa City, Iowa
- (1973) Proc. 14th Annual Symposium on Switching and Automata Theory , pp. 130-137
- Seiferas¹ Fischer² Meyer³

17
- 0014596760
- A generator of context-sensitive languages
- (1969) J. Comput. System Sci. , vol.3 , pp. 456-461
- Wegbreit¹

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