BibSLEIGH — Juhani

Travelled to:

1 × Belgium
1 × Hungary
1 × Israel
1 × Japan
1 × Russia
1 × Switzerland
1 × Taiwan
2 × Austria
2 × Denmark
2 × Germany
2 × Greece
2 × Italy
2 × Spain
2 × USA

Collaborated with:

∅ W.Plandowski A.Saarela S.Puzynina T.Harju F.Mignosi E.Czeizler L.P.Lisovik I.Petre S.Mantaci C.Choffrut L.Q.Zamboni M.Kunc A.Okhotin K.C.II J.Kari A.Lepistö W.Rytter O.H.Ibarra A.Salomaa J.Hromkovic H.Klauck G.Schnitger S.Seibert

Talks about:

theorem (5) word (5) automata (4) languag (4) equival (4) abelian (4) period (4) finit (4) problem (3) system (3)

Person: Juhani Karhumäki

DBLP: Karhum=auml=ki:Juhani

Facilitated 3 volumes:

Contributed to:

2014

2012

2013

2008

2007

2006

2003

2002

2001

2000

1999

1998

1997

1995

1992

1990

1987

1984

1983

1982

1981

Wrote 27 papers:

DLT-2014-KarhumakiP #on the #word: On k-Abelian Palindromic Rich and Poor Words (JK, SP), pp. 191–202.
DLT-2014-KarhumakiSZ #equivalence #theorem: Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence (JK, AS, LQZ), pp. 203–214.
DLT-2012-KarhumakiPS #theorem: Fine and Wilf’s Theorem for k-Abelian Periods (JK, SP, AS), pp. 296–307.
DLT-J-2012-KarhumakiPS13 #theorem: Fine and Wilf’s Theorem for k-Abelian Periods (JK, SP, AS), pp. 1135–1152.
DLT-2008-KarhumakiS #analysis #theorem: An Analysis and a Reproof of Hmelevskii’s Theorem (JK, AS), pp. 467–478.
CIAA-J-2006-CzeizlerK07 #equation #independence #on the #word: On Non-Periodic Solutions of Independent Systems of Word Equations over Three Unknowns (EC, JK), pp. 873–897.
ICALP-v2-2006-KarhumakiKO #communication: Communication of Two Stacks and Rewriting (JK, MK, AO), pp. 468–479.
CIAA-2003-Karhumaki #automaton #word: Automata on Words (JK), pp. 3–10.
ICALP-2002-KarhumakiL #equivalence #finite #problem: The Equivalence Problem of Finite Substitutions on ab*c, with Applications (JK, LPL), pp. 812–820.
DLT-2001-CulikKK #automaton #problem: A Note on Synchronized Automata and Road Coloring Problem (KCI, JK, JK), pp. 175–185.
ICALP-2001-HarjuIKS #morphism: Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages (TH, OHI, JK, AS), pp. 579–590.
ICALP-2000-HromkovicKKSS #automaton #finite #metric #nondeterminism: Measures of Nondeterminism in Finite Automata (JH, JK, HK, GS, SS), pp. 199–210.
ICALP-2000-KarhumakiP #finite #on the #set: On the Centralizer of a Finite Set (JK, IP), pp. 536–546.
DLT-1999-KarhumakiM #fault #theorem: Defect theorems for trees (JK, SM), pp. 164–177.
DLT-1999-KarhumakiP #complexity #on the #order #string: On the complexity of computing the order of repetition of a string (JK, WP), pp. 178–184.
ICALP-1998-KarhumakiLP #behaviour #infinity #word: Locally Periodic Infinite Words and a Chaotic Behaviour (JK, AL, WP), pp. 421–430.
DLT-1997-KarhumakiPM #bound #constant: A lower bound for a constant in Shallit’s conjecture (JK, WP, FM), pp. 103–118.
ICALP-1997-KarhumakiPM #equation #word: The Expressibility of Languages and Relations by Word Equations (JK, WP, FM), pp. 98–109.
ICALP-1995-HarjuKP #equation: Compactness of Systems of Equations in Semigroups (TH, JK, WP), pp. 444–454.
ICALP-1992-KarhumakiPR #context-free grammar #polynomial #testing: Polynomial Size Test Sets for Context-Free Languages (JK, WP, WR), pp. 53–64.
STOC-1990-HarjuK #automaton #decidability #equivalence #finite #multi: Decidability of the Multiplicity Equivalence of Multitape Finite Automata (TH, JK), pp. 477–481.
ICALP-1987-Karhumaki #formal method #on the #roadmap: On Recent Trends in Formal Language Theory (JK), pp. 136–162.
ICALP-1984-Karhumaki #on the: On Three-Element Codes (JK), pp. 292–302.
ICALP-1983-ChoffrutK #bound #morphism #testing: Test Sets for Morphisms with Bounded Delay (CC, JK), pp. 118–127.
ICALP-1983-Karhumaki #monad: A Note on Intersections of Free Submonoids of a Free Monoid (JK), pp. 397–407.
ICALP-1982-Karhumaki #equivalence #on the #problem: On the Equivalence Problem for Binary DOL Systems (JK), pp. 339–347.
ICALP-1981-Karhumaki #morphism: Generalized Parikh Mappings and Homomorphisms (JK), pp. 324–332.