SCOPUS 정보 검색 플랫폼

Volumn 250, Issue 1-2, 2001, Pages 31-53

Shuffle languages are in P

Author keywords

Automata; Complexity; Polynomial time complexity; Shuffle; Shuffle languages

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; POLYNOMIALS;

POLYNOMIAL-TIME COMPLEXITY; SHUFFLE LANGUAGES;

TURING MACHINES;

EID: 0034911108 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/s0304-3975(99)00109-7 Document Type: Article

Times cited : (41)

References (13)

1
- 0026851035
- Concurrent regular expressions and their relationship to Petri nets
- V.K. Garg, M.T. Ragunath, Concurrent regular expressions and their relationship to Petri nets, Theoret. Comput. Sci. 96 (1992) 285-304.
- (1992) Theoret. Comput. Sci. , vol.96 , pp. 285-304
- Garg, V.K.¹ Ragunath, M.T.²

2
- 0019608225
- Shuffle languages, Petri nets and context sensitive grammars
- J.L. Gischer, Shuffle languages, Petri nets and context sensitive grammars, Commun. ACM 24 (1981) 597-605.
- (1981) Commun. ACM , vol.24 , pp. 597-605
- Gischer, J.L.¹

3
- 0003620778
- Languages and Computation, Addison-Wesley, Reading, MA
- J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
- (1979) Introduction to Automata Theory
- Hopcroft, J.E.¹ Ullman, J.D.²

4
- 0004418003
- The power of synchronizing operations on strings
- M. Jantzen, The power of synchronizing operations on strings, Theoret. Comput. Sci. 14 (1981) 127-154.
- (1981) Theoret. Comput. Sci. , vol.14 , pp. 127-154
- Jantzen, M.¹

5
- 0021937527
- Extending regular operations with iterated shuffle
- M. Jantzen, Extending regular operations with iterated shuffle, Theoret. Comput. Sci. 38 (1985) 223-247.
- (1985) Theoret. Comput. Sci. , vol.38 , pp. 223-247
- Jantzen, M.¹

6
- 0004423906
- On the enlargement of the class of regular languages by shuffle closure
- J. Jȩdrzejowicz, On the enlargement of the class of regular languages by shuffle closure, Inform. Process. Lett. 16 (1983) 51-54.
- (1983) Inform. Process. Lett. , vol.16 , pp. 51-54
- Jȩdrzejowicz, J.¹

7
- 0023371872
- Nesting of shuffle closure is important
- J. Jȩdrzejowicz, Nesting of shuffle closure is important, Inform. Process. Lett. 25 (1987) 363-367.
- (1987) Inform. Process. Lett. , vol.25 , pp. 363-367
- Jȩdrzejowicz, J.¹

8
- 0004391723
- Wydawnictwo Uniwersytetu Gdanskiego
- J. Jȩdrzejowicz, Shuffle Operation in Formal Languages, Wydawnictwo Uniwersytetu Gdanskiego, 1996.
- (1996) Shuffle Operation in Formal Languages
- Jȩdrzejowicz, J.¹

9
- 0001553469
- The complexity of word problems - This time with interleaving
- A.J. Mayer, L.J. Stockmeyer, The complexity of word problems - this time with interleaving, Inform. Comput. 115 (1994) 293-311.
- (1994) Inform. Comput. , vol.115 , pp. 293-311
- Mayer, A.J.¹ Stockmeyer, L.J.²

10
- 0018051780
- Complexity of expressions allowing concurrency
- W.F. Ogden, W.E. Riddle, C. Rounds, Complexity of expressions allowing concurrency, in: Proc. 5th Ann ACM Symp. on Principles of Programming Languages, 1978, pp. 185-194.
- (1978) Proc. 5th Ann ACM Symp. on Principles of Programming Languages , pp. 185-194
- Ogden, W.F.¹ Riddle, W.E.² Rounds, C.³

11
- 4243662259
- Tech. Report, Dept. of Computer and Communication Sciences, Univ. of Michigan, RSSM25
- W.E. Riddle, Software system modelling and analysis, Tech. Report, Dept. of Computer and Communication Sciences, Univ. of Michigan, RSSM25, 1976.
- (1976) Software System Modelling and Analysis
- Riddle, W.E.¹

12
- 0017971023
- Software descriptions with flow expressions
- A.C. Shaw, Software descriptions with flow expressions, IEEE Trans. Software Eng. SE-4 (1978) 242-254.
- (1978) IEEE Trans. Software Eng. , vol.SE-4 , pp. 242-254
- Shaw, A.C.¹

13
- 0000746072
- On the complexity of iterated shuffle
- M.K. Warmuth, D. Haussler, On the complexity of iterated shuffle, J. Comput. Systems Sci. 28 (1984) 345-358.
- (1984) J. Comput. Systems Sci. , vol.28 , pp. 345-358
- Warmuth, M.K.¹ Haussler, D.²

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