The following pages link to Juhani Karhumäki (Q223814):
Displaying 50 items.
- (Q376137) (redirect page) (← links)
- On \(k\)-abelian avoidability (Q376138) (← links)
- On a generalization of abelian equivalence and complexity of infinite words (Q388738) (← links)
- On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
- HDTOL matching of computations of multitape automata (Q582131) (← links)
- Polynomial versus exponential growth in repetition-free binary words (Q598459) (← links)
- On commutative DTOL systems (Q599514) (← links)
- Unique decipherability in the monoid of languages: an application of rational relations (Q639857) (← links)
- Efficient constructions of test sets for regular and context-free languages (Q685373) (← links)
- Equations over finite sets of words and equivalence problems in automata theory (Q685449) (← links)
- Problems in between words and abelian words: \(k\)-abelian avoidability (Q714821) (← links)
- On cardinalities of \(k\)-abelian equivalence classes (Q728280) (← links)
- A note on intersections of free submonoids of a free monoid (Q760507) (← links)
- Systems of equations over a free monoid and Ehrenfeucht's conjecture (Q786545) (← links)
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007) (← links)
- The equivalence problem of multitape finite automata (Q804302) (← links)
- On the power of synchronization in parallel computations (Q811118) (← links)
- On stateless multihead automata: hierarchies and the emptiness problem (Q844888) (← links)
- The structure of infinite solutions of marked and binary Post correspondence problems (Q866910) (← links)
- Post correspondence problem for short words (Q975420) (← links)
- Conjugacy of finite biprefix codes (Q1019714) (← links)
- Computing partial information out of intractable: powers of algebraic numbers as an example (Q1048926) (← links)
- On binary equality sets and a solution to the test set conjecture in the binary case (Q1056551) (← links)
- Inverse morphic equivalence on languages (Q1061490) (← links)
- On three-element codes (Q1063421) (← links)
- Test sets for morphisms with bounded delay (Q1067414) (← links)
- A property of three-element codes (Q1083216) (← links)
- On morphic generation of regular languages (Q1083217) (← links)
- A note on the equivalence problem of rational formal power series (Q1087021) (← links)
- On the defect theorem and simplifiability (Q1090421) (← links)
- The equivalence of finite valued transducers (on HDT0L languages) is decidable (Q1090467) (← links)
- On totalistic systolic networks (Q1108796) (← links)
- The (generalized) Post correspondence problem with lists consisting of two words is decidable (Q1168746) (← links)
- A note on morphic characterization of languages (Q1171887) (← links)
- Multiplicities: A deterministic view of nondeterminism (Q1194314) (← links)
- Two theorems concerning recognizable \(N\)-subsets of \(\sigma^*\) (Q1227456) (← links)
- Remarks on commutative N-rational series (Q1242693) (← links)
- A note on DOL length sets (Q1245003) (← links)
- Examples of undecidable problems for 2-generator matrix semigroups (Q1275458) (← links)
- Generalized factorizations of words and their algorithmic properties (Q1292486) (← links)
- On the size of independent systems of equations in semigroups (Q1351001) (← links)
- Toeplitz words, generalized periodicity and periodically iterated morphisms (Q1362993) (← links)
- A note on decidability questions on presentations of word semigroups (Q1391138) (← links)
- An example of a PD2L-system with the growth type 2\({1 \over 2}\) (Q1394132) (← links)
- Decidability of the binary infinite Post Correspondence Problem (Q1408462) (← links)
- The commutation of finite sets: A challenging problem (Q1605327) (← links)
- Multiple factorizations of words and defect effect (Q1605328) (← links)
- On abelian subshifts (Q1622994) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
- Commutation with ternary sets of words (Q1771315) (← links)
