| 2008 |
|---|
| 151 | | Viliam Geffert,
Juhani Karhumäki,
Alberto Bertoni,
Bart Preneel,
Pavol Návrat,
Mária Bieliková:
SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Volume II - Student Research Forum
Safarik University, Kosice, Slovakia 2008 |
| 150 | | Giorgio Ausiello,
Juhani Karhumäki,
Giancarlo Mauri,
C.-H. Luke Ong:
Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy
Springer 2008 |
| 149 | | Viliam Geffert,
Juhani Karhumäki,
Alberto Bertoni,
Bart Preneel,
Pavol Návrat,
Mária Bieliková:
SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings
Springer 2008 |
| 148 | EE | Juhani Karhumäki,
Aleksi Saarela:
An Analysis and a Reproof of Hmelevskii's Theorem.
Developments in Language Theory 2008: 467-478 |
| 147 | EE | Oscar H. Ibarra,
Juhani Karhumäki,
Alexander Okhotin:
On Stateless Multihead Automata: Hierarchies and the Emptiness Problem.
LATIN 2008: 94-105 |
| 146 | EE | Juhani Karhumäki:
Reachability via Cooperating Morphisms.
Electr. Notes Theor. Comput. Sci. 223: 15-27 (2008) |
| 145 | EE | Paul Bell,
Vesa Halava,
Tero Harju,
Juhani Karhumäki,
Igor Potapov:
Matrix Equations and Hilbert's Tenth Problem.
IJAC 18(8): 1231-1241 (2008) |
| 144 | EE | Vesa Halava,
Tero Harju,
Mika Hirvensalo,
Juhani Karhumäki:
Post Correspondence Problem for short words.
Inf. Process. Lett. 108(3): 115-118 (2008) |
| 143 | EE | Tero Harju,
Juhani Karhumäki:
Preface.
Int. J. Found. Comput. Sci. 19(3): 495-496 (2008) |
| 2007 |
|---|
| 142 | | Tero Harju,
Juhani Karhumäki,
Arto Lepistö:
Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings
Springer 2007 |
| 141 | EE | Juhani Karhumäki,
Yury Lifshits,
Wojciech Rytter:
Tiling Periodicity.
CPM 2007: 295-306 |
| 140 | EE | Elena Czeizler,
Juhani Karhumäki:
On Non-Periodic Solutions of Independent Systems of Word Equations over Three Unknowns.
Int. J. Found. Comput. Sci. 18(4): 873-897 (2007) |
| 139 | EE | Elena Czeizler,
Stepan Holub,
Juhani Karhumäki,
Markku Laine:
Intricacies of Simple Word Equations: an Example.
Int. J. Found. Comput. Sci. 18(6): 1167-1175 (2007) |
| 138 | EE | Vesa Halava,
Tero Harju,
Juhani Karhumäki,
Michel Latteux:
Extension of the decidability of the marked PCP to instances with unique blocks.
Theor. Comput. Sci. 380(3): 355-362 (2007) |
| 137 | EE | Vesa Halava,
Tero Harju,
Juhani Karhumäki:
The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems.
Theory Comput. Syst. 40(1): 43-54 (2007) |
| 2006 |
|---|
| 136 | | Anssi Yli-Jyrä,
Lauri Karttunen,
Juhani Karhumäki:
Finite-State Methods and Natural Language Processing, 5th International Workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005. Revised Papers
Springer 2006 |
| 135 | EE | Juhani Karhumäki,
Michal Kunc,
Alexander Okhotin:
Communication of Two Stacks and Rewriting.
ICALP (2) 2006: 468-479 |
| 134 | EE | Vesa Halava,
Tero Harju,
Juhani Karhumäki:
Undecidability in omega-Regular Languages.
Fundam. Inform. 73(1-2): 119-125 (2006) |
| 133 | EE | Alberto Bertoni,
Zoltán Ésik,
Juhani Karhumäki:
Preface.
Theor. Comput. Sci. 356(1-2): 1-5 (2006) |
| 132 | EE | Juhani Karhumäki,
Michal Kunc,
Alexander Okhotin:
Computing by commuting.
Theor. Comput. Sci. 356(1-2): 200-211 (2006) |
| 2005 |
|---|
| 131 | EE | Juhani Karhumäki,
Grzegorz Rozenberg:
Preface: Insightful Theory.
Theor. Comput. Sci. 330(1): 1 (2005) |
| 130 | EE | Juhani Karhumäki,
Wojciech Plandowski,
Wojciech Rytter:
On the complexity of decidable cases of the commutation problem of languages.
Theor. Comput. Sci. 337(1-3): 105-118 (2005) |
| 129 | EE | Tero Harju,
Juhani Karhumäki,
Antonio Restivo:
Preface.
Theor. Comput. Sci. 339(1): 1-2 (2005) |
| 128 | EE | Juhani Karhumäki,
Michel Latteux,
Ion Petre:
Commutation with codes.
Theor. Comput. Sci. 340(1): 322-333 (2005) |
| 127 | EE | Josep Díaz,
Juhani Karhumäki:
Preface.
Theor. Comput. Sci. 348(2-3): 129 (2005) |
| 126 | EE | Juhani Karhumäki,
Michel Latteux,
Ion Petre:
Commutation with Ternary Sets of Words.
Theory Comput. Syst. 38(2): 161-169 (2005) |
| 2004 |
|---|
| 125 | | Juhani Karhumäki,
Hermann A. Maurer,
Gheorghe Paun,
Grzegorz Rozenberg:
Theory Is Forever, Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday
Springer 2004 |
| 124 | | Josep Díaz,
Juhani Karhumäki,
Arto Lepistö,
Donald Sannella:
Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings
Springer 2004 |
| 123 | EE | Karel Culik II,
Juhani Karhumäki,
Petri Salmela:
Fixed Point Approach to Commutation of Languages.
Aspects of Molecular Computing 2004: 119-131 |
| 122 | EE | Juhani Karhumäki:
Finite Sets of Words and Computing.
MCU 2004: 36-49 |
| 121 | EE | Juhani Karhumäki,
Jeffrey Shallit:
Polynomial versus exponential growth in repetition-free binary words.
J. Comb. Theory, Ser. A 105(2): 335-347 (2004) |
| 120 | EE | Tero Harju,
Juhani Karhumäki:
Many aspects of defect theorems.
Theor. Comput. Sci. 324(1): 35-54 (2004) |
| 2003 |
|---|
| 119 | EE | Juhani Karhumäki:
Automata on Words.
CIAA 2003: 3-10 |
| 118 | EE | Juhani Karhumäki,
Michel Latteux,
Ion Petre:
The Commutation with Codes and Ternary Sets of Words.
STACS 2003: 74-84 |
| 117 | | Jean Berstel,
Juhani Karhumäki:
Combinatorics on words: a tutorial.
Bulletin of the EATCS 79: 178- (2003) |
| 116 | EE | Juhani Karhumäki,
Jeffrey Shallit:
Polynomial versus Exponential Growth in Repetition-Free Binary Words
CoRR math.CO/0304095: (2003) |
| 115 | | Juhani Karhumäki,
Wojciech Plandowski,
Wojciech Rytter:
The complexity of compressing subsegments of images described by finite automata.
Discrete Applied Mathematics 125(2-3): 235-254 (2003) |
| 114 | EE | Vesa Halava,
Tero Harju,
Juhani Karhumäki:
Decidability of the binary infinite Post Correspondence Problem.
Discrete Applied Mathematics 130(3): 521-526 (2003) |
| 113 | EE | Juhani Karhumäki,
Leonid P. Lisovik:
A simple undecidable problem: the inclusion problem for finite substitutions on ab*c.
Inf. Comput. 187(1): 40-48 (2003) |
| 112 | EE | Juhani Karhumäki,
Leonid P. Lisovik:
The Equivalence Problem of Finite Substitutions on ab*c, with Applications.
Int. J. Found. Comput. Sci. 14(4): 699- (2003) |
| 111 | | Juhani Karhumäki,
Ján Manuch,
Wojciech Plandowski:
A defect theorem for bi-infinite words.
Theor. Comput. Sci. 292(1): 237-243 (2003) |
| 2002 |
|---|
| 110 | | Wilfried Brauer,
Hartmut Ehrig,
Juhani Karhumäki,
Arto Salomaa:
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Springer 2002 |
| 109 | EE | Juhani Karhumäki,
Ion Petre:
The Branching Point Approach to Conway's Problem.
Formal and Natural Computing 2002: 69-76 |
| 108 | EE | Juhani Karhumäki,
Leonid P. Lisovik:
The Equivalence Problem of Finite Substitutions on ab*c, with Applications.
ICALP 2002: 812-820 |
| 107 | EE | Mika Hirvensalo,
Juhani Karhumäki:
Computing Partial Information out of Intractable One - The First Digit of 2 n at Base 3 as an Example.
MFCS 2002: 319-327 |
| 106 | EE | Juhani Karhumäki:
Applications of Finite Automata.
MFCS 2002: 40-58 |
| 105 | EE | Juraj Hromkovic,
Sebastian Seibert,
Juhani Karhumäki,
Hartmut Klauck,
Georg Schnitger:
Communication Complexity Method for Measuring Nondeterminism in Finite Automata.
Inf. Comput. 172(2): 202-217 (2002) |
| 104 | EE | Karel Culik II,
Juhani Karhumäki,
Jarkko Kari:
A Note on Synchronized Automata and Road Coloring Problem.
Int. J. Found. Comput. Sci. 13(3): 459-471 (2002) |
| 103 | EE | Juhani Karhumäki,
Arto Lepistö,
Wojciech Plandowski:
Locally Periodic Versus Globally Periodic Infinite Words.
J. Comb. Theory, Ser. A 100(2): 250-264 (2002) |
| 102 | EE | Tero Harju,
Oscar H. Ibarra,
Juhani Karhumäki,
Arto Salomaa:
Some Decision Problems Concerning Semilinearity and Commutation.
J. Comput. Syst. Sci. 65(2): 278-294 (2002) |
| 101 | EE | Christian Choffrut,
Juhani Karhumäki,
Nicolas Ollinger:
The commutation of finite sets: a challenging problem.
Theor. Comput. Sci. 273(1-2): 69-79 (2002) |
| 100 | EE | Juhani Karhumäki,
Ján Manuch:
Multiple factorizations of words and defect effect.
Theor. Comput. Sci. 273(1-2): 81-97 (2002) |
| 99 | | Juhani Karhumäki,
Ion Petre:
Conway's problem for three-word sets.
Theor. Comput. Sci. 289(1): 705-725 (2002) |
| 2001 |
|---|
| 98 | EE | Karel Culik II,
Juhani Karhumäki,
Jarkko Kari:
A Note on Synchronized Automata and Road Coloring Problem.
Developments in Language Theory 2001: 175-185 |
| 97 | EE | Juhani Karhumäki:
Challenges of Commutation.
FCT 2001: 15-23 |
| 96 | EE | Juhani Karhumäki,
Wojciech Plandowski,
Wojciech Rytter:
On the Complexity of Decidable Cases of Commutation Problem for Languages.
FCT 2001: 193-203 |
| 95 | EE | Tero Harju,
Oscar H. Ibarra,
Juhani Karhumäki,
Arto Salomaa:
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages.
ICALP 2001: 579-590 |
| 94 | EE | Juhani Karhumäki:
Combinatorial and Computational Problems on Finite Sets of Words.
MCU 2001: 69-81 |
| 93 | EE | Juhani Karhumäki,
Leonid P. Lisovik:
A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c.
STACS 2001: 388-395 |
| 92 | | Juhani Karhumäki,
Ion Petre:
Conway's Problem and the Communication of Languages.
Bulletin of the EATCS 74: 171-189 (2001) |
| 91 | EE | Julien Cassaigne,
Juhani Karhumäki,
Ján Manuch:
On Conjugacy of Languages.
ITA 35(6): 535-550 (2001) |
| 2000 |
|---|
| 90 | EE | Juraj Hromkovic,
Juhani Karhumäki,
Hartmut Klauck,
Georg Schnitger,
Sebastian Seibert:
Measures of Nondeterminism in Finite Automata.
ICALP 2000: 199-210 |
| 89 | EE | Juhani Karhumäki,
Ion Petre:
On the Centralizer of a Finite Set.
ICALP 2000: 536-546 |
| 88 | EE | Juraj Hromkovic,
Juhani Karhumäki,
Hartmut Klauck,
Georg Schnitger,
Sebastian Seibert:
Measures of Nondeterminism in Finite Automata
Electronic Colloquium on Computational Complexity (ECCC) 7(76): (2000) |
| 87 | EE | Juhani Karhumäki,
Filippo Mignosi,
Wojciech Plandowski:
The expressibility of languages and relations by word equations.
J. ACM 47(3): 483-505 (2000) |
| 86 | | Juhani Karhumäki,
Wojciech Plandowski,
Wojciech Rytter:
Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata.
Nord. J. Comput. 7(1): 1-13 (2000) |
| 1999 |
|---|
| 85 | | Juhani Karhumäki,
Hermann A. Maurer,
Gheorghe Paun,
Grzegorz Rozenberg:
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Springer 1999 |
| 84 | EE | Juhani Karhumäki,
Wojciech Plandowski,
Wojciech Rytter:
The Compression of Subsegments of Images Described by Finite Automata.
CPM 1999: 186-195 |
| 83 | | Juhani Karhumäki,
Sabrina Mantaci:
Defect theorems for trees.
Developments in Language Theory 1999: 164-177 |
| 82 | | Juhani Karhumäki,
Wojciech Plandowski:
On the complexity of computing the order of repetition of a string.
Developments in Language Theory 1999: 178-184 |
| 81 | | Juhani Karhumäki,
Leonid P. Lisovik:
On the Equivalence of Finite Substitutions and Transducers.
Jewels are Forever 1999: 97-108 |
| 80 | | Juhani Karhumäki,
Sabrina Mantaci:
Defect Theorems for Trees.
Fundam. Inform. 38(1-2): 119-133 (1999) |
| 79 | EE | Juhani Karhumäki,
Wojciech Plandowski,
Wojciech Rytter:
Generalized Factorizations of Words and Their Algorithmic Properties.
Theor. Comput. Sci. 218(1): 123-133 (1999) |
| 78 | EE | Juhani Karhumäki:
A Short Biography of Arto Salomaa.
Theor. Comput. Sci. 226(1-2): 3-5 (1999) |
| 1998 |
|---|
| 77 | EE | Juhani Karhumäki,
Arto Lepistö,
Wojciech Plandowski:
Locally Periodic Infinite Words and a Chaotic Behaviour.
ICALP 1998: 421-430 |
| 76 | EE | Juhani Karhumäki,
Ján Manuch,
Wojciech Plandowski:
On Defect Effect of Bi-Infinite Words.
MFCS 1998: 674-682 |
| 75 | EE | Julien Cassaigne,
Juhani Karhumäki:
Examples of Undecidable Problems for 2-Generator Matrix Semigroups.
Theor. Comput. Sci. 204(1-2): 29-34 (1998) |
| 1997 |
|---|
| 74 | | Juhani Karhumäki,
Wojciech Plandowski,
Filippo Mignosi:
A lower bound for a constant in Shallit's conjecture.
Developments in Language Theory 1997: 103-118 |
| 73 | | Juhani Karhumäki,
Wojciech Plandowski,
Wojciech Rytter:
Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata.
FCT 1997: 245-256 |
| 72 | | Juhani Karhumäki,
Wojciech Plandowski,
Filippo Mignosi:
The Expressibility of Languages and Relations by Word Equations.
ICALP 1997: 98-109 |
| 71 | | Juraj Hromkovic,
Juhani Karhumäki:
Two Lower Bounds on Computational Complexity of Infinite Words.
New Trends in Formal Languages 1997: 366-376 |
| 70 | | Tero Harju,
Juhani Karhumäki,
Mario Petrich:
Compactness of Systems of Equations on Completely Regular Semigroups.
Structures in Logic and Computer Science 1997: 268-280 |
| 69 | EE | Julien Cassaigne,
Juhani Karhumäki:
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms.
Eur. J. Comb. 18(5): 497-510 (1997) |
| 68 | EE | Christian Choffrut,
Tero Harju,
Juhani Karhumäki:
A Note on Decidability Questions on Presentations of Word Semigroups.
Theor. Comput. Sci. 183(1): 83-92 (1997) |
| 1996 |
|---|
| 67 | | Tero Harju,
Juhani Karhumäki,
Daniel Krob:
Remarks on Generalized Post Correspondence Problem.
STACS 1996: 39-48 |
| 66 | | Denis Derencourt,
Juhani Karhumäki,
Michel Latteux,
Alain Terlutte:
On Computational Power of Weighted Finite Automata.
Fundam. Inform. 25(3): 285-293 (1996) |
| 65 | EE | Juhani Karhumäki,
Wojciech Plandowski:
On the Size of Independent Systems of Equations in Semigroups.
Theor. Comput. Sci. 168(1): 105-119 (1996) |
| 1995 |
|---|
| 64 | | Julien Cassaigne,
Juhani Karhumäki:
Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract).
COCOON 1995: 244-253 |
| 63 | | Tero Harju,
Juhani Karhumäki,
Wojciech Plandowski:
Compactness of Systems of Equations in Semigroups.
ICALP 1995: 444-454 |
| 62 | | Juhani Karhumäki,
Wojciech Plandowski,
Wojciech Rytter:
Polynomial Size Test Sets for Context-Free Languages.
J. Comput. Syst. Sci. 50(1): 11-19 (1995) |
| 1994 |
|---|
| 61 | | Juhani Karhumäki,
Hermann A. Maurer,
Grzegorz Rozenberg:
Results and Trends in Theoretical Computer Science, Colloquium in Honor of Arto Salomaa, Graz, Austria, June 10-11, 1994, Proceedings
Springer 1994 |
| 60 | | Juraj Hromkovic,
Juhani Karhumäki:
Two Lower Bounds on Computational Complexity of Infinite Word Generation.
IFIP Congress (1) 1994: 479-484 |
| 59 | | Juhani Karhumäki,
Wojciech Plandowski:
On the Size of Independent Systems of Equations in Semigroups.
MFCS 1994: 443-452 |
| 58 | | Juraj Hromkovic,
Juhani Karhumäki,
Arto Lepistö:
Comparing Descriptional and Computational Complexity of Infinite Words.
Results and Trends in Theoretical Computer Science 1994: 169-182 |
| 57 | | Denis Derencourt,
Juhani Karhumäki,
Michel Latteux,
Alain Terlutte:
On Continuous Functions Computed by Finite Automata.
ITA 28(3-4): 387-403 (1994) |
| 56 | | Karel Culik II,
Juhani Karhumäki:
Iterative Devices Generating Infinite Words.
Int. J. Found. Comput. Sci. 5(1): 69-97 (1994) |
| 55 | | Karel Culik II,
Juhani Karhumäki:
Finite Automata Computing Real Functions.
SIAM J. Comput. 23(4): 789-814 (1994) |
| 1993 |
|---|
| 54 | | Juhani Karhumäki:
Equations Over Finite Sets of Words and Equivalence Problems in Automata Theory.
Theor. Comput. Sci. 108(1): 103-118 (1993) |
| 1992 |
|---|
| 53 | | Juhani Karhumäki,
Wojciech Plandowski,
Wojciech Rytter:
Polynomial Size Test Sets for Context-Free Languages.
ICALP 1992: 53-64 |
| 52 | | Denis Derencourt,
Juhani Karhumäki,
Michel Latteux,
Alain Terlutte:
On Computational Power of Weighted Finite Automata.
MFCS 1992: 236-245 |
| 51 | | Karel Culik II,
Juhani Karhumäki:
Iterative Devices Generating Infinite Words.
STACS 1992: 531-543 |
| 50 | | Juhani Karhumäki:
Multiplicities: A Deterministsic View of Nondeterminism.
Theor. Comput. Sci. 98(1): 15-25 (1992) |
| 1991 |
|---|
| 49 | | Juhani Karhumäki,
Wojciech Rytter,
Stefan Jarominek:
Efficient Constructions of Test Sets for Regular and Context-Free Languages.
MFCS 1991: 249-258 |
| 48 | EE | Juraj Hromkovic,
Juhani Karhumäki,
Branislav Rovan,
Anna Slobodová:
On the power of synchronization in parallel computations.
Discrete Applied Mathematics 32(2): 155-182 (1991) |
| 47 | | Tero Harju,
Juhani Karhumäki:
The Equivalence Problem of Multitape Finite Automata.
Theor. Comput. Sci. 78(2): 347-355 (1991) |
| 1990 |
|---|
| 46 | | Juhani Karhumäki:
Systems of Equations over a Finite Set of Words and Automata Theory.
IWWERT 1990: 247-249 |
| 45 | | Tero Harju,
Juhani Karhumäki:
Decidability of the Multiplicity Equivalence of Multitape Finite Automata
STOC 1990: 477-481 |
| 44 | | Karel Culik II,
Juhani Karhumäki:
Loops in automata and HDTOL relations.
ITA 24: 327-338 (1990) |
| 1989 |
|---|
| 43 | | Jürgen Dassow,
Juraj Hromkovic,
Juhani Karhumäki,
Branislav Rovan,
Anna Slobodová:
On the Power of Synchronization in Parallel Computations.
MFCS 1989: 196-206 |
| 42 | | Karel Culik II,
Juhani Karhumäki:
On the Equivalence Problem for Deterministic Multitape Automata and Transducers.
STACS 1989: 468-479 |
| 41 | | Karel Culik II,
Juhani Karhumäki:
HDTOL Matching of Computations of Multitape Automata.
Acta Inf. 27(2): 179-191 (1989) |
| 1988 |
|---|
| 40 | | Arto Salomaa,
Juhani Karhumäki:
The Formal Language Theory Column.
Bulletin of the EATCS 34: 82-96 (1988) |
| 39 | | Karel Culik II,
Juhani Karhumäki:
On Totalistic Systolic Networks.
Inf. Process. Lett. 26(5): 231-236 (1988) |
| 1987 |
|---|
| 38 | | Juhani Karhumäki:
On Recent Trends in Formal Language Theory.
ICALP 1987: 136-162 |
| 37 | | Juhani Karhumäki:
The Ehrenfeucht Conjecture for Transducers.
Elektronische Informationsverarbeitung und Kybernetik 23(8/9): 389-401 (1987) |
| 36 | | Sándor Horváth,
Juhani Karhumäki,
Jetty Kleijn:
Results Concerning Palindromicity.
Elektronische Informationsverarbeitung und Kybernetik 23(8/9): 441-451 (1987) |
| 35 | | Karel Culik II,
Juhani Karhumäki:
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable.
SIAM J. Comput. 16(2): 221-230 (1987) |
| 1986 |
|---|
| 34 | | Juhani Karhumäki:
The equivalence of mappings on languages.
IMYCS 1986: 26-38 |
| 33 | | Karel Culik II,
Juhani Karhumäki:
The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable.
MFCS 1986: 264-272 |
| 32 | | Karel Culik II,
Juhani Karhumäki:
Synchronizable Deterministic Pushdown Automata and the Decidability of their Equivalence.
Acta Inf. 23(5): 597-605 (1986) |
| 31 | | Juhani Karhumäki,
Yael Maon:
A Simple Undecidable Problem: Existential Agreement of Inverses of Two Morphisms on a Regular Language.
J. Comput. Syst. Sci. 32(3): 315-322 (1986) |
| 30 | | Karel Culik II,
Juhani Karhumäki:
The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable.
Theor. Comput. Sci. 47(3): 71-84 (1986) |
| 1985 |
|---|
| 29 | | Karel Culik II,
Juhani Karhumäki:
Decision problems solved with the help of the Ehrenfeucht conjecture.
Bulletin of the EATCS 27: 30-34 (1985) |
| 28 | | Juhani Karhumäki,
H. C. M. Kleijn:
On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages.
ITA 19(3): 203-211 (1985) |
| 27 | | Juhani Karhumäki:
On Three-Element Codes.
Theor. Comput. Sci. 40: 3-11 (1985) |
| 26 | | Juhani Karhumäki:
A Property of Three-Element Codes.
Theor. Comput. Sci. 41: 215-222 (1985) |
| 1984 |
|---|
| 25 | | Juhani Karhumäki:
On Three-Element Codes.
ICALP 1984: 292-302 |
| 24 | | Juhani Karhumäki,
H. C. M. Kleijn:
On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages.
MFCS 1984: 355-363 |
| 23 | | Juhani Karhumäki:
A Property of Three-Element Codes.
STACS 1984: 305-313 |
| 22 | | Juhani Karhumäki,
Derick Wood:
Inverse Morphic Equivalence on Languages.
Inf. Process. Lett. 19(5): 213-218 (1984) |
| 21 | | Juhani Karhumäki:
The Ehrenfeucht Conjecutre: A Compactness Claim for Finitely Generated Free Monoids.
Theor. Comput. Sci. 29: 285-308 (1984) |
| 1983 |
|---|
| 20 | | Christian Choffrut,
Juhani Karhumäki:
Test Sets for Morphisms with Bounded Delay.
ICALP 1983: 118-127 |
| 19 | | Juhani Karhumäki:
A Note on Intersections of Free Submonoids of a Free Monoid.
ICALP 1983: 397-407 |
| 18 | EE | Karel Culik II,
Juhani Karhumäki:
Systems of equations over a free monoid and Ehrenfeucht's conjecture.
Discrete Mathematics 43(2-3): 139-153 (1983) |
| 17 | | Karel Culik II,
Juhani Karhumäki:
On the Ehrenfeucht Conjecture for DOL Languages.
ITA 17(3): 205-230 (1983) |
| 1982 |
|---|
| 16 | | Juhani Karhumäki:
On the Equivalence Problem for Binary DOL Systems.
ICALP 1982: 339-347 |
| 15 | | J. Albert,
Karel Culik II,
Juhani Karhumäki:
Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid
Information and Control 52(2): 172-186 (1982) |
| 14 | | Andrzej Ehrenfeucht,
Juhani Karhumäki,
Grzegorz Rozenberg:
The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable.
Theor. Comput. Sci. 21: 119-144 (1982) |
| 1981 |
|---|
| 13 | | Juhani Karhumäki:
On Strongly Cube-Free Omega-Words Generated by Binary Morphisms.
FCT 1981: 182-189 |
| 12 | | Juhani Karhumäki:
Generalized Parikh Mappings and Homomorphisms.
ICALP 1981: 324-332 |
| 11 | | Juhani Karhumäki:
On the Equivalence Problem for Binary DOL Systems
Information and Control 50(3): 276-284 (1981) |
| 1980 |
|---|
| 10 | | Karel Culik II,
Juhani Karhumäki:
On the Equality Sets for Homomorphisms on Free Monoids with Two Generators.
ITA 14(4): 349-369 (1980) |
| 9 | | Juhani Karhumäki:
Generalized Parikh Mappings and Homomorphisms
Information and Control 47(3): 155-165 (1980) |
| 1979 |
|---|
| 8 | | Karel Culik II,
Juhani Karhumäki:
Interactive L Systems with Almost Interactionless Behaviour.
MFCS 1979: 246-257 |
| 7 | | Karel Culik II,
Juhani Karhumäki:
Interactive L Systems with Almost Interactionless Behaviour
Information and Control 43(1): 83-100 (1979) |
| 6 | | Juhani Karhumäki:
On Commutative DT0L Systems.
Theor. Comput. Sci. 9: 207-220 (1979) |
| 1977 |
|---|
| 5 | | Juhani Karhumäki:
The Decidability of the Equivalence Problem for Polynomially Bounded DOL Sequences.
ITA 11(1): 17-28 (1977) |
| 4 | | Juhani Karhumäki:
Remarks on Commutative N -Rational Series.
Theor. Comput. Sci. 5(2): 211-217 (1977) |
| 1976 |
|---|
| 3 | | Juhani Karhumäki:
Two Theorems Concerning Recognizable N-Subsets of sigma*.
Theor. Comput. Sci. 1(4): 317-323 (1976) |
| 1974 |
|---|
| 2 | | Juhani Karhumäki:
Some Growth Functions of Context-Dependent L-Systems.
L Systems 1974: 127-135 |
| 1973 |
|---|
| 1 | | Juhani Karhumäki:
An Example of a PD2L-System with the Growth Type 2½.
Inf. Process. Lett. 2(5): 131-134 (1973) |
