( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Alternating Finite Automata with Limited Universal Branching.

, и . LATA, том 12038 из Lecture Notes in Computer Science, стр. 196-207. Springer, (2020)

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.

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 Priebe

 

Другие публикации лиц с тем же именем

Confluence, ground confluence, and termination of monadic term rewriting systems.. Elektronische Informationsverarbeitung und Kybernetik, 28 (5): 279-309 (1992)State Complexity of Shuffle on Trajectories., и . DCFS, Report No. 586, стр. 95-109. Department of Computer Science, The University of Western Ontario, Canada, (2002)State Complexity of Orthogonal Catenation., , и . DCFS, стр. 134-144. University of Prince Edward Island, (2008)An Infinite Hierarchy Induced by Depth Synchronization., , и . DCFS, стр. 82-93. New Mexico State University, Las Cruces, New Mexico, USA, (2006)A Cryptosystem Based on the Composition of Reversible Cellular Automata., и . LATA, том 5457 из Lecture Notes in Computer Science, стр. 314-325. Springer, (2009)Preface., и . Int. J. Found. Comput. Sci., 28 (5): 437-440 (2017)Nondeterminism Degrees for Context-Free Languages., и . Developments in Language Theory, стр. 154-165. World Scientific, Singapore, (1995)Complexity of input-driven pushdown automata., и . SIGACT News, 45 (2): 47-67 (2014)Decidability of Confluence and Termination of Monadic Term Rewriting Systems.. RTA, том 488 из Lecture Notes in Computer Science, стр. 275-286. Springer, (1991)State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism., , и . DCFS, том 8614 из Lecture Notes in Computer Science, стр. 330-341. Springer, (2014)