( en | de | ru )

 

Disambiguation of "Salomaa, Kai"

Author of the publication

copydeleteadd this publication to your clipboard
State Complexity of Suffix Distance.

, , and . DCFS, volume 10316 of Lecture Notes in Computer Science, page 287-298. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kai-Kai Shen

Kai Zehmisch

Singularities and self-intersections of holomorphic discs. Uni Leipzig, (2009)

Kai Schöneboom

Analyse und Vergleich der Anwendung von alter und neuer TASC-Klassifikation auf das Akutergebnis der interventionellen Behandlung der peripheren arteriellen Verschlusskrankheit. TU Aachen, (2009)

Kai Städing

Signalmoleküle in der Regulation des Aktinzytoskeletts: die Rolle von Nck bei WAVE-vermittelten Prozessen. TU Braunschweig, (2009)

Kai Kratt

 

Other publications of authors with the same name

Confluence, ground confluence, and termination of monadic term rewriting systems.. Elektronische Informationsverarbeitung und Kybernetik, 28 (5): 279-309 (1992)Localized algorithms for redundant readers elimination in RFID networks., , and . IJPEDS, 34 (3): 260-271 (2019)Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof., and . Theory Is Forever, volume 3113 of Lecture Notes in Computer Science, page 259-267. Springer, (2004)Unary NFAs with Limited Nondeterminism., , and . SOFSEM, volume 8327 of Lecture Notes in Computer Science, page 443-454. Springer, (2014)Quasi-Distances and Weighted Finite Automata., , and . DCFS, volume 9118 of Lecture Notes in Computer Science, page 209-219. Springer, (2015)The Length of the Beacon Attraction Trajectory., , and . CCCG, page 69-74. Simon Fraser University, Vancouver, British Columbia, Canada, (2016)Alternating Finite Automata with Limited Universal Branching., and . LATA, volume 12038 of Lecture Notes in Computer Science, page 196-207. Springer, (2020)State Complexity of Combined Operations for Prefix-Free Regular Languages., , , and . Discrete Mathematics and Computer Science, page 137-151. The Publishing House of the Romanian Academy, (2014)Structural Equivalences and ET0L Grammars (Extended Abstract)., , and . FCT, volume 710 of Lecture Notes in Computer Science, page 430-439. Springer, (1993)State Complexity of Combined Operations for Prefix-Free Regular Languages., , and . LATA, volume 5457 of Lecture Notes in Computer Science, page 398-409. Springer, (2009)