( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Kuratowski Algebras Generated by Prefix-Free Languages.

, и . CIAA, том 9705 из Lecture Notes in Computer Science, стр. 150-162. Springer, (2016)

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.

Juraj Kukolja

Juraj Kukolja

Juraj Böhm

Juraj Koza

Juraj Mészáro

 

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

Kuratowski Algebras Generated by Prefix-Free Languages., и . CIAA, том 9705 из Lecture Notes in Computer Science, стр. 150-162. Springer, (2016)Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations., , и . CIAA, том 11601 из Lecture Notes in Computer Science, стр. 171-183. Springer, (2019)Operations on Unambiguous Finite Automata., , и . DLT, том 9840 из Lecture Notes in Computer Science, стр. 243-255. Springer, (2016)Note on Reversal of Binary Regular Languages., и . DCFS, том 6808 из Lecture Notes in Computer Science, стр. 212-221. Springer, (2011)Prefix-Free Subsets of Regular Languages and Descriptional Complexity., и . DCFS, том 9118 из Lecture Notes in Computer Science, стр. 129-140. Springer, (2015)The Complexity of Languages Resulting from the Concatenation Operation., , и . DCFS, том 9777 из Lecture Notes in Computer Science, стр. 153-167. Springer, (2016)Reversal of regular languages and state complexity.. ITAT, том 683 из CEUR Workshop Proceedings, стр. 47-54. CEUR-WS.org, (2010)Kleene Closure on Regular and Prefix-Free Languages., , и . CIAA, том 8587 из Lecture Notes in Computer Science, стр. 226-237. Springer, (2014)Reversal on Regular Languages and Descriptional Complexity.. DCFS, том 8031 из Lecture Notes in Computer Science, стр. 265-276. Springer, (2013)Star-Complement-Star on Prefix-Free Languages., и . DCFS, том 9118 из Lecture Notes in Computer Science, стр. 231-242. Springer, (2015)