( en | de | ru )

 

Disambiguation of "Reis, Rogério"

Author of the publication

copydeleteadd this publication to your clipboard
On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection.

, , , , and . DCFS, volume 9777 of Lecture Notes in Computer Science, page 45-59. 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. You can also use the button next to the name to display some publications already assigned to the person.

Rogério Mugnaini

Rogério Craveiro

Rogério Richa

Rogério Rossi

Rogério Chaves Vieira

 

Other publications of authors with the same name

The Computational Power of Parsing Expression Grammars., , and . DLT, volume 11088 of Lecture Notes in Computer Science, page 491-502. Springer, (2018)Automated Ciphertext - Only Cryptanalysis of the Bifid Cipher., and . Cryptologia, 31 (2): 112-124 (2007)A Hitchhiker's Guide to descriptional complexity through analytic combinatorics., , , and . Theor. Comput. Sci., (2014)Partial Derivative Automaton for Regular Expressions with Shuffle., , , and . CoRR, (2015)Incremental DFA minimisation., , and . RAIRO Theor. Informatics Appl., 48 (2): 173-186 (2014)On the invertibility of finite linear transducers., , and . RAIRO Theor. Informatics Appl., 48 (1): 107-125 (2014)Testing the Equivalence of Regular Languages., , and . Journal of Automata, Languages and Combinatorics, 15 (1/2): 7-25 (2010)Statistical Study On The Number Of Injective Linear Finite Transducers., , and . CoRR, (2014)Guest Column: Analytic Combinatorics and Descriptional Complexity of Regular Languages on Average., , , and . SIGACT News, 51 (1): 38-56 (2020)Partial Derivative Automaton by Compressing Regular Expressions., , , and . DCFS, volume 13037 of Lecture Notes in Computer Science, page 100-112. Springer, (2021)