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

메뉴 건너뛰기

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

Volumn 1530 LNCS, Issue , 1998, Pages 355-367

A kleene iteration for parallelism

(2) Lodaya, Kamal a Weil, Pascal b

a INSTITUTE OF MATHEMATICAL SCIENCES (India)

b UNIVERSITÉ BORDEAUX 1 (France)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE ALGEBRAS; KLEENE THEOREM; MORPHISMS; NATURAL GENERALIZATION; RATIONAL EXPRESSIONS; RECOGNIZABLE LANGUAGES; SERIES-PARALLEL; TWO-PRODUCT;

ALGEBRA; ITERATIVE METHODS; PETRI NETS; SET THEORY; SOFTWARE ENGINEERING;

AUTOMATA THEORY;

EID: 84887124890 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/978-3-540-49382-2_33 Document Type: Conference Paper

Times cited : (23)

References (17)

1
- 0030214497
- Free shuffle algebras in language varieties
- S. Bloom and Z. Esik. Free shuffle algebras in language varieties, TCS 163 (1996) 55-98. 358 (Pubitemid 126412004)
- (1996) Theoretical Computer Science , vol.163 , Issue.1-2 , pp. 55-98
- Bloom, S.L.¹ Esik, Z.²

2
- 0347006666
- Notes on algebraic calculi of processes
- (K.R. Apt, ed.), NATO ASI Series F13 ( 356
- G. Boudol. Notes on algebraic calculi of processes, in Logics and models of concurrent systems (K.R. Apt, ed.), NATO ASI Series F13 (1985) 261-305. 356
- (1985) Logics and Models of Concurrent Systems , pp. 261-305
- Boudol, G.¹

3
- 0003430859
- (D. Siefkes, ed.), Springer ( 356, 359, 360
- J.R. Büchi. Finite automata, their algebras and grammars: Towards a theory of formal expressions (D. Siefkes, ed.), Springer (1989). 356, 359, 360
- (1989) Finite Automata, Their Algebras and Grammars: Towards A Theory of Formal Expressions
- Büchi, J.R.¹

4
- 0000809609
- Graph rewriting: An algebraic and logical approach
- (J. van Leeuwen, ed.), Elsevier ( 355
- B. Courcelle. Graph rewriting: an algebraic and logical approach, in Handbook of Theoretical Computer Science B (J. van Leeuwen, ed.), Elsevier (1990). 355
- (1990) Handbook of Theoretical Computer Science B
- Courcelle, B.¹

5
- 0026123837
- Monadic second-order logic of graphs V. On closing the gap between definability and recognizability
- DOI 10.1016/0304-3975(91)90387-H
- B. Courcelle. The monadic second-order logic of graphs V: on closing the gap between definability and recognizability, Theoret. Comp. Sci. 80 (1991) 153-202. 355 (Pubitemid 21648907)
- (1991) Theoretical Computer Science , vol.80 , Issue.2 , pp. 153-202
- Courcelle Bruno¹

6
- 0004024352
- World Scientific 356
- V. Diekert and G. Rozenberg. The book of traces, World Scientific (1995). 356
- (1995) The Book of Traces
- Diekert, V.¹ Rozenberg, G.²

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

8
- 0347767641
- Budapest 355, 359
- F. Gécseg and M. Steinby. Tree automata, Akadémiai Kiadó, Budapest (1984). 355, 359
- (1984) Tree Automata, Akadémiai Kiadó
- Gécseg, F.¹ Steinby, M.²

9
- 0024104624
- The equational theory of pomsets
- 358
- J.L. Gischer. The equational theory of pomsets, TCS 61 (1988) 199-224. 358
- (1988) TCS , vol.61 , pp. 199-224
- Gischer, J.L.¹

10
- 0001303720
- On partial languages
- 356, 357
- J. Grabowski. On partial languages, Fund. Inform. IV (1981) 427-498. 356, 357
- (1981) Fund. Inform. IV , pp. 427-498
- Grabowski, J.¹

11
- 78649838873
- Series-parallel posets: Algebra, automata and languages
- STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science
- K. Lodaya and P. Weil. Series-parallel posets: algebra, automata and languages, in Proc. STACS (Paris '98), LNCS 1373 (M. Morvan, C. Meinel, D. Krob, eds.) (1998) 555-565. 356, 357, 361, 366 (Pubitemid 128044818)
- (1998) Lecture Notes in Computer Science , Issue.1373 , pp. 555-565
- Lodaya, K.¹ Weil, P.²

12
- 84887065013
- IMSc Tech Rep 98/07/36 362
- K. Lodaya and P. Weil. Series-parallel languages and the bounded width property, IMSc Tech Rep 98/07/36 (1998). http://www.imsc.ernet.in/-kamal/splbwp. ps.gz. 362
- (1998) Series-parallel Languages and the Bounded Width Property
- Lodaya, K.¹ Weil, P.²

13
- 0001839355
- Fundamentals of a theory of asynchronous information flow
- North-Holland 355
- C.A. Petri. Fundamentals of a theory of asynchronous information flow, Proc. IFIP (Amsterdam '62), North-Holland (1963) 386-390. 355
- (1963) Proc. IFIP (Amsterdam '62) , pp. 386-390
- Petri, C.A.¹

14
- 34250124963
- Modelling concurrency with partial orders
- 357
- V. Pratt. Modelling concurrency with partial orders, IJPP 15(1) (1986) 33-71. 357
- (1986) IJPP , vol.15 , Issue.1 , pp. 33-71
- Pratt, V.¹

15
- 0004006996
- Springer 355
- W. Reisig. Petri nets, an introduction, Springer (1985). 355
- (1985) Petri Nets, An Introduction
- Reisig, W.¹

16
- 0002614970
- Generalized finite automata with an application to a decision problem of second order logic
- 355, 356, 359
- J.W. Thatcher and J.B. Wright. Generalized finite automata with an application to a decision problem of second order logic, Math. Syst. Theory 2 (1968) 57-82. 355, 356, 359
- (1968) Math. Syst. Theory , vol.2 , pp. 57-82
- Thatcher, J.W.¹ Wright, J.B.²

17
- 0001404569
- The recognition of series-parallel digraphs
- 357
- J. Valdes, R.E. Tarjan and E.L. Lawler. The recognition of series-parallel digraphs, SIAM J. Comput. 11 (1981) 298-313. 357
- (1981) SIAM J. Comput , vol.11 , pp. 298-313
- Valdes, J.¹ Tarjan, R.E.² Lawler, E.L.³

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