Search the dblp DataBase
Juhani Karhumäki :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Juhani Karhumäki Some Growth Functions of Context-Dependent L-Systems. [Citation Graph (0, 0)][DBLP ] L Systems, 1974, pp:127-135 [Conf ] Karel Culik II , Juhani Karhumäki , Petri Salmela Fixed Point Approach to Commutation of Languages. [Citation Graph (0, 0)][DBLP ] Aspects of Molecular Computing, 2004, pp:119-131 [Conf ] Tero Harju , Juhani Karhumäki , Mario Petrich Compactness of Systems of Equations on Completely Regular Semigroups. [Citation Graph (0, 0)][DBLP ] Structures in Logic and Computer Science, 1997, pp:268-280 [Conf ] Juraj Hromkovic , Juhani Karhumäki Two Lower Bounds on Computational Complexity of Infinite Words. [Citation Graph (0, 0)][DBLP ] New Trends in Formal Languages, 1997, pp:366-376 [Conf ] Juraj Hromkovic , Juhani Karhumäki , Arto Lepistö Comparing Descriptional and Computational Complexity of Infinite Words. [Citation Graph (0, 0)][DBLP ] Results and Trends in Theoretical Computer Science, 1994, pp:169-182 [Conf ] Juhani Karhumäki , Leonid P. Lisovik On the Equivalence of Finite Substitutions and Transducers. [Citation Graph (0, 0)][DBLP ] Jewels are Forever, 1999, pp:97-108 [Conf ] Juhani Karhumäki , Ion Petre The Branching Point Approach to Conway's Problem. [Citation Graph (0, 0)][DBLP ] Formal and Natural Computing, 2002, pp:69-76 [Conf ] Julien Cassaigne , Juhani Karhumäki Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:244-253 [Conf ] Juhani Karhumäki , Wojciech Plandowski , Wojciech Rytter The Compression of Subsegments of Images Described by Finite Automata. [Citation Graph (0, 0)][DBLP ] CPM, 1999, pp:186-195 [Conf ] Karel Culik II , Juhani Karhumäki , Jarkko Kari A Note on Synchronized Automata and Road Coloring Problem. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 2001, pp:175-185 [Conf ] Juhani Karhumäki , Sabrina Mantaci Defect theorems for trees. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 1999, pp:164-177 [Conf ] Juhani Karhumäki , Wojciech Plandowski On the complexity of computing the order of repetition of a string. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 1999, pp:178-184 [Conf ] Juhani Karhumäki Challenges of Commutation. [Citation Graph (0, 0)][DBLP ] FCT, 2001, pp:15-23 [Conf ] Juhani Karhumäki On Strongly Cube-Free Omega-Words Generated by Binary Morphisms. [Citation Graph (0, 0)][DBLP ] FCT, 1981, pp:182-189 [Conf ] Juhani Karhumäki , Wojciech Plandowski , Wojciech Rytter On the Complexity of Decidable Cases of Commutation Problem for Languages. [Citation Graph (0, 0)][DBLP ] FCT, 2001, pp:193-203 [Conf ] Juhani Karhumäki , Wojciech Plandowski , Wojciech Rytter Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata. [Citation Graph (0, 0)][DBLP ] FCT, 1997, pp:245-256 [Conf ] Christian Choffrut , Juhani Karhumäki Test Sets for Morphisms with Bounded Delay. [Citation Graph (0, 0)][DBLP ] ICALP, 1983, pp:118-127 [Conf ] Tero Harju , Oscar H. Ibarra , Juhani Karhumäki , Arto Salomaa Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages. [Citation Graph (0, 0)][DBLP ] ICALP, 2001, pp:579-590 [Conf ] Tero Harju , Juhani Karhumäki , Wojciech Plandowski Compactness of Systems of Equations in Semigroups. [Citation Graph (0, 0)][DBLP ] ICALP, 1995, pp:444-454 [Conf ] Juraj Hromkovic , Juhani Karhumäki , Hartmut Klauck , Georg Schnitger , Sebastian Seibert Measures of Nondeterminism in Finite Automata. [Citation Graph (0, 0)][DBLP ] ICALP, 2000, pp:199-210 [Conf ] Juhani Karhumäki Generalized Parikh Mappings and Homomorphisms. [Citation Graph (0, 0)][DBLP ] ICALP, 1981, pp:324-332 [Conf ] Juhani Karhumäki On the Equivalence Problem for Binary DOL Systems. [Citation Graph (0, 0)][DBLP ] ICALP, 1982, pp:339-347 [Conf ] Juhani Karhumäki A Note on Intersections of Free Submonoids of a Free Monoid. [Citation Graph (0, 0)][DBLP ] ICALP, 1983, pp:397-407 [Conf ] Juhani Karhumäki On Three-Element Codes. [Citation Graph (0, 0)][DBLP ] ICALP, 1984, pp:292-302 [Conf ] Juhani Karhumäki On Recent Trends in Formal Language Theory. [Citation Graph (0, 0)][DBLP ] ICALP, 1987, pp:136-162 [Conf ] Juhani Karhumäki , Michal Kunc , Alexander Okhotin Communication of Two Stacks and Rewriting. [Citation Graph (0, 0)][DBLP ] ICALP (2), 2006, pp:468-479 [Conf ] Juhani Karhumäki , Leonid P. Lisovik The Equivalence Problem of Finite Substitutions on ab* c, with Applications. [Citation Graph (0, 0)][DBLP ] ICALP, 2002, pp:812-820 [Conf ] Juhani Karhumäki , Arto Lepistö , Wojciech Plandowski Locally Periodic Infinite Words and a Chaotic Behaviour. [Citation Graph (0, 0)][DBLP ] ICALP, 1998, pp:421-430 [Conf ] Juhani Karhumäki , Ion Petre On the Centralizer of a Finite Set. [Citation Graph (0, 0)][DBLP ] ICALP, 2000, pp:536-546 [Conf ] Juhani Karhumäki , Wojciech Plandowski , Filippo Mignosi The Expressibility of Languages and Relations by Word Equations. [Citation Graph (0, 0)][DBLP ] ICALP, 1997, pp:98-109 [Conf ] Juhani Karhumäki , Wojciech Plandowski , Wojciech Rytter Polynomial Size Test Sets for Context-Free Languages. [Citation Graph (0, 0)][DBLP ] ICALP, 1992, pp:53-64 [Conf ] Juraj Hromkovic , Juhani Karhumäki Two Lower Bounds on Computational Complexity of Infinite Word Generation. [Citation Graph (0, 0)][DBLP ] IFIP Congress (1), 1994, pp:479-484 [Conf ] Juhani Karhumäki The equivalence of mappings on languages. [Citation Graph (0, 0)][DBLP ] IMYCS, 1986, pp:26-38 [Conf ] Juhani Karhumäki Systems of Equations over a Finite Set of Words and Automata Theory. [Citation Graph (0, 0)][DBLP ] IWWERT, 1990, pp:247-249 [Conf ] Juhani Karhumäki Combinatorial and Computational Problems on Finite Sets of Words. [Citation Graph (0, 0)][DBLP ] MCU, 2001, pp:69-81 [Conf ] Juhani Karhumäki Finite Sets of Words and Computing. [Citation Graph (0, 0)][DBLP ] MCU, 2004, pp:36-49 [Conf ] Karel Culik II , Juhani Karhumäki Interactive L Systems with Almost Interactionless Behaviour. [Citation Graph (0, 0)][DBLP ] MFCS, 1979, pp:246-257 [Conf ] Karel Culik II , Juhani Karhumäki The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable. [Citation Graph (0, 0)][DBLP ] MFCS, 1986, pp:264-272 [Conf ] Jürgen Dassow , Juraj Hromkovic , Juhani Karhumäki , Branislav Rovan , Anna Slobodová On the Power of Synchronization in Parallel Computations. [Citation Graph (0, 0)][DBLP ] MFCS, 1989, pp:196-206 [Conf ] Denis Derencourt , Juhani Karhumäki , Michel Latteux , Alain Terlutte On Computational Power of Weighted Finite Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 1992, pp:236-245 [Conf ] Mika Hirvensalo , Juhani Karhumäki Computing Partial Information out of Intractable One - The First Digit of 2 n at Base 3 as an Example. [Citation Graph (0, 0)][DBLP ] MFCS, 2002, pp:319-327 [Conf ] Juhani Karhumäki Applications of Finite Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 2002, pp:40-58 [Conf ] Juhani Karhumäki , H. C. M. Kleijn On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1984, pp:355-363 [Conf ] Juhani Karhumäki , Ján Manuch , Wojciech Plandowski On Defect Effect of Bi-Infinite Words. [Citation Graph (0, 0)][DBLP ] MFCS, 1998, pp:674-682 [Conf ] Juhani Karhumäki , Wojciech Plandowski On the Size of Independent Systems of Equations in Semigroups. [Citation Graph (0, 0)][DBLP ] MFCS, 1994, pp:443-452 [Conf ] Juhani Karhumäki , Wojciech Rytter , Stefan Jarominek Efficient Constructions of Test Sets for Regular and Context-Free Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1991, pp:249-258 [Conf ] Karel Culik II , Juhani Karhumäki On the Equivalence Problem for Deterministic Multitape Automata and Transducers. [Citation Graph (0, 0)][DBLP ] STACS, 1989, pp:468-479 [Conf ] Karel Culik II , Juhani Karhumäki Iterative Devices Generating Infinite Words. [Citation Graph (0, 0)][DBLP ] STACS, 1992, pp:531-543 [Conf ] Tero Harju , Juhani Karhumäki , Daniel Krob Remarks on Generalized Post Correspondence Problem. [Citation Graph (0, 0)][DBLP ] STACS, 1996, pp:39-48 [Conf ] Juhani Karhumäki A Property of Three-Element Codes. [Citation Graph (0, 0)][DBLP ] STACS, 1984, pp:305-313 [Conf ] Juhani Karhumäki , Leonid P. Lisovik A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab* c. [Citation Graph (0, 0)][DBLP ] STACS, 2001, pp:388-395 [Conf ] Juhani Karhumäki , Michel Latteux , Ion Petre The Commutation with Codes and Ternary Sets of Words. [Citation Graph (0, 0)][DBLP ] STACS, 2003, pp:74-84 [Conf ] Tero Harju , Juhani Karhumäki Decidability of the Multiplicity Equivalence of Multitape Finite Automata [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:477-481 [Conf ] Juhani Karhumäki Automata on Words. [Citation Graph (0, 0)][DBLP ] CIAA, 2003, pp:3-10 [Conf ] Karel Culik II , Juhani Karhumäki Synchronizable Deterministic Pushdown Automata and the Decidability of their Equivalence. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1986, v:23, n:5, pp:597-605 [Journal ] Karel Culik II , Juhani Karhumäki HDTOL Matching of Computations of Multitape Automata. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1989, v:27, n:2, pp:179-191 [Journal ] Juhani Karhumäki , Jeffrey Shallit Polynomial versus Exponential Growth in Repetition-Free Binary Words [Citation Graph (0, 0)][DBLP ] CoRR, 2003, v:0, n:, pp:- [Journal ] Vesa Halava , Tero Harju , Juhani Karhumäki Decidability of the binary infinite Post Correspondence Problem. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:130, n:3, pp:521-526 [Journal ] Juhani Karhumäki , Wojciech Plandowski , Wojciech Rytter The complexity of compressing subsegments of images described by finite automata. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:125, n:2-3, pp:235-254 [Journal ] Jean Berstel , Juhani Karhumäki Combinatorics on words: a tutorial. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 2003, v:79, n:, pp:178-0 [Journal ] Karel Culik II , Juhani Karhumäki Decision problems solved with the help of the Ehrenfeucht conjecture. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1985, v:27, n:, pp:30-34 [Journal ] Juhani Karhumäki , Ion Petre Conway's Problem and the Communication of Languages. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 2001, v:74, n:, pp:171-189 [Journal ] Arto Salomaa , Juhani Karhumäki The Formal Language Theory Column. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1988, v:34, n:, pp:82-96 [Journal ] Juraj Hromkovic , Juhani Karhumäki , Hartmut Klauck , Georg Schnitger , Sebastian Seibert Measures of Nondeterminism in Finite Automata [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:76, pp:- [Journal ] Sándor Horváth , Juhani Karhumäki , Jetty Kleijn Results Concerning Palindromicity. [Citation Graph (0, 0)][DBLP ] Elektronische Informationsverarbeitung und Kybernetik, 1987, v:23, n:8/9, pp:441-451 [Journal ] Juhani Karhumäki The Ehrenfeucht Conjecture for Transducers. [Citation Graph (0, 0)][DBLP ] Elektronische Informationsverarbeitung und Kybernetik, 1987, v:23, n:8/9, pp:389-401 [Journal ] Julien Cassaigne , Juhani Karhumäki Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 1997, v:18, n:5, pp:497-510 [Journal ] Denis Derencourt , Juhani Karhumäki , Michel Latteux , Alain Terlutte On Computational Power of Weighted Finite Automata. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 1996, v:25, n:3, pp:285-293 [Journal ] Juhani Karhumäki , Sabrina Mantaci Defect Theorems for Trees. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 1999, v:38, n:1-2, pp:119-133 [Journal ] Vesa Halava , Tero Harju , Juhani Karhumäki Undecidability in omega-Regular Languages. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2006, v:73, n:1-2, pp:119-125 [Journal ] J. Albert , Karel Culik II , Juhani Karhumäki Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid [Citation Graph (0, 0)][DBLP ] Information and Control, 1982, v:52, n:2, pp:172-186 [Journal ] Karel Culik II , Juhani Karhumäki Interactive L Systems with Almost Interactionless Behaviour [Citation Graph (0, 0)][DBLP ] Information and Control, 1979, v:43, n:1, pp:83-100 [Journal ] Juraj Hromkovic , Sebastian Seibert , Juhani Karhumäki , Hartmut Klauck , Georg Schnitger Communication Complexity Method for Measuring Nondeterminism in Finite Automata. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2002, v:172, n:2, pp:202-217 [Journal ] Juhani Karhumäki Generalized Parikh Mappings and Homomorphisms [Citation Graph (0, 0)][DBLP ] Information and Control, 1980, v:47, n:3, pp:155-165 [Journal ] Juhani Karhumäki On the Equivalence Problem for Binary DOL Systems [Citation Graph (0, 0)][DBLP ] Information and Control, 1981, v:50, n:3, pp:276-284 [Journal ] Juhani Karhumäki , Leonid P. Lisovik A simple undecidable problem: the inclusion problem for finite substitutions on ab*c. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2003, v:187, n:1, pp:40-48 [Journal ] Karel Culik II , Juhani Karhumäki Iterative Devices Generating Infinite Words. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 1994, v:5, n:1, pp:69-97 [Journal ] Karel Culik II , Juhani Karhumäki , Jarkko Kari A Note on Synchronized Automata and Road Coloring Problem. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2002, v:13, n:3, pp:459-471 [Journal ] Juhani Karhumäki , Leonid P. Lisovik The Equivalence Problem of Finite Substitutions on ab*c, with Applications. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2003, v:14, n:4, pp:699-0 [Journal ] Karel Culik II , Juhani Karhumäki On Totalistic Systolic Networks. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1988, v:26, n:5, pp:231-236 [Journal ] Juhani Karhumäki An Example of a PD2L-System with the Growth Type 2½. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1973, v:2, n:5, pp:131-134 [Journal ] Juhani Karhumäki , Derick Wood Inverse Morphic Equivalence on Languages. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1984, v:19, n:5, pp:213-218 [Journal ] Julien Cassaigne , Juhani Karhumäki , Ján Manuch On Conjugacy of Languages. [Citation Graph (0, 0)][DBLP ] ITA, 2001, v:35, n:6, pp:535-550 [Journal ] Karel Culik II , Juhani Karhumäki On the Equality Sets for Homomorphisms on Free Monoids with Two Generators. [Citation Graph (0, 0)][DBLP ] ITA, 1980, v:14, n:4, pp:349-369 [Journal ] Karel Culik II , Juhani Karhumäki On the Ehrenfeucht Conjecture for DOL Languages. [Citation Graph (0, 0)][DBLP ] ITA, 1983, v:17, n:3, pp:205-230 [Journal ] Karel Culik II , Juhani Karhumäki Loops in automata and HDTOL relations. [Citation Graph (0, 0)][DBLP ] ITA, 1990, v:24, n:, pp:327-338 [Journal ] Denis Derencourt , Juhani Karhumäki , Michel Latteux , Alain Terlutte On Continuous Functions Computed by Finite Automata. [Citation Graph (0, 0)][DBLP ] ITA, 1994, v:28, n:3-4, pp:387-403 [Journal ] Juhani Karhumäki The Decidability of the Equivalence Problem for Polynomially Bounded DOL Sequences. [Citation Graph (0, 0)][DBLP ] ITA, 1977, v:11, n:1, pp:17-28 [Journal ] Juhani Karhumäki , H. C. M. Kleijn On the Equivalence of Compositions of Morphisms and Inverse Morphisms on Regular Languages. [Citation Graph (0, 0)][DBLP ] ITA, 1985, v:19, n:3, pp:203-211 [Journal ] Juhani Karhumäki , Filippo Mignosi , Wojciech Plandowski The expressibility of languages and relations by word equations. [Citation Graph (0, 0)][DBLP ] J. ACM, 2000, v:47, n:3, pp:483-505 [Journal ] Tero Harju , Oscar H. Ibarra , Juhani Karhumäki , Arto Salomaa Some Decision Problems Concerning Semilinearity and Commutation. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2002, v:65, n:2, pp:278-294 [Journal ] Juhani Karhumäki , Yael Maon A Simple Undecidable Problem: Existential Agreement of Inverses of Two Morphisms on a Regular Language. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1986, v:32, n:3, pp:315-322 [Journal ] Juhani Karhumäki , Wojciech Plandowski , Wojciech Rytter Polynomial Size Test Sets for Context-Free Languages. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1995, v:50, n:1, pp:11-19 [Journal ] Juhani Karhumäki , Arto Lepistö , Wojciech Plandowski Locally Periodic Versus Globally Periodic Infinite Words. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2002, v:100, n:2, pp:250-264 [Journal ] Juhani Karhumäki , Jeffrey Shallit Polynomial versus exponential growth in repetition-free binary words. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2004, v:105, n:2, pp:335-347 [Journal ] Juhani Karhumäki , Michel Latteux , Ion Petre Commutation with Ternary Sets of Words. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2005, v:38, n:2, pp:161-169 [Journal ] Juhani Karhumäki , Wojciech Plandowski , Wojciech Rytter Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata. [Citation Graph (0, 0)][DBLP ] Nord. J. Comput., 2000, v:7, n:1, pp:1-13 [Journal ] Karel Culik II , Juhani Karhumäki The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1987, v:16, n:2, pp:221-230 [Journal ] Karel Culik II , Juhani Karhumäki Finite Automata Computing Real Functions. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:4, pp:789-814 [Journal ] Alberto Bertoni , Zoltán Ésik , Juhani Karhumäki Preface. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:1-5 [Journal ] Julien Cassaigne , Juhani Karhumäki Examples of Undecidable Problems for 2-Generator Matrix Semigroups. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1998, v:204, n:1-2, pp:29-34 [Journal ] Christian Choffrut , Tero Harju , Juhani Karhumäki A Note on Decidability Questions on Presentations of Word Semigroups. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1997, v:183, n:1, pp:83-92 [Journal ] Christian Choffrut , Juhani Karhumäki , Nicolas Ollinger The commutation of finite sets: a challenging problem. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:273, n:1-2, pp:69-79 [Journal ] Karel Culik II , Juhani Karhumäki The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1986, v:47, n:3, pp:71-84 [Journal ] Josep Díaz , Juhani Karhumäki Preface. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:348, n:2-3, pp:129- [Journal ] Andrzej Ehrenfeucht , Juhani Karhumäki , Grzegorz Rozenberg The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1982, v:21, n:, pp:119-144 [Journal ] Tero Harju , Juhani Karhumäki Many aspects of defect theorems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:324, n:1, pp:35-54 [Journal ] Tero Harju , Juhani Karhumäki The Equivalence Problem of Multitape Finite Automata. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1991, v:78, n:2, pp:347-355 [Journal ] Tero Harju , Juhani Karhumäki , Antonio Restivo Preface. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:339, n:1, pp:1-2 [Journal ] Juhani Karhumäki Two Theorems Concerning Recognizable N-Subsets of sigma*. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1976, v:1, n:4, pp:317-323 [Journal ] Juhani Karhumäki Remarks on Commutative N -Rational Series. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1977, v:5, n:2, pp:211-217 [Journal ] Juhani Karhumäki On Commutative DT0L Systems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1979, v:9, n:, pp:207-220 [Journal ] Juhani Karhumäki The Ehrenfeucht Conjecutre: A Compactness Claim for Finitely Generated Free Monoids. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1984, v:29, n:, pp:285-308 [Journal ] Juhani Karhumäki On Three-Element Codes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:40, n:, pp:3-11 [Journal ] Juhani Karhumäki A Property of Three-Element Codes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1985, v:41, n:, pp:215-222 [Journal ] Juhani Karhumäki Multiplicities: A Deterministsic View of Nondeterminism. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1992, v:98, n:1, pp:15-25 [Journal ] Juhani Karhumäki Equations Over Finite Sets of Words and Equivalence Problems in Automata Theory. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1993, v:108, n:1, pp:103-118 [Journal ] Juhani Karhumäki A Short Biography of Arto Salomaa. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1999, v:226, n:1-2, pp:3-5 [Journal ] Juhani Karhumäki , Michal Kunc , Alexander Okhotin Computing by commuting. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:200-211 [Journal ] Juhani Karhumäki , Michel Latteux , Ion Petre Commutation with codes. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:340, n:1, pp:322-333 [Journal ] Juhani Karhumäki , Ján Manuch Multiple factorizations of words and defect effect. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:273, n:1-2, pp:81-97 [Journal ] Juhani Karhumäki , Ján Manuch , Wojciech Plandowski A defect theorem for bi-infinite words. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:292, n:1, pp:237-243 [Journal ] Juhani Karhumäki , Ion Petre Conway's problem for three-word sets. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:289, n:1, pp:705-725 [Journal ] Juhani Karhumäki , Wojciech Plandowski On the Size of Independent Systems of Equations in Semigroups. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:168, n:1, pp:105-119 [Journal ] Juhani Karhumäki , Wojciech Plandowski , Wojciech Rytter On the complexity of decidable cases of the commutation problem of languages. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:337, n:1-3, pp:105-118 [Journal ] Juhani Karhumäki , Wojciech Plandowski , Wojciech Rytter Generalized Factorizations of Words and Their Algorithmic Properties. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1999, v:218, n:1, pp:123-133 [Journal ] Juhani Karhumäki , Grzegorz Rozenberg Preface: Insightful Theory. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:330, n:1, pp:1- [Journal ] Juhani Karhumäki , Yury Lifshits , Wojciech Rytter Tiling Periodicity. [Citation Graph (0, 0)][DBLP ] CPM, 2007, pp:295-306 [Conf ] Karel Culik II , Juhani Karhumäki Systems of equations over a free monoid and Ehrenfeucht's conjecture. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:43, n:2-3, pp:139-153 [Journal ] Vesa Halava , Tero Harju , Juhani Karhumäki The Structure of Infinite Solutions of Marked and Binary Post Correspondence Problems. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2007, v:40, n:1, pp:43-54 [Journal ] Vesa Halava , Tero Harju , Juhani Karhumäki , Michel Latteux Extension of the decidability of the marked PCP to instances with unique blocks. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:380, n:3, pp:355-362 [Journal ] Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. [Citation Graph (, )][DBLP ] An Analysis and a Reproof of Hmelevskii's Theorem. [Citation Graph (, )][DBLP ] A lower bound for a constant in Shallit's conjecture. [Citation Graph (, )][DBLP ] On Stateless Multihead Automata: Hierarchies and the Emptiness Problem. [Citation Graph (, )][DBLP ] On the power of synchronization in parallel computations. [Citation Graph (, )][DBLP ] Reachability via Cooperating Morphisms. [Citation Graph (, )][DBLP ] Search in 0.126secs, Finished in 0.130secs