default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaavo Turakainen
Person information
- affiliation: University of Oulu, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[j23]Paavo Turakainen:
Injectivity of the Quotient h\g of two Morphisms and Ambiguity of Linear Grammars. J. Autom. Lang. Comb. 6(1): 91-96 (2001)
1990 – 1999
- 1999
- [j22]Paavo Turakainen:
Injectivity of the Quotient h\g of Two Morphisms and Ambiguity of Linear Grammars. Bull. EATCS 68: 160-165 (1999) - [j21]Paavo Turakainen:
On the Decidability of Some Problems Concerning Morphisms, Regular Sets, and Post Correspondence Problem. Fundam. Informaticae 38(1-2): 209-221 (1999) - 1997
- [j20]Paavo Turakainen:
The Undecidability of Some Equivalence Problems Concerning NGSM's and Finite Substitutions. Theor. Comput. Sci. 174(1-2): 269-274 (1997) - 1994
- [c2]Paavo Turakainen:
On Polynomial Matrix Equations X T = p(X) and X = p(X). Where all Parameters are Nonnegative. Results and Trends in Theoretical Computer Science 1994: 410-421 - 1991
- [j19]Paavo Turakainen:
A Unified Approach to Characterizations of Recursively Enumerable Languages. Bull. EATCS 45: 223-228 (1991) - [j18]Paavo Turakainen:
On Nonnegative matrices generating a finite multiplicative monoid. Int. J. Comput. Math. 39(3-4): 151-161 (1991) - 1990
- [j17]Michel Latteux, Paavo Turakainen:
On Characterizations of Recursively Enumerable Languages. Acta Informatica 28(2): 178-186 (1990) - [j16]Paavo Turakainen:
On the finitess of the multiplicable monoid generated by a nonnegative matrix. Bull. EATCS 40: 270-272 (1990)
1980 – 1989
- 1988
- [c1]Paavo Turakainen:
The Equivalence of DGSM Replications on Q-Rational Languages is Decidable. ICALP 1988: 654-666 - 1987
- [j15]Paavo Turakainen:
Characterizations of Simple Transducers and Principal SemiAFLs in Terms of Morphisms and Inverse Morphisms. J. Inf. Process. Cybern. 23(8/9): 403-413 (1987) - [j14]Michel Latteux, Paavo Turakainen:
A New Normal Form for the Compositions of Morphisms and Inverse Morphisms. Math. Syst. Theory 20(4): 261-271 (1987) - [j13]Paavo Turakainen:
The Equivalence of Deterministic GSM Replications on Q-Rational Languages is Decidable. Math. Syst. Theory 20(4): 273-282 (1987) - 1985
- [j12]Paavo Turakainen:
A note on test sets for IR-rational languages. Bull. EATCS 25: 40-41 (1985) - 1982
- [j11]Paavo Turakainen:
A homomorphic characterization of principal semiAFLs without using intersection with regular sets. Inf. Sci. 27(2): 141-149 (1982) - 1981
- [j10]Paavo Turakainen:
Some Remarks on Intersections of Linear Context-free Languages. J. Inf. Process. Cybern. 17(7): 345-348 (1981) - [j9]Paavo Turakainen:
On some bounded semiAFLs and AFLs. Inf. Sci. 23(1): 31-48 (1981) - [j8]Paavo Turakainen:
On nonstochastic languages and homomorphic images of stochastic languages. Inf. Sci. 24(3): 229-253 (1981)
1970 – 1979
- 1978
- [j7]Paavo Turakainen:
A Note on Noncontext-Free Rational Stochastic Languages. Inf. Control. 39(2): 225-226 (1978) - 1976
- [j6]Paavo Turakainen:
On Homomorphic Images of Rational Stochastic Languages. Inf. Control. 30(1): 96-105 (1976) - 1975
- [j5]Paavo Turakainen:
Some Remarks on Multistochastic Automata. Inf. Control. 27(1): 75-86 (1975) - 1973
- [j4]Paavo Turakainen:
On Multistochastic Automata. Inf. Control. 23(2): 183-203 (1973) - 1971
- [j3]Paavo Turakainen:
Some Closure Properties of the Family of Stochastic Languages. Inf. Control. 18(3): 253-256 (1971) - 1970
- [j2]Paavo Turakainen:
On m-Adic Stochastic Languages. Inf. Control. 17(4): 410-415 (1970)
1960 – 1969
- 1968
- [j1]Paavo Turakainen:
On Stochastic Languages. Inf. Control. 12(4): 304-313 (1968)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
