Paavo Turakainen
Affiliations:- University of Oulu, Finland
According to our database1,
Paavo Turakainen
authored at least 24 papers
between 1968 and 2001.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2001
J. Autom. Lang. Comb., 2001
1999
On the Decidability of Some Problems Concerning Morphisms, Regular Sets, and Post Correspondence Problem.
Fundam. Informaticae, 1999
1997
The Undecidability of Some Equivalence Problems Concerning NGSM's and Finite Substitutions.
Theor. Comput. Sci., 1997
1994
On Polynomial Matrix Equations X <sup>T</sup> = p(X) and X = p(X). Where all Parameters are Nonnegative.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994
1991
Int. J. Comput. Math., 1991
A Unified Approach to Characterizations of Recursively Enumerable Languages.
Bull. EATCS, 1991
1990
On the finitess of the multiplicable monoid generated by a nonnegative matrix.
Bull. EATCS, 1990
1988
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988
1987
The Equivalence of Deterministic GSM Replications on Q-Rational Languages is Decidable.
Math. Syst. Theory, 1987
Math. Syst. Theory, 1987
Characterizations of Simple Transducers and Principal SemiAFLs in Terms of Morphisms and Inverse Morphisms.
J. Inf. Process. Cybern., 1987
1985
A note on test sets for IR-rational languages.
Bull. EATCS, 1985
1982
A homomorphic characterization of principal semiAFLs without using intersection with regular sets.
Inf. Sci., 1982
1981
Inf. Sci., 1981
Some Remarks on Intersections of Linear Context-free Languages.
J. Inf. Process. Cybern., 1981
1978
Inf. Control., November, 1978
1976
1975
1973
1971
Inf. Control., April, 1971
1970
1968