Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Paavo Turakainen

dblp:29/3213 · DBLP profile ↗
← Back
16ranked-venue papers
14as first author
0since 2021 · last 1999
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 13 · 11 first-authorDatabases, data management, data science and information retrieval · 3 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
8 papers
Automata and formal languages · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages
regular languages		 0.011988
The Equivalence of DGSM Replications on Q-Rational Languages is Decidable · ICALP 1988
Automata and formal languages › probabilistic automata
stochastic languages		 0.051978
A Note on Noncontext-Free Rational Stochastic Languages · Inf. Control. 1978
On Homomorphic Images of Rational Stochastic Languages · Inf. Control. 1976
Some Closure Properties of the Family of Stochastic Languages · Inf. Control. 1971
Automata and formal languages
probabilistic automata		 0.021975
Some Remarks on Multistochastic Automata · Inf. Control. 1975
On Multistochastic Automata · Inf. Control. 1973
Automata and formal languages › formal language operations
closure properties		 0.011971
Some Closure Properties of the Family of Stochastic Languages · Inf. Control. 1971
YearPublicationVenuePosition
1999 On the Decidability of Some Problems Concerning Morphisms, Regular Sets, and Post Correspondence Problem
abstract
Regular languages are divided into equivalence classes according to the lengths of the words and both the universal and the existential equivalence of rational transductions on the set of these classes is studied. It is shown that the cardinality equ
Paavo Turakainen
 Fundam. Informaticae1
1997 The Undecidability of Some Equivalence Problems Concerning NGSM's and Finite Substitutions
Paavo Turakainen
 Theor. Comput. Sci.1
1990 On Characterizations of Recursively Enumerable Languages
Michel Latteux, Paavo Turakainen
 Acta Informatica2
1988 The Equivalence of DGSM Replications on Q-Rational Languages is Decidable
Paavo Turakainen
 ICALP1
1987 A New Normal Form for the Compositions of Morphisms and Inverse Morphisms
Michel Latteux, Paavo Turakainen
 Math. Syst. Theory2
1987 The Equivalence of Deterministic GSM Replications on Q-Rational Languages is Decidable
Paavo Turakainen
 Math. Syst. Theory1
1982 A homomorphic characterization of principal semiAFLs without using intersection with regular sets
Paavo Turakainen
 Inf. Sci.1
1981 On nonstochastic languages and homomorphic images of stochastic languages
Paavo Turakainen
 Inf. Sci.1
1981 On some bounded semiAFLs and AFLs
Paavo Turakainen
 Inf. Sci.1
1978 A Note on Noncontext-Free Rational Stochastic Languages
Paavo Turakainen
 Inf. Control.1
1976 On Homomorphic Images of Rational Stochastic Languages
Paavo Turakainen
 Inf. Control.1
1975 Some Remarks on Multistochastic Automata
Paavo Turakainen
 Inf. Control.1
1973 On Multistochastic Automata
Paavo Turakainen
 Inf. Control.1
1971 Some Closure Properties of the Family of Stochastic Languages
Paavo Turakainen
 Inf. Control.1
1970 On m-Adic Stochastic Languages
Paavo Turakainen
 Inf. Control.1
1968 On Stochastic Languages
Paavo Turakainen
 Inf. Control.1