Shuffle on trajectories: Syntactic constraints

Theoretical Computer Science

Volumn 197, Issue 1-2, 1998, Pages 1-56

  Mateescu, Alexandru ^a   Rozenberg, Grzegorz ^b   Salomaa, Arto ^c  

^a UNIVERSITY OF BUCHAREST   (Romania)

^b LEIDEN UNIVERSITY   (Netherlands)

^c TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

Concurrency; Formal languages; Parallel computation; Shuffle

Indexed keywords

EID: 0012825720     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00163-1     Document Type: Article

References (47)

1. IJ.J. Aalbersberg, G. Rozenberg, Theory of traces, Theoret. Comput. Sci. 60 (1988) 1-82.
2. T. Axford, Concurrent Programming Fundamental Techniques for Real Time and Parallel Software Design, Wiley, New York, 1989.
3. J.C.M. Baeten, W.P. Weijland, Process Algebra, Cambridge University Press, Cambridge, 1990.
4. J.A. Bergstra, J.W. Klop, Process algebra for synchronous communication, Inform. Control 60 (1984) 109-137.
5. P.M. Cohn, Universal Algebra, D. Reidel, New York, 1980.
6. J. Dassow, G. Pǎun, Regulated Rewriting in Formal Language Theory, Springer, Berlin, 1989.
7. V. Diekert, G. Rozenberg (Ed.), The Book of Traces, World Scientific, Singapore, 1995.
8. G. Duchamp, D. Krob, combinatories in trace monoids II, in: V. Diekert, G. Rozenberg (Eds.), The Book of Traces, World Scientific, Singapore, 1995, pp. 83-130.
9. S. Eilenberg, Automata, Languages, and Machines, vol. A. Academic Press, New York, 1974.
10. S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw Hill, New York, 1966.
11. S. Ginsburg, E.H. Spanier, Bounded regular sets, Proc. Amer. Math. Soc. 17 (1966) 1043-1049.
12. S. Ginsburg, E.H. Spanier, AFL with semilinear property, J. Comput. System Sci. 5 (1971) 365-396.
13. J.S. Golan, The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science, Longman Scientific and Technical, Harlow, Essex, 1992.
14. J.S. Golan, A. Mateescu, D. Vaida, Semirings and parallel composition of processes. J Automata Languages Combin. 1 (1996) 199-217.
15. L. Guo, K. Salomaa, S. Yu, Synchronization Expressions and Languages, Tech. Report 368, Dept. of Comp. Sci., The University of Western Ontario, London, 1993.
16. L. H. Haines, On free monoids partially ordered by embedding, J. Combin. Theory 6 (1969) 94-98.
17. T. Harju, M. Lipponen, A. Mateescu, Flatwords and Post correspondence problem, Theoret. Comput. Sci. 161 (1996) 93-108.
18. M. Hennessy, Algebraic Theory of Processes, The MIT Press, Cambridge, MA, London, 1988.
19. G.H. Higman, Ordering by divisibility in abstract algebras, Proc. London Math. Soc. 3 (1952) 326-336.
20. Iu.I. Ianov, A.A. Muchnic, On the existence of k-valued closed classes not having a finite base, Dokl. Akad. Nauk SSSR 127 (1959) 44-46.
21. O. Ibarra, Simple matrix grammars, Inform. Control 17 (1970) 359-394.
22. L. Kari, On insertion and delet on in formal languages, Ph.D. Thesis, University of Turku, Turku, Finland, 1991.
23. T. Kasai, An hierarchy between context-free and context-sensitive languages, J. Comput. System Sci. 4 (1970) 492-508.
24. M. Kudlek, A. Mateescu, Distributed catenation and Chomsky hierarchy, FCT'95, Dresden, 1995, Lecture Notes in Computer Science, vol. 965, Springer, Berlin, 1995, pp. 313-322.
25. M. Kudlek, A. Mateescu, Rational and algebraic languages with distributed catenation, DLT'95, Magdeburg, 1995, in: J. Dassow, G. Rozenberg, A. Salomaa (Eds.), Developments in Language Theory II, World Scientific, Singapore, 1996, pp. 129-138.
26. W. Kuich, The Kleene and the Parikh theorem in complete semirings, in: T. Ottman (Eds.), Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 267, Springer, Berlin 1987, pp. 212-225.
27. W. Kuich, A. Salomaa, Semirings, Automata, Languages, EATCS Monographs on Theoretical Computer Science, Springer, Berlin, 1986.
28. M. Lothaire, in: G.-C. Rota (Ed.), Combinatories on Words, Encyclopedia of Math, and Appl., vol. 17, Addison-Wesley, Reading, MA, 1983.
29. A. Mateescu, On (Left) partial shuffle, in: Results and Trends in Theoretical Computer Science, Lecture Notes in Computer Science, vol. 812, Springer, Berlin, 1994, pp. 264-278.
30. A. Mateescu, A. Salomaa, Formal languages: an introduction and a synopsis, Chapter 1, in: G. Rozenberg, A. Salomaa, (Eds.), Handbook of Formal Languages, Springer, Berlin, 1997, pp. 1-40.
31. H.A. Maurer, G. Rozenberg, E. Welzl, Using string languages to describe picture languages, Inform. Control 3 (1982) 155-185.
32. A. Mazurkiewicz, Concurreni program schemes and their interpretations, DAIMI Rep. PB 78, Aarhus, 1977.
33. A. Mazurkiewicz, Introduction to trace theory, in: V. Diekert, G. Rozenberg (Eds.), The Book of Traces, World Scientific, Singapore, 1995, pp. 3-42.
34. R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol. 92, Springer, Berlin, 1980.
35. R. Milner, Communication and Concurrency, Prentice Hall, Englewood Cliffs, NJ, 1989.
36. E.L. Post, The Two-valued Iterative Systems of Mathematical Logic, Princeton University Press, NJ, 1941.
37. D. Park, Concurrency and automata on infinite sequences, in: P. Deussen (Ed.), Theoretical Computer Science, Lecture Notes in Computer Science, vol. 104, Springer, Berlin, 1981, pp. 167-183.
38. D. Perrin, J.E. Pin, Mots Infinis, Report LITP 93.40, 1993.
39. D. Raz, On slender context-tree languages, in: E.W. Mayr, C. Puech (Eds.), STACS'95 Lecture Notes in Computer Science, vol. 900, Springer, Berlin, 1995, pp. 445-454.
40. R. Ree, Lie elements and an algebra associated with shuffles, Ann. Math. 68 (1958) 210-220.
41. C. Reutenauer, Free Lie Algebras, Clarendon Press, Oxford, 1993.
42. J. Sakarovitch, I. Simon, Subwords, in: M. Lothaire (Ed.), Combinatories on Words, Addison-Wesley, Reading, MA, 1983.
43. A. Salomaa, On many-valued systems of logic, Ajatus Philos. Soc. Finland 22 (1959) 115-159.
44. A. Salomaa, On infinitely generated sets of operations in finite algebras, Ann. Universitatis Turkuensis, Ser. A I 74 (1964) 13.
45. A. Salomaa, Formal Languages, Academic Press, New York, 1973.
46. R. Siromoney, On equal matrix languages, Inform. Control, 14 (1969) 135-151.
47. W. Thomas, Automata on infinite objects, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B, Elsevier, Amsterdam, 1990, pp. 135-191.