BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Australia
1 × Austria
1 × Czech Republic
1 × Finland
1 × Greece
1 × Hungary
1 × Italy
1 × Portugal
1 × Russia
1 × Taiwan
1 × United Kingdom
2 × France
2 × Germany
2 × Sweden
2 × USA
3 × Canada
4 × Spain
Collaborated with:
S.Yu Y.Han S.Ko A.Salomaa A.Okhotin A.Clarridge C.Câmpeanu T.Ng D.Rappaport S.Vágvölgyi X.Wu Y.Gao G.Rahonis A.L.Szilard X.Piao J.Zan D.Wood C.Calude A.Mateescu K.C.II S.Huerter T.Jiang
Talks about:
languag (18) complex (12) state (11) automata (7) regular (7) finit (7) tree (6) oper (6) free (6) context (5)

Person: Kai Salomaa

DBLP DBLP: Salomaa:Kai

Facilitated 4 volumes:

CIAA 2010Ed
CIAA 2010Ed
CIAA 2004Ed
CIAA 2004Ed

Contributed to:

CIAA 20152015
DLT 20152015
DLT 20142014
LATA 20142014
CIAA 20132013
CIAA 20122012
DLT 20122012
DLT 20122013
AFL 20112011
LATA 20112011
CIAA 20092009
LATA 20092009
CIAA 20082008
LATA 20082008
CIAA 20072007
DLT 20072007
DLT 20072008
CIAA 20062007
DLT 20062006
CIAA 20022002
DLT 20012001
WIA 19991999
WIA 19981998
DLT 19971997
WIA 19971997
WIA 19961996
DLT 19951995
ICALP 19931993
RTA 19911991
TAPSOFT 19951996

Wrote 40 papers:

CIAA-2015-NgRS #complexity #distance
State Complexity of Prefix Distance (TN, DR, KS), pp. 238–249.
DLT-2015-HanKS #fault
Generalizations of Code Languages with Marginal Errors (YSH, SKK, KS), pp. 264–275.
DLT-2015-NgRS #approximate #complexity #pattern matching
State Complexity of Neighbourhoods and Approximate Pattern Matching (TN, DR, KS), pp. 389–400.
DLT-2014-HanKS #complexity
State Complexity of Deletion (YSH, SKK, KS), pp. 37–48.
DLT-2014-OkhotinS #automaton #nondeterminism
Input-Driven Pushdown Automata with Limited Nondeterminism — (AO, KS), pp. 84–102.
LATA-2014-KoHS #top-down
Top-Down Tree Edit-Distance of Regular Tree Languages (SKK, YSH, KS), pp. 466–477.
CIAA-2013-HanKS #approximate #automaton #context-free grammar #finite
Approximate Matching between a Context-Free Grammar and a Finite-State Automaton (YSH, SKK, KS), pp. 146–157.
In Memoriam Sheng Yu (YG, KS), pp. 1–4.
DLT-2012-HanKS #context-free grammar #regular expression
Computing the Edit-Distance between a Regular Language and a Context-Free Language (YSH, SKK, KS), pp. 85–96.
DLT-J-2012-HanKS13 #context-free grammar #regular expression
The Edit-Distance between a Regular Language and a Context-Free Language (YSH, SKK, KS), pp. 1067–1082.
Goodby to the Kindhearted Dragon Prof. Sheng Yu, 1950-2012 (AS, KS, ALS), pp. 945–954.
AFL-2011-PiaoSV #morphism
Tree Homomorphisms for Unranked Trees (XP, KS, SV), pp. 343–357.
LATA-2011-OkhotinS #ambiguity #automaton #complexity #word
Descriptional Complexity of Unambiguous Nested Word Automata (AO, KS), pp. 414–426.
LATA-2011-SalomaaSY #complexity
Undecidability of the State Complexity of Composed Regular Operations (AS, KS, SY), pp. 489–498.
CIAA-2009-ClarridgeS #automaton
A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule (AC, KS), pp. 44–53.
LATA-2009-ClarridgeS #automaton #composition
A Cryptosystem Based on the Composition of Reversible Cellular Automata (AC, KS), pp. 314–325.
LATA-2009-HanSY #complexity #regular expression
State Complexity of Combined Operations for Prefix-Free Regular Languages (YSH, KS, SY), pp. 398–409.
LATA-2009-Salomaa #automaton #complexity #word
State Complexity of Nested Word Automata (KS), pp. 59–70.
Language Decompositions, Primality, and Trajectory-Based Operations (KS), pp. 17–22.
Length Codes, Products of Languages and Primality (AS, KS, SY), pp. 476–486.
Deterministic Caterpillar Expressions (KS, SY, JZ), pp. 97–108.
DLT-2007-HanS #complexity #finite
State Complexity of Union and Intersection of Finite Languages (YSH, KS), pp. 217–228.
DLT-2007-Salomaa #automaton #complexity #finite #nondeterminism
Descriptional Complexity of Nondeterministic Finite Automata (KS), pp. 31–35.
DLT-J-2007-HanS08 #complexity #finite
State Complexity of Union and Intersection of Finite Languages (YSH, KS), pp. 581–595.
CIAA-J-2006-SalomaaY07 #complexity #estimation #on the
On the State Complexity of Combined Operations and their Estimation (KS, SY), pp. 683–698.
DLT-2006-HanSW #regular expression
Prime Decompositions of Regular Languages (YSH, KS, DW), pp. 145–155.
CIAA-2002-CampeanuSY #regular expression
Regex and Extended Regex (CC, KS, SY), pp. 77–84.
Shuffle Quotient and Decompositions (CC, KS, SV), pp. 186–196.
WIA-1999-CaludeSY #analysis #metric
Metric Lexical Analysis (CC, KS, SY), pp. 48–59.
WIA-1999-CampeanuCSY #complexity #finite
State Complexity of Basic Operations on Finite Languages (CC, KCI, KS, SY), pp. 60–70.
WIA-1998-HuerterSWY #automaton #finite #implementation
Implementing Reversed Alternating Finite Automaton (r-AFA) Operations (SH, KS, XW, SY), pp. 69–81.
DLT-1997-MateescuSY #context-free grammar #decidability
Decidability of fairness for context-free languages (AM, KS, SY), pp. 351–364.
DLT-1997-RahonisS #algebra
Hierarchies of synchronized and algebraic forests (GR, KS), pp. 447–460.
WIA-1997-SalomaaWY #implementation #performance #regular expression #using
Efficient Implementation of Regular Languages Using R-AFA (KS, XW, SY), pp. 176–184.
WIA-1996-SalomaaY #automaton #finite #nondeterminism
NFA to DFA Transformation for Finite Languages (KS, SY), pp. 149–158.
DLT-1995-SalomaaY #context-free grammar #nondeterminism
Nondeterminism Degrees for Context-Free Languages (KS, SY), pp. 154–165.
ICALP-1993-JiangSSY #decidability #pattern matching
Inclusion is Undecidable for Pattern Languages (TJ, AS, KS, SY), pp. 301–312.
RTA-1991-Salomaa #confluence #decidability #monad #term rewriting #termination
Decidability of Confluence and Termination of Monadic Term Rewriting Systems (KS), pp. 275–286.
TAPSOFT-1995-Salomaa #automaton #decidability #equivalence
Decidability of Equivalence for Deterministic Synchronized Tree Automata (KS), pp. 140–154.
TAPSOFT-J-1995-Salomaa96 #automaton #decidability #equivalence
Decidability of Equivalence for Deterministic Synchronized Tree Automata (KS), pp. 171–192.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.