Publications

[155] Sabine Broda, António Machiavelo Nelma Moreira, and Rogério Reis. Automata for regular expressions with shuffle. Information and Computation, 259:162--173, 2018. [ DOI | .pdf | Abstract ]
[154] Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. Position automata for semi-extended expressions. Journal of Automata, Languages and Combinatorics, 23(1--3):39--65, 2018. [ DOI | .pdf | Abstract ]
[153] Stavros Konstantinidis, Casey Meijer, Nelma Moreira, and Rogério Reis. Symbolic manipulation of code properties. Journal of Automata, Languages and Combinatorics, 23(1--3):243--269, 2018. [ DOI | .pdf | Abstract ]
[152] Miguel Ferreira, Nelma Moreira, and Rogério Reis. Forward injective finite automata: Exact and random generation of nonisomorphic nfas. In Stavros Konstantinidis and Giovanni Pighizzini, editors, Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Halifax, NS, Canada, July 25-27, 2018, Proceedings, volume 10952 of Lecture Notes in Computer Science, pages 88--100. Springer, 2018. [ DOI | .pdf | Abstract ]
[151] Bruno Loff, Nelma Moreira, and Rogério Reis. The Computational Power of Parsing Expression Grammars. In Mizuho Hoshi and Shinnosuke Seki, editors, Developments in Language Theory - 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings, volume 11088 of Lecture Notes in Computer Science, pages 491--502, 2018. [ Abstract ]
[150] Stavros Konstantinidis, Nelma Moreira, Rogério Reis, and Joshua Young. Regular expressions and transducers over alphabet-invariant and user-defined labels. In Cezar Câmpeanu, editor, Implementation and Application of Automata - 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 - August 2, 2018, Proceedings, volume 10977 of Lecture Notes in Computer Science, pages 4--27. Springer, 2018. [ DOI | http | Abstract ]
[149] Nelma Moreira, Giovanni Pighizzini, and Rogério Reis. Optimal state reductions of automata with partially specified behaviors. Theoretical Computer Science, 658:235--245, January 2017. [ DOI | .pdf | Abstract ]
[148] Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. On the average complexity of strong star normal form. In Cezar Câmpeanu and Giovanni Pighizzini, editors, Description Complexity of Formal Systems (DCFS 2017), volume 10316 of LNCS, pages 77--88. Springer, 2017. [ DOI | .pdf | Abstract ]
[147] Yuan Gao, Nelma Moreira, Rogério Reis, and Sheng Yu. A survey on operational state complexity. Journal of Automata, Languages and Combinatorics, 21(4):251--310, 2017. [ DOI | .pdf | Abstract ]
[146] Stavros Konstantinidis, Nelma Moreira, Rogério Reis, and Jeffrey Shallit, editors. The Role of Theory in Computer Science: Essays Dedicated to Janusz Brzozowski. World Scientific, 2017. ISBN 978-981-3148-19-2. [ http ]
[145] Sabine Broda, Markus Holzer, Eva Maia, Nelma Moreira, and Rogério Reis. On the mother of all automata: The position automaton. In Émilie Charlier, Julien Leroy, and Michel Rigo, editors, 21st DLT 2017, volume 10396 of LNCS, pages 134--146. Springer, 2017. [ DOI | .pdf | Abstract ]
[144] Rafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. On the state complexity of partial derivative automata for semi-extended expressions. Journal of Automata, Languages and Combinatorics, 22(1-3):5--28, 2017. [ DOI | .pdf | Abstract ]
[143] Stavros Konstantinidis, Nelma Moreira, and Rogério Reis. Channels with synchronization/substitution errors and computation of error control codes. Preprint, 2016. [ http | Abstract ]
[142] Rafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. 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), volume 9777 of LNCS, pages 45--59. Springer, 2016. [ DOI | .pdf | Abstract ]
[141] Stavros Konstantinidis, Casey Meijer, Nelma Moreira, and Rogério Reis. Implementation of code properties via transducers. In Implementation and Application of Automata, 21th International Conference (CIAA 2016), 2016. [ DOI | .pdf | Abstract ]
[140] Marcus Ramos, Ruy De Queiroz, Nelma Moreira, and José Bacelar Almeida. On the formalization of some results of context-free language theory. In Jouko A. Väänänen, Åsa Hirvonen, and Ruy J. G. B. de Queiroz, editors, Workshop on Logic, Language, Information and Computation (WoLLIC 2016), volume 9803 of LNCS, pages 338--357. Springer, 2016. [ DOI | Abstract ]
[139] Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. Position automaton construction for regular expressions with intersection. In Srecko Brlek and Christophe Reutenauer, editors, Developments in Language Theory - 20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings, volume 9840, pages 51--63, 2016. [ DOI | .pdf | Abstract ]
[138] Miguel Ferreira, Nelma Moreira, and Rogério Reis. Automata Serialization for Manipulation and Drawing. In Marjan Mernik, José Paulo Leal, and Hugo Gonçalo Oliveira, editors, 5th Symposium on Languages, Applications and Technologies (SLATE'16), volume 51 of OpenAccess Series in Informatics (OASIcs), pages 1--7, Dagstuhl, Germany, 2016. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. [ DOI | http | Abstract ]
[137] Stavros Konstantinidis, Nelma Moreira, and Rogério Reis. Generating error control codes with automata and transducers. In Henning Bordihn, Rudolf Freund, Benedek Nagy, and György Vaszil, editors, Eighth Workshop on Non-Classical Models of Automata and Applications (NCMA 2016), volume 321, pages 211--226. Österreichische Computer Gesellschaft, 2016. [ .pdf | Abstract ]
[136] Cezar Câmpeanu, Nelma Moreira, and Rogério Reis. On the dissimilarity operation on finite languages. In Henning Bordihn, Rudolf Freund, Benedek Nagy, and György Vaszil, editors, Eighth Workshop on Non-Classical Models of Automata and Applications (NCMA 2016), volume 321, pages 105--120. Österreichische Computer Gesellschaft, 2016. [ .pdf | Abstract ]
[135] Marcus Vinícius Midena Ramos, José Carlos Bacelar Almeida, Nelma Moreira, and Ruy José Guerra Barretto de Queiroz. Formalization of the pumping lemma for context-free languages. J. Formalized Reasoning, 9(2):53--68, 2016. [ DOI | http | Abstract ]
[134] Cezar Câmpeanu, Nelma Moreira, and Rogério Reis. Distinguishability operations and closures. Fundamenta Informaticae, 148(3--4):243--266, 2016. [ DOI | .pdf | Abstract ]
[133] Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. Average size of automata constructions from regular expressions. Bulletin of the European Association for Theoretical Computer Science, 116:167--192, June 2015. [ http | Abstract ]
[132] Nelma Moreira, David Pereira, and Sim ao Melo de Sousa. Deciding Kleene algebra terms (in)equivalence in Coq. Journal of Logical and Algebraic Methods in Programming, 84(3):377--401, 2015. [ DOI | Abstract ]
[131] Nelma Moreira, Giovanni Pighizzini, and Rogério Reis. Optimal state reductions of automata with partially specified behaviors. In 41st SOFSEM - the International Conference on Current Trends in Theory and Practice of Computer Science, number 8939 in LNCS, pages 339--351. Springer, 2015. [ DOI | http | Abstract ]
[130] Eva Maia, Nelma Moreira, and Rogério Reis. Prefix and right-partial derivative automata. In Mariya Soskova and Victor Mitrana, editors, Computability in Europe (CiE 2015), number 9136 in LNCS, pages 258--267. Springer, 2015. [ DOI | .pdf | Abstract ]
[129] Nelma Moreira, Giovanni Pighizzini, and Rogério Reis. Universal disjunctive concatenation and star. In Jeffrey Shallit and Alexander Okhotin, editors, Proceedings of the 17th Int. Workshop on Descriptional Complexity of Formal Systems (DCFS15), number 9118 in LNCS, pages 197--208. Springer, 2015. [ DOI | http | Abstract ]
[128] Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. Partial derivative automaton for regular expressions with shuffle. In Jeffrey Shallit and Alexander Okhotin, editors, Proceedings of the 17th Int. Workshop on Descriptional Complexity of Formal Systems (DCFS15), number 9118 in LNCS, pages 21--32. Springer, 2015. [ DOI | http | Abstract ]
[127] Stavros Konstantinidis, Casey Meijer, Nelma Moreira, and Rogério Reis. Symbolic manipulation of code properties. Preprint, 2015. [ http | Abstract ]
[126] Sabine Broda, Sílvia Cavadas, Miguel Ferreira, and Nelma Moreira. Deciding synchronous kleene algebra with derivatives. In Frank Drewes, editor, Implementation and Application of Automata, 20th International Conference (CIAA 2015), volume 9223 of LNCS, pages 49--62. Springer-Verlag, 2015. [ DOI | .pdf | Abstract ]
[125] Eva Maia, Nelma Moreira, and Rogério Reis. Incomplete transition complexity on finite and infinite regular languages. Information and Computation, 244:1--22, 2015. [ DOI | http | Abstract ]
[124] Rudolf Freund, Markus Holzer, Nelma Moreira, and Rogério Reis, editors. Seventh Workshop on Non-Classical Models of Automata and Applications (NCMA 2015). Österreichische Computer Gesellschaft, 2015. ISBN 978-3-903035-07-2.
[123] Marcus V. M. Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira, and José Carlos Bacelar Almeida. Formalization of the pumping lemma for context-free languages. Preprint, 2015. [ http | Abstract ]
[122] Marcus V. M. Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira, and José Carlos Bacelar Almeida. Formalization of context-free language theory. Preprint, 2015. [ http | Abstract ]
[121] Sabine Broda, Sílvia Cavadas, and Nelma Moreira. Kleene algebra completeness. Technical Report DCC-2014-07, DCC-FC & CMUP, Universidade do Porto, July 2014. [ .pdf ]
[120] Sabine Broda, Sílvia Cavadas, and Nelma Moreira. Derivative based methods for deciding ska and skat. Technical Report DCC-2014-10, DCC-FC & CMUP, Universidade do Porto, May 2014. [ .pdf ]
[119] Marco Almeida, Nelma Moreira, and Rogério Reis. Incremental dfa minimisation. RAIRO - Theoretical Informatics and Applications, 48(2):173--186, 2014. [ DOI | http | Abstract ]
[118] Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. A hitchhiker's guide to descriptional complexity through analytic combinatorics. Theoretical Computer Science, 528(0):85 -- 100, 2014. [ DOI | http | Abstract ]
[117] Jason Bell, Janusz Brzozowski, Nelma Moreira, and Rogério Reis. Symmetric groups and quotient complexity of boolean operations. In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias, editors, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, volume 8573 of Lecture Notes on Computer Science, pages 1--12, 2014. [ DOI | .pdf | Abstract ]
[116] Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. Automata for KAT Expressions. Technical Report DCC-2014-01, DCC-FC, Universidade do Porto, January 2014. [ .pdf ]
[115] Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. On the Equivalence of Automata for KAT-expressions. In Arnold Beckmann, Erzsébet Csuhaj-Varjú, and Klaus Meer, editors, Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings, volume 8493 of LNCS, pages 73--83. Springer-Verlag, 2014. [ DOI | .pdf | Abstract ]
[114] Eva Maia, Nelma Moreira, and Rogério Reis. Partial derivative and position bisimilarity automata. In Markus Holzer and Martin Kutrib, editors, Implementation and Application of Automata, 19th International Conference (CIAA 2014), volume 8587 of LNCS, pages 264--277. Springer-Verlag, 2014. [ DOI | .pdf | Abstract ]
[113] Cezar Câmpeanu, Nelma Moreira, and Rogério Reis. The distinguishability operation on regular languages. In Suna Bensch, Rudolf Freund, and Friedrich Otto, editors, Non-Classical Models of Automata and Applications (NCMA 2014), pages 85--100. Oesterreichische Computer Gesellschaft, 2014. [ .pdf | Abstract ]
[112] Nelma Moreira and Rogério Reis. Preface. Special Issue - Implementation and Application of Automata (CIAA 2012). International Journal of Fundations of Computer Science, 24(06):689--690, September 2013. [ DOI ]
[111] Rafaela Bastos, Nelma Moreira, and Rogério Reis. Manipulation of extended regular expressions with derivatives. Technical Report DCC-2013-11, DCC-FC, Universidade do Porto, September 2013. [ .pdf ]
[110] Davide Nabais, Nelma Moreira, and Rogério Reis. Desco: a knowledge based system for descriptional complexity of formal languages. Technical Report DCC-2013-12, DCC-FC Universidade do Porto, July 2013. [ .pdf ]
[109] Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. Glushkov and Equation Automata for KAT Expressions. Technical Report DCC-2013-07, DCC-FC, Universidade do Porto, July 2013. [ .pdf ]
[108] Ricardo Almeida, Sabine Broda, and Nelma Moreira. Kat and Hoare logic with derivatives. Technical Report DCC-2013-04, DCC - FC & CMUP, Universidade do Porto, February 2013. [ .pdf ]
[107] Nelma Moreira, Davide Nabais, and Rogério Reis. Desco: a web based information system for descriptional complexity results. Technical Report DCC-2013-03, DCC-FC, Universidade do Porto, 2013. [ .pdf ]
[106] Nelma Moreira, David Pereira, and Sim ao Melo de Sousa. On the mechanisation of rely-guarantee in Coq. Technical Report DCC-2013-03, DCC - FC & LIACC, Universidade do Porto, January 2013. [ .pdf | Abstract ]
[105] Eva Maia, Nelma Moreira, and Rogério Reis. Incomplete transition complexity of some basic operations. In Peter van Emde Boas, Frans C.A. Groen, Giuseppe F. Italiano, Jerzy Nawrocki, and Harald Sack, editors, SOFSEM 2013: Theory and Practice of Computer Science, number 7741 in Lecture Notes on Computer Science, pages 319--330. Springer-Verlag, 2013. MR3074101. [ DOI | .pdf | Abstract ]
[104] Eva Maia, Nelma Moreira, and Rogério Reis. Incomplete transition complexity of basic operations on finite languages. In Stavros Konstantinidis, editor, Implementation and Application of Automata, 18th International Conference (CIAA 2013), number 7982 in LNCS, pages 349--356. Springer-Verlag, 2013. [ DOI | .pdf | Abstract ]
[103] Eva Maia, Nelma Moreira, and Rogério Reis. The operational incomplete transition complexity on finite languages. Technical Report DCC-2013-02, DCC - FC & CMUP, Universidade do Porto, January 2013. [ .pdf ]
[102] Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. On the average size of Glushkov and equation automata for KAT expressions. In 19th International Symposium on Fundamentals of Computation Theory, number 8070 in LNCS, pages 72--83. Springer-Verlag, 2013. [ DOI | .pdf | Abstract ]
[101] Yuan Gao, Nelma Moreira, Rogério Reis, and Sheng Yu. A survey on state complexity. (Submitted), 2013. [ http ]
[100] Marco Almeida, Nelma Moreira, and Rogério Reis. Finite automata minimization algorithms. In Jiacun Wang, editor, Handbook of Finite State Based Models and Applications, Discrete Mathematics and Its Applications, pages 145--170. Chapman and Hall/CRC Press, November 2012. MR3014621. [ http ]
[99] Ricardo Almeida, Sabine Broda, and Nelma Moreira. Deciding KAT and Hoare logic with derivatives. In 3rd International Symposium on Games, Automata, Logics, and Formal Verification, Proceedings, volume 96, page 127?140, Napoli, Italy, September 2012. Electronic Proceedings in Theoretical Computer Science. [ DOI | .pdf | Abstract ]
[98] Martin Kutrib, Nelma Moreira, and Rogério Reis, editors. Descriptional Complexity of Formal Systems, 14th International Workshop (DCFS 2012), volume 7386 of LNCS, Braga, Portugal, July 2012. Springer. ISBN 978-3-642-31622-7. MR3087301. [ DOI | http ]
[97] Nelma Moreira and Rogério Reis, editors. Implementation and Application of Automata, 17th International Conference (CIAA 2012), volume 7381 of LNCS, Porto, Portugal, July 2012. Springer. ISBN 978-3-642-31605-0. MR3059553. [ DOI | http ]
[96] Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. An introduction to descriptional complexity of regular languages through analytic combinatorics. Technical Report DCC-2012-05, DCC - FC, Universidade do Porto, July 2012. [ .pdf ]
[95] Nelma Moreira, David Pereira, and Sim ao Melo de Sousa. Mechanization of an algorithm for deciding KAT terms equivalence. Technical Report DCC-2012-04, DCC-FC, Universidade do Porto, May 2012. [ .pdf ]
[94] Eva Maia, Nelma Moreira, and Rogério Reis. On the incomplete transition complexity of some basic operations on regular languages. Technical Report DCC-2012-02, DCC-FC, Universidade do Porto, April 2012. [ .pdf ]
[93] Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. On the average size of Glushkov and partial derivative automata. International Journal of Foundations of Computer Science, 23(5):969--984, 2012. MR2983363. [ DOI | .pdf | Abstract ]
[92] David Pereira Nelma Moreira and Sim ao Melo de Sousa. Deciding regular expressions (in-)equivalence in Coq. In T. G. Griffin and W. Kahl, editors, 13th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS 13). Proceedings, volume 7560 of Lecture Notes on Computer Science, pages 98--113. Springer-Verlag, 2012. MR3040160. [ DOI | .pdf | Abstract ]
[91] Jürgen Dassow, Martin Kutrib, Nelma Moreira, and Rogério Reis. Preface. Selected papers of DCFS 2012. Journal of Automata, Languages and Combinatorics, 17(2--4):59--60, 2012. [ .html ]
[90] Rizó Isrof, Nelma Moreira, and Rogério Reis. GUITAR: Graphical User Interface Tool for Automata Representation. In Actas do IJUP. Universidade do Porto, 2012. [ .pdf ]
[89] Yuan Gao, Nelma Moreira, Rogério Reis, and Sheng Yu. A review on state complexity of individual operations. Technical Report dcc-2011-08, DCC - FC, Universidade do Porto,, December 2011. [ .pdf ]
[88] José Bacelar Almeida, Nelma Moreira, David Pereira, and Sim ao Melo de Sousa. Partial derivative automata formalized in Coq. In Michael Domaratzki and Kai Salomaa, editors, Proceedings of the 15th International Conference on Implementation and Application of Automata (CIAA 2010), number 6482 in Lecture Notes on Computer Science, pages 59--68, Winnipeg, MA, Canada, August 2011. Springer-Verlag. MR2776277. [ DOI | .pdf | Abstract ]
[87] Marco Almeida, Nelma Moreira, and Rogério Reis. Incremental dfa minimisation. In Michael Domaratzki and Kai Salomaa, editors, Proceedings of the 15th International Conference on Implementation and Application of Automata (CIAA 2010), number 6482 in Lecture Notes on Computer Science, pages 39--48, Winnipeg, MA, Canada, August 2011. Springer-Verlag. MR2776275. [ DOI | .pdf ]
[86] Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. The average transition complexity of Glushkov and partial derivative automata. In G. Mauri and A. Leporati, editors, Developments in Language Theory, 15th International Conference, DLT 2011, Milano, Italy, July 2011. Proceedings, volume 6795 of Lecture Notes on Computer Science, pages 93--104, Milano, Italy, July 2011. Springer-Verlag. MR2862718. [ DOI | .pdf | Abstract ]
[85] Nelma Moreira, Davide Nabais, and Rogério Reis. DesCo: a web based information system for descriptional complexity results. Technical Report DCC-2011-10, DCC-FC, Universidade do Porto, 2011. [ .pdf ]
[84] Nelma Moreira, David Pereira, and Sim ao Melo de Sousa. Deciding regular expressions (in-)equivalence in coq. Technical Report DCC-2011-06, DCC-FC, Universidade do Porto, 2011.
[83] Eva Maia, Nelma Moreira, and Rogério Reis. A static type inference for Python. In Proc. of DYLA'11, 5th Workshop on Dynamic Languages and Applications, co-located with 49th Intl Conf on Objects, Models, Components and Patterns (TOOLS 2011) July 1, 2011, Zürich, Switzerland, 2011. [ .pdf | Abstract ]
[82] Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. On the average state complexity of partial derivative automata: an analytic combinatorics approach. International Journal of Foundations of Computer Science, 22(7):1593--1606, 2011. MR2865339. [ DOI | .pdf | Abstract ]
[81] Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. Study of the average size of Glushkov and partial derivative automata. Technical Report DCC-2011-03, DCC-FC, Universidade do Porto, 2011. [ .pdf ]
[80] Cezar Câmpeanu, Nelma Moreira, and Rogério Reis. Expected compression ratio for dfca: experimental average case. Technical Report DCC-2011-07, DCC-FC, Universidade do Porto, January 2011. [ .pdf | Abstract ]
[79] André Almeida, Nelma Moreira, and Rogério Reis. GUItar and FAgoo: Graphical interface for automata visualization, editing, and interaction. In Luís S. Barbosa and Miguel P. Correia, editors, Inforum, Simpósio de Informática, pages 317--328, Braga, Portugal, September 2010.
[78] Eva Maia, Nelma Moreira, and Rogério Reis. Inferência de tipos em Python. In Luís S. Barbosa and Miguel P. Correia, editors, Inforum, Simpósio de Informática, pages 515--518, Braga,Portugal, September 2010. Also at http://inforum.org.pt/INForum2010/papers/especificacao-verificacao-e-teste-sistemas-criticos/Paper040.pdf. [ .pdf ]
[77] André Almeida, Nelma Moreira, and Rogério Reis. GUItar and FAgoo: Graphical interface for automata visualization, editing, and interaction. In Luís S. Barbosa and Miguel P. Correia, editors, Inforum, Simpósio de Informática, pages 317--328, Braga,Portugal, September 2010. Also at http://inforum.org.pt/INForum2010/papers/computacao-grafica/Paper038.pdf. [ .pdf | Abstract ]
[76] Nelma Moreira, Davide Nabais, and Rogério Reis. State elimination ordering strategies: Some experimental results. In I. MacQuillan, G. Pighizzini, and B. Trost, editors, Proc. of 11th Workshop on Descriptional Complexity of Formal Systems (DCFS10), pages 169--180, Saskatoon, Saskatchewan,Canada, August 2010. [ DOI | .pdf | Abstract ]
[75] Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. On the average number of states of partial derivative automata. In Yuan Gao, Hanlin Lu, Shinnosuke Seki, and Sheng Yu, editors, Developments in Language Theory, 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010. Proceedings, volume 6224 of Lecture Notes on Computer Science, pages 112--123, London, ON, Canada, August 2010. Springer-Verlag. MR2725637. [ DOI | .pdf | Abstract ]
[74] Hugo Gouveia, Nelma Moreira, and Rogério Reis. Small nfas from regular expressions: Some experimental results. In Fernando Ferreira, Hélia Guerra, Elvira Mayordomo, and Jo ao Rasga, editors, Proceedings of 6th Conference on Computability in Europe (CIE 2010), pages 194--203, Ponta Delgada, Azores, Portugal, June 2010. CMATI. Also at ArXiv: http://arxiv.org/abs/1009.3599. [ .pdf | Abstract ]
[73] André Carvalho, Nuno Silva, Sim ao Melo de Sousa, and Nelma Moreira. A tool for automatic model extraction of Ada/SPARK programs. Technical Report DCC-2010-05, DCC-FC, Universidade do Porto, 2010. [ .html ]
[72] Sabine Broda, António Machiavelo, Nelma Moreira, and Rogério Reis. On the average size of pd automata: an analytic combinatorics approach. Technical Report DCC-2010-04, DCC-FC, Universidade do Porto, 2010. [ .html ]
[71] José Alves, Nelma Moreira, and Rogério Reis. XML description for automata manipulations. In Alberto Sim oes, Daniela Cruz, and José Carlos Ramalho, editors, Actas XATA 2010, XML: aplicações e tecnologias associadas, pages 77--88, ESEIG, Vila do Conde, 2010. Also in http://hdl.handle.net/1822/10637. [ .pdf | Abstract ]
[70] Marco Almeida, Nelma Moreira, and Rogério Reis. Testing equivalence of regular languages. Journal of Automata, Languages and Combinatorics, 15(1/2):7--25, 2010. [ .pdf | Abstract ]
[69] Marco Almeida, Nelma Moreira, and Rogério Reis. Antimirov and Mosses' rewrite system revisited. International Journal of Foundations of Computer Science, 20(4):669--684, August 2009. MR2555761. [ DOI | .pdf ]
[68] Marco Almeida, Nelma Moreira, and Rogério Reis. Testing equivalence of regular languages. In Workshop on Descriptional Complexity of Formal Systems (DCFS09), Magdeburg, Germany, July 2009. Also in Electronic Proceedings in Theoretical Computer Science (eptcs 3) http://www.eptcs.org. [ DOI | .pdf ]
[67] André Almeida, Marco Almeida, José Alves, Nelma Moreira, and Rogério Reis. Fado and guitar: tools for automata manipulation and visualization. In S. Maneth, editor, CIAA 2009: Fourteenth International Conference on Implementation and Application of Automata, volume 5642 of Lecture Notes on Computer Science, pages 65--74, Sydney, Australia, July 2009. Springer-Verlag. [ DOI | .pdf | Abstract ]
[66] Nelma Moreira and Rogério Reis. Series-parallel automata and short regular expressions. Fundamenta Informaticae, 91(3-4):611--629, 2009. MR2518215. [ DOI | .pdf | Abstract ]
[65] Nelma Moreira, David Pereira, and Sim ao Melo de Sousa. On the Mechanization of Kleene Algebra in Coq. Technical Report Dcc-2009-03, DCC-FC&LIACC, Universidade do Porto, 2009. [ .html ]
[64] Nelma Moreira and Rogério Reis. Series-parallel automata and short regular expressions. Fundamenta Informaticae, 91(3-4):611--629, 2009. [ DOI | .pdf | Abstract ]
[63] Marco Almeida, Nelma Moreira, and Rogério Reis. Testing equivalence of regular languages. Technical Report DCC-2009-01, DCC-FC&LIACC, Universidade do Porto, 2009. [ .html ]
[62] David Pereira and Nelma Moreira. KAT and PHL in COQ. Computer Science and Information Systems, 05(02), December 2008. ISSN: 1820-0214. [ .pdf | Abstract ]
[61] Marco Almeida, Nelma Moreira, and Rogério Reis. Exact generation of minimal acyclic deterministic finite automata. International Journal of Foundations of Computer Science, 19(4):751--765, August 2008. MR2437812. [ DOI | .pdf | Abstract ]
[60] David Pereira and Nelma Moreira. KAT and PHL in COQ. In Corta 08, Bragança, Portugal, July 2008. [ .pdf ]
[59] Marco Almeida, Nelma Moreira, and Rogério Reis. Exact generation of acyclic deterministic finite automata. In Workshop on Descriptional Complexity of Formal Systems (DCFS08), Charlottetown, Canada, July 2008. [ .pdf | Abstract ]
[58] André Almeida, José Alves, Nelma Moreira, and Rogério Reis. Cgm: A context-free grammar manipulator. In Corta 08, Bragança, Portugal, July 2008. [ .pdf | Abstract ]
[57] Marco Almeida, Nelma Moreira, and Rogério Reis. Antimirov and Mosses's rewrite system revisited. In O. Ibarra and B. Ravikumar, editors, CIAA 2008: Thirteenth International Conference on Implementation and Application of Automata, Lecture Notes on Computer Science, pages 46--56, San Francisco, CA, USA, July 2008. Springer-Verlag. MR2504697. [ DOI | .pdf | Abstract ]
[56] David Pereira, Eugénio Oliveira, and Nelma Moreira. Formal modelling of emotions in bdi agents. In F. Sadri and K. Satoh, editors, Eighth Workshop on Computational Logic in Multi-Agent Systems (CLIMA-VIII), number 5056 in LNAI, pages 62--81, Porto, Portugal, 2008. Springer-Verlag. [ .pdf | Abstract ]
[55] Silvestre Lacerda, Norberto Lopes, Nelma Moreira, and Rogério Reis. A toolkit for an oral history digital archive. In José Carlos Ramalho and Jo ao Correia Lopes, editors, Actas XATA 2008, XML: aplicações e tecnologias associadas, pages 40--51, Universidade de Évora, 2008. [ .pdf ]
[54] Marco Almeida, Nelma Moreira, and Rogério Reis. On the performance of automata minimization algorithms. In Arnold Beckmann, Costas Dimitracopoulos, and Benedikt Löwe, editors, CiE 2008: Abstracts and extended abstracts of unpublished papers., 2008. [ .pdf ]
[53] Marco Almeida, Nelma Moreira, and Rogério Reis. Testing regular expressions equivalence. Technical Report DCC-2007-07, DCC - FC, Universidade do Porto, October 2007. [ .pdf ]
[52] David Pereira, Eugénio Oliveira, and Nelma Moreira. Formal modelling of emotions in bdi agents. In Eighth Workshop on Computational Logic in Multi-Agent Systems (CLIMA-VIII), Porto, Portugal, September 2007. For a extended version see Technical Report [50]. [ .pdf ]
[51] Marco Almeida, Nelma Moreira, and Rogério Reis. Exact generation of minimal acyclic deterministic finite automata. In Workshop on Descriptional Complexity of Formal Systems (DCFS07), pages 57--68, High Tatras, Slovakia, July 2007. [ .pdf ]
[50] David Pereira, Eugénio Oliveira, and Nelma Moreira. Formal modelling of emotions in bdi agents. Technical Report DCC-2007-04, DCC - FC & LIACC, Universidade do Porto, June 2007. [ .pdf ]
[49] Marco Almeida, Nelma Moreira, and Rogério Reis. Exact generation of minimal acyclic deterministic finite automata. Technical Report DCC-2007-05, DCC - FC & LIACC, Universidade do Porto, June 2007. [ .pdf ]
[48] Marco Almeida, Nelma Moreira, and Rogério Reis. On the performance of automata minimization algorithms. Technical Report DCC-2007-03, DCC - FC & LIACC, Universidade do Porto, June 2007. [ .pdf ]
[47] Silvestre Lacerda, Norberto Lopes, Nelma Moreira, and Rogério Reis. Ferramentas para a construção de arquivos digitais de história oral. In Luís Carriço José Carlos Ramalho, João Correia Lopes, editor, Actas XATA 2007, XML: aplicações e tecnologias associadas. Universidade de Lisboa, February 2007.
[46] J. Barbosa, J. Caramelo, J. Cunha, A. Ferreira, S. Lacerda, N. Lopes, M. Loff, M. Matias, T. Medina, B. Monteiro, N. Moreira, C. Nogueira, R. Reis, I. Ribeiro, J. Rocha, C. F. Silva, and C. R. Silva. Education and language in memories of labour. Poster in “Investugação Científica na Pré-Graduação”, Universidade do Porto, 2007.
[45] Marco Almeida, Nelma Moreira, and Rogério Reis. Enumeration and generation with a string automata representation. Theoretical Computer Science, 387(2):93--102, 2007. MR2362181. [ DOI | .pdf | Abstract ]
[44] Marco Almeida, Nelma Moreira, and Rogério Reis. Enumeration and generation of initially connected deterministic finite automata. Technical Report DCC-2006-07, DCC-FC & LIACC, Universidade do Porto, December 2006. [ .pdf ]
[43] Marco Almeida, Nelma Moreira, and Rogério Reis. Aspects of enumeration and generation with a string automata representation. In H. Leung and G.Pighizzini, editors, Proceedings of the 8th Int. Workshop on Descriptional Complexity of Formal Systems (DCFS06), number NMSU-CS-2006-001 in Computer Science Technical Report, pages 58--69, Las Cruces, New Mexico, June 2006. NMSU. [ .pdf | Abstract ]
[42] David Pereira, Eugénio Oliveira, and Nelma Moreira. Modelling emotional bdi agents. In Workshop on Formal Approaches to Multi-Agent Systems (FAMAS 2006), Riva del Garda, Italy, 2006. [ .pdf | Abstract ]
[41] Ana Paula Tomás, Nelma Moreira, and Nuno Pereira. Designing a solver for arithmetic constraints to support education in mathematics. In IFIP Conference on Artificial Intelligence Applications & Innovations (AIAI) 2006. Springer-Verlag, 2006. IFIP Conference on Artificial Intelligence Applications & Innovations (AIAI) 2006 , Athens, Greece. [ .pdf | Abstract ]
[40] David Pereira, Eugénio Oliveira, Nelma Moreira, and Luís Sarmento. Towards an architecture for emotional bdi agents. In Amílcar Cardoso Carlos Bento and Gaël Dias, editors, EPIA05 -- 12th Portuguese Conference on Artificial Intelligence, pages 40--46. Universidade da Beira Interior, IEEE, December 2005. ISBN 0-7803-9365-1. [ .pdf ]
[39] David Pereira, Eugénio Oliveira, and Nelma Moreira. Towards an architecture for emotional bdi agents. Technical Report DCC-2005-09, DCC - FC & LIACC, Universidade do Porto, July 2005. [ .pdf ]
[38] Rogério Reis, Nelma Moreira, and Marco Almeida. On the representation of finite automata. In G. Pighizzini C. Mereghetti, B. Palano and D. Wotschkes, editors, Proceedings of the 7th Int. Workshop on Descriptional Complexity of Formal Systems (DCFS05), pages 269--276, Como, Italy, June 2005. For a extended version see Technical Report [34]. [ .pdf ]
[37] José João Morais, Nelma Moreira, and Rogério Reis. Acyclic automata with easy-to-find short regular expressions. In Igor Litovshy Jacques Farré and Sylvain Schmitz, editors, CIAA 2005, Tenth International Conference on Implementation and Application of Automata, volume 3845 of Lecture Notes on Computer Science, pages 349--350, Sophia-Anthiopolis, France, June 2005. Springer-Verlag. Also in Pre-proceedings of Tenth International Conference on Implementation and Application of Automata (CIAA05). [ .pdf ]
[36] Ana Paula Tomás, Nelma Moreira, and Nuno Pereira. Designing a symbolic solver for arithmetic constraints for computer assisted learning. Technical Report DCC-2005-06, DCC - FC & LIACC, Universidade do Porto, May 2005. [ .pdf ]
[35] José João Morais, Nelma Moreira, and Rogério Reis. Acyclic automata with easy-to-find short regular expressions. Technical Report DCC-2005-03, ,DCC-FC& LIACC, Universidade do Porto, April 2005. [ .pdf ]
[34] Marco Almeida, Nelma Moreira, and Rogério Reis. On the representation of finite automata. Technical Report DCC-2005-04, DCC - FC & LIACC, Universidade do Porto, April 2005. [ .pdf ]
[33] Ângela Oliveira and Nelma Moreira. Gerexa: Plataforma integrada para a organização, geração e avaliação de exercícios e testes. In Actas da 3a Conferência Nacional XML: Aplicações e Tecnologias Associadas. Universidade do Minho, 2005. [ .pdf ]
[32] Nelma Moreira and Rogério Reis. Interactive manipulation of regular objects with FAdo. In Proceedings of 2005 Innovation and Technology in Computer Science Education (ITiCSE 2005). ACM, 2005. Based on Technical Report [25]. [ .pdf | Abstract ]
[31] Nelma Moreira and Rogério Reis. Fado:interactive tools for learning formal computational models. In Encontro Nacional de Visualização Científica, Centro Multimeios de Espinho, 2005. http://envc2005.multimeios.pt. [ .pdf ]
[30] Nelma Moreira and Rogério Reis. On the density of languages representing finite set partitions. Journal of Integer Sequences, 8(05.2.8), 2005. MR2152288. [ .html ]
[29] Nelma Moreira and Rogério Reis. On the density of languages representing finite set partitions. Technical Report DCC-2004-07, DCC-FC& LIACC, Universidade do Porto, August 2004. [ .pdf ]
[28] Rogério Reis, Nelma Moreira, and Jo ao Pedro Pedroso. Educated brute-force to get h(4). Technical Report DCC-2004-04, DCC-FC& LIACC, Universidade do Porto, July 2004. [ .pdf ]
[27] Jo ao Pedro Pedroso, Nelma Moreira, and Rogério Reis. A web-based system for multi-agent interactive timetabling. In ICKEDS 2004, First International Conference on Knowledge Engineering and Decision Support, Porto,21-23 of July, 2004. [ .pdf | Abstract ]
[26] Rogério Reis and Nelma Moreira. Yappy: Yet another LR(1) parser generator for Python. DCC-FC & LIACC, Universidade do Porto, Portugal, 2003. http://www.ncc.up.pt/fado/Yappy/. [ .pdf ]
[25] Rogério Reis and Nelma Moreira. FAdo:tools for finite automata and regular expressions manipulation. Technical Report DCC-2002-2, DCC-FC& LIACC, Universidade do Porto, August 2002. [ .pdf | Abstract ]
[24] Rogério Reis and Nelma Moreira. Apoo: an environment for a first course in assembly language programming. SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education), 33(2), December 2001. Extended version available as Technical Report [18].
[23] Nelma Moreira José Paulo Leal and Pedro Ribeiro. EDIC: Uma abordagem para apresentação de conteúdos pedagógicos na web. Technical Report DCC-2001-5, DCC - FC & LIACC, Universidade do Porto, July 2001. [ .ps.gz ]
[22] Nelma Moreira José Paulo Leal and Pedro Ribeiro. Edic: Uma abordagem para apresentação de conteúdos pedagógicos na web. In Proceedings of the International Conference on New Technologies in Science Education (resumos), CINTEC 2001, page 86, Aveiro, 2001. Extended version available as Technical Report [23].
[21] José Paulo Leal and Nelma Moreira. Using matching for automatic assessment in computer science learning environments. In Francisco Restivo and Lígia Ribeiro, editors, Web-Based Lerning Environments, pages 70--72. Merlin 2000 Project, FEUP Edições, June 2000. Extended version available as Technical Report [20].
[20] José Paulo Leal and Nelma Moreira. Using matching for automatic assessment in computer science learning environments. Technical Report DCC-2000-3, DCC - FC & LIACC, Universidade do Porto, 2000. [ .ps.gz ]
[19] José Paulo Leal and Nelma Moreira. Automatic grading of programming exercises. Technical Report DCC-98-4, DCC - FC & LIACC, Universidade do Porto, 1998. [ .ps.gz ]
[18] Rogério Reis and Nelma Moreira. Apoo: an environment for a first course in assembly language programming. Technical Report DCC-98-9, DCC-FC& LIACC, Universidade do Porto, 1998. [ .pdf.gz | Abstract ]
[17] Nelma Moreira. Resolution of Complex Constraints on Trees and Applications in Logic Grammars. PhD thesis, Universidade do Porto, 1997. (In Portuguese). [ .ps.gz | Abstract ]
[16] Luís Damas and Nelma Moreira. Constraint categorial grammars. In Nuno Mamede and Carlos Pinto-Fereira, editors, EPIA 95, volume 990 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1995. MR1390070. [ .ps.gz | Abstract ]
[15] Luís Damas, Nelma Moreira, and Giovanni B. Varile. The formal and computational theory of complex constraint solution. In C. Rupp, M. A. Rosner, and R. L. Johnson, editors, Constraints, Language, and Computation, Computation in Cognitive Science, pages 149--166. Academic Press, London, 1994. [ .pdf ]
[14] Luís Damas and Nelma Moreira. CC(L)G: constraint categorial grammars. In Rolf Backofen, Hans-Ulrich Krieger, S. Spackman, and Hans Uszkoreit, editors, Report of the EAGLES workshop on implemented formalisms at DFKI, pages 26--28. DFKI, Saarbrücken, March 1993.
[13] Luís Damas, Nelma Moreira, and Giovanni Varile. CLG: Constraint logic grammar. In Rolf Backofen, Hans-Ulrich Krieger, S. Spackman, and Hans Uszkoreit, editors, Report of the EAGLES workshop on implemented formalisms at DFKI, pages 40--41. DFKI, Saarbrücken, March 1993.
[12] Luís Damas, Nelma Moreira, and Sabine Broda. Resolution of constraints in algebras of rational trees. In Miguel Filgueiras and Luís Damas, editors, Progress in Artificial Intelligence --- 6th Portuguese Conference on Artificial Intelligence (EPIA 93), volume 727 of Lecture Notes in Artificial Intelligence, pages 61--76. Springer-Verlag, 1993. MR1291450. [ .pdf | Abstract ]
[11] Luís Damas and Nelma Moreira. A quantifier elimination algorithm for a first order logic with equality. Technical report, Centro de Informática da Universidade do Porto, July 1991. [ .pdf | Abstract ]
[10] Miguel Filgueiras, L. Damas, N. Moreira, and A. P. Tomás, editors. Natural Language Processing -- EAIA '90 Proceedings. Number 476 in Lecture Notes in Artificial Intelligence. Springer-Verlag, 1991. Reviewed in Math Reviews, 91k:68015; 03B65 68S05. Reviewed in Zentralblatt für Mathematik, 875.00077; 00B25, 68-06, 68S05, 68T99.
[9] Miguel Filgueiras, N. Moreira, and A. P. Tomás. General introduction. In Filgueiras et al. [10], pages 1--3. MR1102026.
[8] José Paulo Leal, Luís Damas, and Nelma Moreira. A history based interface. In Proceedings of the ICLP preconference Workshop on Logic Programming Environments, Paris, 1991.
[7] Luís Damas, Nelma Moreira, and Giovanni B. Varile. The formal and processing models of CLG. In Fifth Conference of the European Chapter of the Association for Computational Linguistics, pages 173--178, Berlin, 1991. [ .pdf ]
[6] M. Filgueiras, A.P. Tomás, N. Moreira, J.P. Leal, and R.Reis. Natural language and natural menus interfaces. In Preprints of the TC-7 IFIP International Conference Modelling the Innovation, Roma, March 1990. Also in M. Carnevale, M. Lucërtini, S. Nicosia (eds.), “Modelling the Innovation: Communications, Automation and Information Systems”, North-Holland, 1990.
[5] Sergio Balari, Luís Damas, Nelma Moreira, and Giovanni B. Varile. CLG(n): Constraint logic grammars. In H.Karlgren, editor, Proceedings of the 13th International Conference on Computational Linguistics (COLING), volume 3, pages 7--12, Helsinki, 1990. [ .pdf ]
[4] Nelma Moreira. Semantic analysis of time and tense in natural language: an implementation. In J.P Martins and E.M. Morgado, editors, Proceedings of the 4th Portuguese Conference of Artificial Inteligence, number 390 in LNAI, Berlin, 1989. Springer-Verlag. [ .pdf | Abstract ]
[3] Nelma Moreira. Representação de semântica de referências temporais em linguagem natural. Master's thesis, Universidade do Porto, October 1988. Apresentado à Universidade do Porto no âmbito das Provas de Aptidão Pedagógica e Capacidade Científica.
[2] Isabel Labouriau and Nelma Moreira. Third order derivative of degenerate Hopf bifurcation in normal form. Technical report, Grupo de Matemática Aplicada da Faculdade de Ciências da Universidade do Porto, 1986.
[1] Isabel Labouriau e Nelma Moreira. Soluções periódicas das equações de Fitzhugh para o impulso nervoso. In Actas do VII Congresso do Grupo de Matemáticos de Expressão Latina, 1985.

This file was generated by bibtex2html 1.99.