( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Location automata for regular expressions with shuffle and intersection.

, , , и . Inf. Comput., 295 (Part B): 104917 (декабря 2023)

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.

Rogério Mugnaini

Rogério Craveiro

Rogério Richa

Rogério Rossi

Rogério Chaves Vieira

 

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

Testing the Equivalence of Regular Languages., , и . Journal of Automata, Languages and Combinatorics, 15 (1/2): 7-25 (2010)The Computational Power of Parsing Expression Grammars., , и . DLT, том 11088 из Lecture Notes in Computer Science, стр. 491-502. Springer, (2018)Statistical Study On The Number Of Injective Linear Finite Transducers., , и . CoRR, (2014)Partial Derivative Automaton by Compressing Regular Expressions., , , и . DCFS, том 13037 из Lecture Notes in Computer Science, стр. 100-112. Springer, (2021)Partial Derivative Automaton for Regular Expressions with Shuffle., , , и . DCFS, том 9118 из Lecture Notes in Computer Science, стр. 21-32. Springer, (2015)Approximate NFA universality and related problems motivated by information theory., , , и . Theor. Comput. Sci., (сентября 2023)On the average complexity of partial derivative transducers., , , и . Theor. Comput. Sci., (мая 2023)Incremental DFA Minimisation., , и . CIAA, том 6482 из Lecture Notes in Computer Science, стр. 39-48. Springer, (2010)Automata for regular expressions with shuffle., , , и . Inf. Comput., 259 (2): 162-173 (2018)Position Automaton Construction for Regular Expressions with Intersection., , , и . DLT, том 9840 из Lecture Notes in Computer Science, стр. 51-63. Springer, (2016)