Titlebook: Results and Trends in Theoretical Computer Science; Colloquium in Honor Juliani Karhumäki,Hermann Maurer,Grzegorz Rozenber Conference proc

Abominate

Decomposition of infinite labeled 2-structures,shown that if an infinite labeled 2-structure . has at least one maximal prime clan, then its maximal prime clans form a partition of the domain of ., and the quotient w.r.t. this partition is linear, complete or primitive. Also, we show that the infinite primitive labeled 2-structures are upward he

独白

Comparing descriptional and computational complexity of infinite words,ed by the complexity of the mechanism used to generate infinite words, typical examples being iterated morphisms, iterated dgsm‘s and double D0L TAG systems. In the latter on the complexity is measured by resourses used by Turing machines to generate infinite words.

pulmonary-edema

Power of controlled insertion and deletion,the classes studied is closed under an insertion operation, a deletion operation and an iterative insertion one. The operations are controlled and have been chosen as stated in order to allow an increase as well as a decrease of the length of the words in the operands. The iterative operation has be

indicate

,Generalizing Cook’s transformation to imperative stack programs,t are ., in contrast to Cook‘s method, and builds programs that run in linear time if the original was a 2DPDA in program form. The transformation applies to algorithms not previously dealt with by Cook‘s method, . fast computation of functions such as Fibonacci and (sk./.).

accrete

0302-9743 presented at the festive colloquium, organized by Hermann Maurer at Graz, Austria, in June 1994; the contributing authors are well-known scientists with special relations to Professor Salomaa as friends, Ph.D. students, or co-authors. The volume reflects the broad spectrum of Professor Salomaa‘s res

背心

Decomposition of infinite labeled 2-structures, and the quotient w.r.t. this partition is linear, complete or primitive. Also, we show that the infinite primitive labeled 2-structures are upward hereditary, i.e., if . is a primitive substructure of a primitive ., then . can be extended to a primitive substructure . of . by adding one or two nodes to ..

短程旅游

智力高

ensemble

Parallel pattern generation with one-way communications,resting connection between patterns generated by CA, fixed points of CA and tilings of Euclidean spaces. We show that it is undecidable whether a CA converges to a pattern from a given finite configuration or from any configuration.

ALIAS

Conference proceedings 1994rests in theoretical computer science and mathematics with contributions particularly to automata theory, formal language theory, mathematical logic, computability, and cryptography. The appendix presents Professor Salomaa‘s curriculum vitae and lists the more than 300 papers and 9 books he published.