Kai Salomaa
Affiliations: | Queen's University, Canada, Kingston, Ontario, Canada |
Area:
Computer ScienceGoogle:
"Kai Salomaa"Children
Sign in to add trainee| Michael Domaratzki | grad student | 2004 | Queen's University, Canada |
| Alexander Okhotin | grad student | 2005 | Queen's University, Canada |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Han Y, Ko S, Ng T, et al. (2020) Closest Substring Problems for Regular Languages Theoretical Computer Science |
| Okhotin A, Salomaa K. (2019) State Complexity of the Quotient Operation on Input-Driven Pushdown Automata International Journal of Foundations of Computer Science. 30: 1217-1235 |
| Cho DJ, Han YS, Salomaa K, et al. (2019) Site-directed insertion: Language equations and decision problems Theoretical Computer Science. 798: 40-51 |
| Okhotin A, Salomaa K. (2019) Edit distance neighbourhoods of input-driven pushdown automata Theoretical Computer Science. 777: 417-430 |
| Han Y, Ko SK, Salomaa K. (2017) State Complexity of k-Parallel Tree Concatenation Fundamenta Informaticae. 154: 185-199 |
| Han Y, Salomaa A, Salomaa K. (2017) Ambiguity, nondeterminism and state complexity of finite automata Acta Cybernetica. 23: 141-157 |
| Palioudakis A, Salomaa K, Akl SG. (2017) Worst Case Branching and Other Measures of Nondeterminism International Journal of Foundations of Computer Science. 28: 195-210 |
| Cho DJ, Goč D, Han YS, et al. (2017) State complexity of permutation on finite languages over a binary alphabet Theoretical Computer Science. 682: 67-78 |
| Ng T, Rappaport D, Salomaa K. (2017) State complexity of prefix distance Theoretical Computer Science. 679: 107-117 |
| Han Y, Ko SK, Ng T, et al. (2016) State complexity of insertion International Journal of Foundations of Computer Science. 27: 863-878 |