The following pages link to Tero J.Harju (Q1806108):
Displayed 50 items.
- Item:Q1806108 (redirect page) (← links)
- Item:Q258068 (redirect page) (← links)
- Item:Q258068 (redirect page) (← links)
- On a question of Hof, Knill and Simon on palindromic substitutive systems (Q258070) (← links)
- On a geometric problem of zigzags. (Q287020) (← links)
- Pancyclicity in switching classes (Q294726) (← links)
- New proof for the undecidability of the circular PCP (Q378203) (← links)
- Square-free words obtained from prefixes by permutations (Q418771) (← links)
- On generating binary words palindromically (Q472173) (← links)
- A note on short palindromes in square-free words (Q476919) (← links)
- Square-free shuffles of words (Q496046) (← links)
- On the \(n\)-permutation Post correspondence problem (Q496055) (← links)
- Abelian bordered factors and periodicity (Q499493) (← links)
- \({\mathcal L}^*\)-unipotent semigroups (Q584427) (← links)
- The number of positions starting a square in binary words (Q625366) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Single-valuedness of tree transducers is decidable in polynomial time (Q685348) (← links)
- T-structures, T-functions, and texts (Q685376) (← links)
- Equations over finite sets of words and equivalence problems in automata theory (Q685449) (← links)
- Synchronized rational relations of finite and infinite words (Q685453) (← links)
- Characterizing the micronuclear gene patterns in ciliates (Q699814) (← links)
- Border correlation of binary words (Q703695) (← links)
- Undecidability in matrices over Laurent polynomials. (Q705234) (← links)
- Simple gene assembly as a rewriting of directed overlap-inclusion graphs (Q714803) (← links)
- Pivots, determinants, and perfect matchings of graphs (Q714808) (← links)
- On the number of frames in binary words (Q719267) (← links)
- Cyclically repetition-free words on small alphabets (Q765486) (← links)
- Completing biprefix codes (Q790624) (← links)
- On the Burnside problem for semigroups (Q797705) (← links)
- Almost finite expansions of arbitrary semigroups (Q798447) (← links)
- The structure of type A semigroups (Q798448) (← links)
- The equations \(h(w)=w^ n\) in binary alphabets (Q799819) (← links)
- Sur les monoides à un relateur qui sont des groupes (Q801040) (← links)
- The equivalence problem of multitape finite automata (Q804302) (← links)
- Integer weighted automata on infinite words (Q832935) (← links)
- Weinbaum factorizations of primitive words (Q845079) (← links)
- Finite metrics in switching classes (Q858301) (← links)
- The structure of infinite solutions of marked and binary Post correspondence problems (Q866910) (← links)
- Parallelism in gene assembly (Q876864) (← links)
- Easy multiplications. II: Extensions of rational semigroups (Q917713) (← links)
- Parallel complexity of signed graphs for gene assembly in ciliates (Q931445) (← links)
- Patterns of simple gene assembly in ciliates (Q948679) (← links)
- Partially commutative inverse monoids. (Q958191) (← links)
- Post correspondence problem for short words (Q975420) (← links)
- Square-free partial words (Q975472) (← links)
- Graph theoretic approach to parallel gene assembly (Q1003730) (← links)
- Overlap-freeness in infinite partial words (Q1006076) (← links)
- Bordered conjugates of words over large alphabets (Q1010701) (← links)
- Elements of computation theory (Q1010960) (← links)
- Equality sets of prefix morphisms and regular star languages (Q1041740) (← links)
- A note on bounded-reversal multipushdown machines (Q1057071) (← links)
- Sequences generated by infinitely iterated morphisms (Q1070044) (← links)