Kai Salomaa

Kai T. Salomaa is a Finnish Canadian theoretical computer scientist, known for his numerous contributions to the state complexity of finite automata.[1][2][3][4][5] His highly cited 1994 joint paper with Yu and Zhuang[6] laid the foundations of the area. He has published over 100 papers in scientific journals on various subjects in formal language theory. Salomaa is a full professor at Queen's University (Kingston, Ontario).

Kai Salomaa
Born
 Finland
Alma materUniversity of Turku
Known forformal language theory, state complexity
Scientific career
FieldsAutomata theory
InstitutionsQueen's University
ThesisAlternation and Pushdown Stores in Computations of Tree Automata (1989)
Doctoral advisor

Biography

Salomaa did his undergraduate studies at the University of Turku, where he has earned his Ph.D. degree in 1989; his dissertation was jointly supervised by Ronald V. Book and Magnus Steinby. In the 1990s, Salomaa worked at the University of Western Ontario. Since 1999, he holds a professor position at Queen's University. His father, Arto Salomaa, is also a distinguished computer scientist with numerous contributions to the fields of automata theory and formal languages.

gollark: **Have**: A CB neglected and slight annoyance at whoever must have offered on that 2G SAltkin first.**Want** (sorted by priority):- 2G SAltkin.- IOU of many reds, xenowyrms, balloons, whatever. I don't care too much about their lineage.- Programming language etc. codes (caps doesn't matter) (there's a wikipedia list of programming languages if you want to know).- CB metals, especially green coppers.- A few (6? It depends) higher-gen SAltkins and prizes, ideally as hatchlings.- A 2G prize, ideally from a xenowyrm. I guess I'd also accept a few xenowyrm prizekins. Praise Xenowyrms!- Cool offers not listed here.Offer simple offers here: https://dragcave.net/teleport/477fa0e84f772eaa4f71c42e903d5353DM me otherwise.
gollark: https://dragcave.net/teleport/df20492dbf98880dd7077c93a26ba8c3**Have** a CB neglected, don't know the gender.**Want**:- IOU for MOAR REDS, new releases (in a while), balloons, xenowyrms, whatever; DM me!- 2G prize (I like shimmerscales most)- 2G SAltkin (not much preference, but from xenowyrm would be cool)- CB metals; green coppers especially nice- Many xenowyrms- Interesting codes - palindromes or programming languages- Any offers you think are actually good~~I can also throw in a CB purple siyat! Do people *want* CB purple siyats? I don't know.~~ gone.If you have offers which don't work via the trade hub, please DM me to discuss. Otherwise, offer there; expect some wait even if I like your offer, but really bad offers *will* be declined.Now unavailable. I offered on a 2G SAltkin trade.
gollark: https://dragcave.net/teleport/858b96ccda1272203c5e2ef3865685a2Have a CB thalassa, want hatchlings (CB or xenowyrm/balloon/red/copper).
gollark: https://dragcave.net/teleport/c4e956df9b1c2a2fbcd6864d025a117b**Want** interesting offers, e.g. CB hatchlings (especially from Coast), xenowyrms, red hatchlings, balloons, other coppers (not brown).***FREE*** for ND or 2G prize!**Have** CB copperIOUs possibly accepted, contact me for info.
gollark: https://dragcave.net/teleport/f129db33a28dcfacbc67ad612e3f6407Want either:- CB ***__H A T C H L I N G S__*** (preferably low-time or from coast)- Xenowyrm hatchlings (any lineage)- Red hatchlings (any lineage)- Cool offers- Differently colored copper- CB ND, 2G Prize

References
  1. Salomaa, Kai; Yu, Sheng (1997). "NFA to DFA transformation for finite languages". 1260: 149–158. doi:10.1007/3-540-63174-7_12. ISSN 0302-9743. Cite journal requires |journal= (help)
  2. Salomaa, Arto; Salomaa, Kai; Yu, Sheng (2007). "State complexity of combined operations". Theoretical Computer Science. 383 (2–3): 140–152. doi:10.1016/j.tcs.2007.04.015. ISSN 0304-3975.
  3. Domaratzki, Michael; Salomaa, Kai (2008). "Lower bounds for the transition complexity of NFAs". Journal of Computer and System Sciences. 74 (7): 1116–1130. doi:10.1016/j.jcss.2008.02.007. ISSN 0022-0000.
  4. Salomaa, Kai (2009). "State Complexity of Nested Word Automata". 5457: 59–70. doi:10.1007/978-3-642-00982-2_5. ISSN 0302-9743. Cite journal requires |journal= (help)
  5. Okhotin, Alexander; Salomaa, Kai (2014). "Complexity of input-driven pushdown automata". ACM SIGACT News. 45 (2): 47–67. doi:10.1145/2636805.2636821. ISSN 0163-5700.
  6. Yu, Sheng; Zhuang, Qingyu; Salomaa, Kai (1994). "The state complexities of some basic operations on regular languages". Theoretical Computer Science. 125 (2): 315–328. doi:10.1016/0304-3975(92)00011-F. ISSN 0304-3975.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.