( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Square, Power, Positive Closure, and Complementation on Star-Free Languages.

, и . DCFS, том 11612 из Lecture Notes in Computer Science, стр. 98-110. Springer, (2019)

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.

Michal Pejko

Michal Olszewski

Michal Hlavá

Michal Nounou

Michal Benko

 

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

Nondeterministic Complexity of Operations on Free and Convex Languages., , и . CIAA, том 10329 из Lecture Notes in Computer Science, стр. 138-150. Springer, (2017)Operations on Subregular Languages and Nondeterministic State Complexity., , и . DCFS, том 13439 из Lecture Notes in Computer Science, стр. 112-126. Springer, (2022)The Cut Operation in Subclasses of Convex Languages (Extended Abstract)., и . CIAA, том 13266 из Lecture Notes in Computer Science, стр. 152-164. Springer, (2022)Nondeterministic Complexity of Operations on Closed and Ideal Languages., , и . CIAA, том 9705 из Lecture Notes in Computer Science, стр. 125-137. Springer, (2016)The Ranges of Accepting State Complexities of Languages Resulting from Some Operations., и . Int. J. Found. Comput. Sci., 31 (8): 1159-1177 (2020)Operational Complexity in Subregular Classes., и . CIAA, том 14151 из Lecture Notes in Computer Science, стр. 153-165. Springer, (2023)On the Descriptive Complexity of $$\varSigma ^*øverlineL$$., , и . DLT, том 10396 из Lecture Notes in Computer Science, стр. 222-234. Springer, (2017)Nondeterministic complexity in subclasses of convex languages., , и . Theor. Comput. Sci., (2019)The Range of State Complexities of Languages Resulting from the Cut Operation., и . LATA, том 11417 из Lecture Notes in Computer Science, стр. 190-202. Springer, (2019)Operational Complexity: NFA-to-DFA Trade-Off., , , и . DCFS, том 13918 из Lecture Notes in Computer Science, стр. 79-93. Springer, (2023)