Distributed catenation and chomsky hierarchy
We introduce a new operation between words and languages, called distributed catenation. The distributed catenation is a natural extension of the well known catenation operation from the theory of formal languages. As for partial shuffle operation the introduction of this operation is strongly motivated by the theory of concurrency. At the same time the distributed catenation is a powerful operation. For instance, any Turing machine can be simulated by a pushdown automaton that uses distributed catenation for the pushdown memory.
KeywordsBinary Operation Turing Machine Formal Language Finite Automaton Canonical Decomposition
Unable to display preview. Download preview PDF.
- 1.J.S. Golan: The Theory of Semirings with Application in Mathematics and Theoretical Computer Science, Longman Scientific and Technical, 1992.Google Scholar
- 2.H. Jürgensen: Syntactic Monoids of Codes, Report 327, Dept.Comp.Sci., The University of Western Ontario, 1992.Google Scholar
- 3.W. Kuich, A. Salomaa: Semirings, Automata, Languages, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1986.Google Scholar
- 4.A. Mateescu: On (Left) Partial Shuffle, Proceedings of ‘Results and Trends in Theoretical Computer Science', LNCS 812, Springer-Verlag, (1994) 264–278.Google Scholar
- 5.C. Reutenauer: Free Lie Algebras, Clarendon Press, Oxford, 1993.Google Scholar
- 6.J. Sakarovitch, I. Simon: Subwords, in Combinatorics on Words, M. Lothaire (ed.), Addison-Wesley, Read. Mass., 1983.Google Scholar
- 7.A. Salomaa: Formal Languages, Academic Press, New York, 1973.Google Scholar