Essays Dedicated to Kai Salomaa to Celebrate His Scientific Career
Buch, Englisch, Format (B × H): 155 mm x 235 mm
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-032-47281-6
Verlag: Springer
Kai Salomaa earned his PhD from the University of Turku in 1989 under the supervision of Magnus Steinby and Ronald Book, after taking the opportunity to study in the US in the 1980s under a Fulbright scholarship. He took up a position at the University of Western Ontario in the 1990s, and he has been at Queen’s University since 2000, where he is a professor in the School of Computing. He is an internationally recognized subject expert in the field of automata theory, with a specific focus on descriptional and state complexity. He has chaired and served on the Program Committees and Steering Committees for the major conferences in the fields of automata theory, formal languages, and computability for decades. In 2017, he was elected as an external member of the Finnish Academy of Science and Letters.
A key feature of Kai Salomaa’s research work is collaboration: in particular, he has coauthored conference papers and journal articles with over 70 computer scientists and mathematicians from North America, Europe and Asia during his career. In 2024, he was awarded the Queen’s University Award for Excellence in Graduate Student Supervision. Many of these collaborators and students were pleased to share their research successes in this volume.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
SemInspect: Automating Drone Inspection with Schema-Constrained LLMs and Semantic Encoding.- Unconventional Computation and the Mythical Universal Computer.- Partial Derivatives for Boolean Products and Average Complexity of Multiple Intersections.- State Complexity of Rim and Side Operation Induced by the Star Ending Closure Operator.- On Pumping Constants and Smallest Grammars for Context-Free Languages, Part III—Double Greibach Normal Form.- Resetting Stores on Machine Models.- Minimality, transitivity and sensitivity of non-uniform cellular automata.- Generating all Watson-Crick powers of a word.- On some Contributions of Kai Salomaa to the Theory of Independent Formal Languages.- Reversible Extended Finite Automata.- On the number of stack symbols in nondeterministic and unambiguous input-driven pushdown automata.- The Tribonacci constant and finite automata.- A compact representation of extended regular expressions.- Q-GARS: Quantum-inspired Guidance Adaptive Robust Microservice Chaining Scheduling.
