dblp.uni-trier.dewww.uni-trier.de

Paavo Turakainen

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2001
24 Paavo Turakainen: Injectivity of the Quotient h\g of two Morphisms and Ambiguity of Linear Grammars. Journal of Automata, Languages and Combinatorics 6(1): 91-96 (2001)
1999
23 Paavo Turakainen: Injectivity of the Quotient h\g of Two Morphisms and Ambiguity of Linear Grammars. Bulletin of the EATCS 68: 160-165 (1999)
22 Paavo Turakainen: On the Decidability of Some Problems Concerning Morphisms, Regular Sets, and Post Correspondence Problem. Fundam. Inform. 38(1-2): 209-221 (1999)
1997
21EEPaavo Turakainen: The Undecidability of Some Equivalence Problems Concerning NGSM's and Finite Substitutions. Theor. Comput. Sci. 174(1-2): 269-274 (1997)
1994
20 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
19 Paavo Turakainen: A Unified Approach to Characterizations of Recursively Enumerable Languages. Bulletin of the EATCS 45: 223-228 (1991)
1990
18 Michel Latteux, Paavo Turakainen: On Characterizations of Recursively Enumerable Languages. Acta Inf. 28(2): 178-186 (1990)
17 Paavo Turakainen: On the finitess of the multiplicable monoid generated by a nonnegative matrix. Bulletin of the EATCS 40: 270-272 (1990)
1988
16 Paavo Turakainen: The Equivalence of DGSM Replications on Q-Rational Languages is Decidable. ICALP 1988: 654-666
1987
15 Paavo Turakainen: Characterizations of Simple Transducers and Principal SemiAFLs in Terms of Morphisms and Inverse Morphisms. Elektronische Informationsverarbeitung und Kybernetik 23(8/9): 403-413 (1987)
14 Michel Latteux, Paavo Turakainen: A New Normal Form for the Compositions of Morphisms and Inverse Morphisms. Mathematical Systems Theory 20(4): 261-271 (1987)
13 Paavo Turakainen: The Equivalence of Deterministic GSM Replications on Q-Rational Languages is Decidable. Mathematical Systems Theory 20(4): 273-282 (1987)
1985
12 Paavo Turakainen: A note on test sets for IR-rational languages. Bulletin of the EATCS 25: 40-41 (1985)
1982
11EEPaavo Turakainen: A homomorphic characterization of principal semiAFLs without using intersection with regular sets. Inf. Sci. 27(2): 141-149 (1982)
1981
10 Paavo Turakainen: Some Remarks on Intersections of Linear Context-free Languages. Elektronische Informationsverarbeitung und Kybernetik 17(7): 345-348 (1981)
9EEPaavo Turakainen: On some bounded semiAFLs and AFLs. Inf. Sci. 23(1): 31-48 (1981)
8EEPaavo Turakainen: On nonstochastic languages and homomorphic images of stochastic languages. Inf. Sci. 24(3): 229-253 (1981)
1978
7 Paavo Turakainen: A Note on Noncontext-Free Rational Stochastic Languages Information and Control 39(2): 225-226 (1978)
1976
6 Paavo Turakainen: On Homomorphic Images of Rational Stochastic Languages Information and Control 30(1): 96-105 (1976)
1975
5 Paavo Turakainen: Some Remarks on Multistochastic Automata Information and Control 27(1): 75-86 (1975)
1973
4 Paavo Turakainen: On Multistochastic Automata Information and Control 23(2): 183-203 (1973)
1971
3 Paavo Turakainen: Some Closure Properties of the Family of Stochastic Languages Information and Control 18(3): 253-256 (1971)
1970
2 Paavo Turakainen: On m-Adic Stochastic Languages Information and Control 17(4): 410-415 (1970)
1968
1 Paavo Turakainen: On Stochastic Languages Information and Control 12(4): 304-313 (1968)

Coauthor Index

1Michel Latteux [14] [18]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)