# Paavo Turakainen

According to our database

Collaborative distances:

^{1}, Paavo Turakainen authored at least 25 papers between 1968 and 2001.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepages:

#### On csauthors.net:

## Bibliography

2001

Injectivity of the Quotient h\g of two Morphisms and Ambiguity of Linear Grammars.

Journal of Automata, Languages and Combinatorics, 2001

1999

On the Decidability of Some Problems Concerning Morphisms, Regular Sets, and Post Correspondence Problem.

Fundam. Inform., 1999

Injectivity of the Quotient h\g of Two Morphisms and Ambiguity of Linear Grammars.

Bulletin of the EATCS, 1999

1997

The Undecidability of Some Equivalence Problems Concerning NGSM's and Finite Substitutions.

Theor. Comput. Sci., 1997

1994

On Polynomial Matrix Equations X

^{T}= p(X) and X = p(X). Where all Parameters are Nonnegative.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1991

On Nonnegative matrices generating a finite multiplicative monoid.

Int. J. Comput. Math., 1991

A Unified Approach to Characterizations of Recursively Enumerable Languages.

Bulletin of the EATCS, 1991

1990

On the finitess of the multiplicable monoid generated by a nonnegative matrix.

Bulletin of the EATCS, 1990

On Characterizations of Recursively Enumerable Languages.

Acta Inf., 1990

1988

The Equivalence of DGSM Replications on Q-Rational Languages is Decidable.

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987

The Equivalence of Deterministic GSM Replications on Q-Rational Languages is Decidable.

Mathematical Systems Theory, 1987

A New Normal Form for the Compositions of Morphisms and Inverse Morphisms.

Mathematical Systems Theory, 1987

Characterizations of Simple Transducers and Principal SemiAFLs in Terms of Morphisms and Inverse Morphisms.

Elektronische Informationsverarbeitung und Kybernetik, 1987

1985

A note on test sets for IR-rational languages.

Bulletin of the EATCS, 1985

1982

A homomorphic characterization of principal semiAFLs without using intersection with regular sets.

Inf. Sci., 1982

1981

On some bounded semiAFLs and AFLs.

Inf. Sci., 1981

On nonstochastic languages and homomorphic images of stochastic languages.

Inf. Sci., 1981

Some Remarks on Intersections of Linear Context-free Languages.

Elektronische Informationsverarbeitung und Kybernetik, 1981

1978

A Note on Noncontext-Free Rational Stochastic Languages

Information and Control, November, 1978

1976

On Homomorphic Images of Rational Stochastic Languages

Information and Control, January, 1976

1975

Some Remarks on Multistochastic Automata

Information and Control, January, 1975

1973

On Multistochastic Automata

Information and Control, September, 1973

1971

Some Closure Properties of the Family of Stochastic Languages

Information and Control, April, 1971

1970

On m-Adic Stochastic Languages

Information and Control, November, 1970

1968

On Stochastic Languages

Information and Control, April, 1968