Rogério Reis

2017
The Role of Theory in Computer Science: Essays Dedicated to Janusz Brzozowski. Konstantinidis S, Moreira N, Reis R, Shallit J, editors World Scientific 2017.
Gao Y, Moreira N, Reis R, Yu S. A Survey on Operational State Complexity. Journal of Automata, Languages and Combinatorics. 2017;21:251-310.
Broda S, Holzer M, Maia E, Moreira N, Reis R. On the Mother of All Automata: the Position Automaton. In: Developments in Language Theory.; 2017.
Broda S, Machiavelo A, Moreira N, Reis R. On the Average Complexity of Strong Star Normal Form. In: Pighizzini G, Câmpeanu C, editors. Description Complexity of Formal Systems (DCFS 2017). Vol 10316. Springer; 2017. 7. p. 77-88p. (LNCS; vol 10316).
Broda S, Machiavelo A, Reis R, Moreira N. Automata for Regular Expressions with Shuffle. Information and Computation. 2017.
Moreira N, Pighizzini G, Reis R. Optimal State Reductions of Automata with Partially Specified Behaviors. Theoretical Computer Science. 2017;658:235-245.
2016
Câmpeanu C, Moreira N, Reis R. On the Dissimilarity Operation on Finite Languages. In: Bordihn H, Freund R, Nagy B, Vaszil G, editors. Eighth Workshop on Non-Classical Models of Automata and Applications (NCMA 2016). Österreichische Computer Gesellschaft; 2016. 1. p. 105-120p.
Konstantinidis S, Moreira N, Reis R. Generating Error Control Codes With Automata and Transducers. In: Bordihn H, Freund R, Nagy B, Vaszil G, editors. Eighth Workshop on Non-Classical Models of Automata and Applications (NCMA 2016). Österreichische Computer Gesellschaft; 2016. 2. p. 211-226p.
Ferreira M, Moreira N, Reis R. Automata Serialization for Manipulation and Drawing. In: Mernik M, Leal JPaulo, Oliveira HGonçalo, editors. 5th Symposium on Languages, Applications and Technologies (SLATE'16). Vol 51. Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik; 2016. 1. p. 1-7p. (OpenAccess Series in Informatics (OASIcs); vol 51).
Bastos R, Broda S, Machiavelo A, Moreira N, Reis R. On the State Complexity of Partial Derivative Automata for Regular Expressions with Intersection. In: Proceedings of the 18th Int. Workshop on Descriptional Complexity of Formal Systems (DCFS16). Vol 9777. Springer; 2016. 4. p. 45-59p. (LNCS; vol 9777).
Konstantinidis S, Meijer C, Moreira N, Reis R. Implementation of Code Properties via Transducers. In: Implementation and Application of Automata, 21th International Conference (CIAA 2016).; 2016.
Reis R, Rodaro E. Ideal regular languages and strongly connected synchronizing automata. Theoretical Computer Science. 2016;653:97-107.
Câmpeanu C, Moreira N, Reis R. Distinguishability Operations and Closures. Fundamenta Informaticae. 2016;148:243-266.
Broda S, Machiavelo A, Moreira N, Reis R. Position automaton construction for regular expressions with intersection. In: Reutenauer C, Brlek S, editors. Developments in Language Theory - 20th International Conference, DLT 2016. Vol 9840. Springer; 2016. 5. p. 51-63p.
2015
Jurgensen H, Reis R. Preface. Special Issue - Descriptional Complexity of Formal Languages DCFS 2013. International Journal of Fundations of Computer Science. 2015;25(7):803-805.
Maia E, Moreira N, Reis R. Incomplete Transition Complexity on Finite and Infinite Regular Languages. Information and Computation. 2015;244:1-22.
Seventh Workshop on Non-Classical Models of Automata and Applications (NCMA 2015). Freund R, Holzer M, Moreira N, Reis R, editors Österreichische Computer Gesellschaft 2015.
Broda S, Machiavelo A, Moreira N., Reis R.. Average Size of Automata Constructions from Regular Expressions. Bulletin of the European Association for Theoretical Computer Science. 2015:167-192.
Machiavelo A, Reis R. Uma introdução (ingénua) à Criptografia. Garrão APaula, Dias MRaposo, Teixeira RCunha, editors Letras Lavadas Edições 2015.
Broda S, Machiavelo A, Moreira N, Reis R. Partial Derivative Automaton for Regular Expressions with Shuffle. In: Shallit J, Okhotin A, editors. Proceedings of the 17th Int. Workshop on Descriptional Complexity of Formal Systems (DCFS15). Springer; 2015. 2. p. 21-32p.
Moreira N, Pighizzini G, Reis R. Universal Disjunctive Concatenation and Star. Shallit J, Okhotin A, editors Springer 2015.
Maia E, Moreira N, Reis R. Prefix and Right-Partial Derivative Automata. In: Soskova M, Mitrana V, editors. Computability in Europe (CiE 2015). Springer; 2015. 2. p. 258-267p.
Amorim I, Machiavelo A, Reis R. On the number of linear finite transducers. International Journal of Foundations of Computer Science. 2015;26(7):873-893.
2014
Amorim I, Machiavelo A, Reis R. Statistical Study on The Number of Injective Linear Finite Transducers. In: Non-Classical Models of Automata and Applications (NCMA 2014). Germany, Kassel: books@ocg.at; 2014.
Câmpeanu C, Moreira N, Reis R. The Distinguishability Operation on Regular Languages. In: Non-Classical Models of Automata and Applications (NCMA 2014).; 2014.
Amorim I, Machiavelo A, Reis R. Counting Equivalent Linear Finite Transducers Using a Canonical Form. Holzer M, Kutrib M, editors Germany, Giessen: Springer 2014.
Broda S, Machiavelo A, Moreira N, Reis R. On the Equivalence of Automata for KAT-expressions. Vol 8493. Beckmann A, Csuhaj-Varjú E, Meer K, editors 2014.
Bell J, Brzozowski J, Moreira N, Reis R. Symmetric Groups and Quotient Complexity of Boolean Operations. Vol 8573. Esparza J, Fraigniaud P, Husfeldt T, Koutsoupias E, editors 2014.
Almeida M, Moreira N, Reis R. Incremental DFA Minimisation. RAIRO - Theoretical Informatics and Applications. 2014;48:173-186.
2013
Maia E, Moreira N, Reis R. Incomplete Transition Complexity of Basic Operations on Finite Languages. Konstantinidis S, editor 2013.
Moreira N, Reis R. Preface. Special Issue - Implementation and Application of Automata (CIAA 2012). International Journal of Fundations of Computer Science. 2013;24:689-690.
Broda S, Machiavelo A, Moreira N, Reis R. On the Average Size of Glushkov and Equation Automata for KAT Expressions 2013.
Maia E, Moreira N, Reis R. Incomplete Transition Complexity of some Basic Operations. Boas Pvan Emde, Groen FCA, Italiano GF, Nawrocki J, Sack H, editors 2013.
Reis R, Rodaro E. Reset Regular Decomposition Complexity of Regular Ideal Languages (extended Abstract). In: Proceedings of 14th Italian Conference on Theoretical Computer Science.; 2013. 3. p. 30-35p.
Reis R, Rodaro E. The Language of Initially Connected Deterministic Finite Automata (Extended Abstract). In: Proceedings of 14th Italian Conference on Theoretical Computer Science.; 2013. 1. p. 179-184p.
Broda S, Machiavelo A, Moreira N, Reis R. On the Average Size of Glushkov and Equation Automata for KAT Expressions. In: FCT. United Kingdom, Liverpool: Springer; 2013. 7. p. 72-83p.
Descriptional Complexity of Formal Systems, 15th International Workshop (DCFS 2013). Vol 8031. Jurgensen H, Reis R, editors Springer 2013.
Reis R, Rodaro E. Regular Ideal Languages and Synchronizing Automata. In: Combinatorics on Words, WORDS 2013. Vol LNCS, 8079.; 2013. 2. p. 205-216p.
Reis R, Rodaro E. Regular Ideal Languages and Synchronizing Automata. Karhumäki J, Zamboni L, editors 2013.
2012
Implementation and Application of Automata, 17th International Conference (CIAA 2012). Vol 7381. Moreira N, Reis R, editors Springer 2012.
Almeida M, Moreira N, Reis R. Finite automata minimization algorithms. Wang J, editor Chapman and Hall/CRC Press 2012.
Descriptional Complexity of Formal Systems, 14th International Workshop (DCFS 2012). Vol 7386. Kutrib M, Moreira N, Reis R, editors Springer 2012.
Broda S, Machiavelo A, Moreira N, Reis R. On the Average Size of Glushkov and Partial Derivative Automata. International Journal of Foundations of Computer Science. 2012;23:969-984.
2011
Almeida M, Moreira N, Reis R. Incremental DFA Minimisation. In: Domaratzki M, Salomaa K, editors. Proceedings of the 15th International Conference on Implementation and Application of Automata (CIAA 2010). Winnipeg, MA, Canada; 2011. 3. p. 39-48p.
Broda S, Machiavelo A, Moreira N, Reis R. On the Average State Complexity of Partial Derivative Automata: an analytic combinatorics approach. International Journal of Foundations of Computer Science. 2011;22:1593-1606.
Broda S, Machiavelo A, Moreira N, Reis R. The Average Transition Complexity of Glushkov and Partial Derivative Automata. In: Mauri G., Leporati A., editors. Developments in Language Theory, 15th International Conference, DLT 2011, Milano, Italy, July 2011. Proceedings. Vol 6795. Milano, Italy; 2011. 9. p. 93-104p.
2007
Machiavelo A, Reis R. Automated Ciphertext-Only Cryptanalysis of the Bifid Cipher. Cryptologia. 2007;31(2):112-124.