Publications
Found 516 results
Author [ Title
] Type Year Filters: First Letter Of Last Name is M [Clear All Filters]
[2014-35] Automata for KAT Expressions DCC-FC, Universidade do Porto .
[2014-35] Automata for KAT Expressions DCC-FC, Universidade do Porto .
Automata for Regular Expressions with Shuffle. Information and Computation. 2017.
Automata for Regular Expressions with Shuffle. Information and Computation. 2017.
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).Edit
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).Edit
Automated Ciphertext-Only Cryptanalysis of the Bifid Cipher. Cryptologia. 2007;31(2):112-124.
Automatic multilead VCG based approach for QT interval measurement. In: {Computers in Cardiology}. Vol {33}.; 2006. {. {p. 369-372p. }.Edit
On the Average Complexity of Partial Derivative Automata for Semi-Extended Expressions. Journal of Automata, Languages and Combinatorics. 2017;22:5-28.Edit
On the Average Complexity of Partial Derivative Automata for Semi-Extended Expressions. Journal of Automata, Languages and Combinatorics. 2017;22:5-28.Edit
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).Edit
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).Edit
On the average number of states of partial derivative automata. In: Developments in language theory. Vol 6224. Springer, Berlin; 2010. 1. p. 112-123p. (Lecture Notes in Comput. Sci.; vol 6224).Edit
On the average number of states of partial derivative automata. In: Developments in language theory. Vol 6224. Springer, Berlin; 2010. 1. p. 112-123p. (Lecture Notes in Comput. Sci.; vol 6224).Edit
Average Size of Automata Constructions from Regular Expressions. Bulletin of the European Association for Theoretical Computer Science. 2015:167-192.Edit
Average Size of Automata Constructions from Regular Expressions. Bulletin of the European Association for Theoretical Computer Science. 2015:167-192.Edit
On the Average Size of Glushkov and Equation Automata for KAT Expressions. In: FCT. United Kingdom, Liverpool: Springer; 2013. 7. p. 72-83p.
On the Average Size of Glushkov and Equation Automata for KAT Expressions. In: FCT. United Kingdom, Liverpool: Springer; 2013. 7. p. 72-83p.
On the Average Size of Glushkov and Partial Derivative Automata. International Journal of Foundations of Computer Science. 2012;23:969-984.
On the Average Size of Glushkov and Partial Derivative Automata. International Journal of Foundations of Computer Science. 2012;23:969-984.
On the Average State Complexity of Partial Derivative Automata: an analytic combinatorics approach. International Journal of Foundations of Computer Science. 2011;22:1593-1606.
On the Average State Complexity of Partial Derivative Automata: an analytic combinatorics approach. International Journal of Foundations of Computer Science. 2011;22:1593-1606.
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. Edit