default search action
Rogério Reis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j41]Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Juraj Sebej:
On the difference set of two transductions. Theor. Comput. Sci. 1016: 114780 (2024) - [c50]Guilherme Duarte
, Nelma Moreira
Block Languages and Their Bitmap Representations. CIAA 2024: 124-137 - [c49]Guilherme Duarte, Nelma Moreira, Luca Prigioniero, Rogério Reis:
Operational State Complexity of Block Languages. NCMA 2024: 59-76 - [i17]Guilherme Duarte, Nelma Moreira, Luca Prigioniero, Rogério Reis:
On the Representation of Block Languages. CoRR abs/2404.11746 (2024) - 2023
- [j40]Sabine Broda
Location automata for regular expressions with shuffle and intersection. Inf. Comput. 295(Part B): 104917 (2023) - [j39]Nelma Moreira
Special Issue: 25th International Conference on Developments in Language Theory (DLT 2021) - Preface. Int. J. Found. Comput. Sci. 34(2&3): 81-83 (2023) - [j38]Sabine Broda
Location automata for synchronised shuffle expressions. J. Log. Algebraic Methods Program. 132: 100847 (2023) - [j37]Stavros Konstantinidis, António Machiavelo
On the average complexity of partial derivative transducers. Theor. Comput. Sci. 956: 113830 (2023) - [j36]Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira
Approximate NFA universality and related problems motivated by information theory. Theor. Comput. Sci. 972: 114076 (2023) - [c48]Sabine Broda
Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions. CIAA 2023: 103-115 - 2022
- [c47]Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira
Approximate NFA Universality Motivated by Information Theory. DCFS 2022: 142-154 - [c46]Nelma Moreira
Manipulation of Regular Expressions Using Derivatives: An Overview. CIAA 2022: 19-33 - [i16]Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira, Rogério Reis:
Approximate NFA Universality and Related Problems Motivated by Information Theory. CoRR abs/2202.01594 (2022) - 2021
- [j35]Stavros Konstantinidis, António Machiavelo
On the size of partial derivatives and the word membership problem. Acta Informatica 58(4): 357-375 (2021) - [j34]Sabine Broda
The Prefix Automaton. J. Autom. Lang. Comb. 26(1-2): 17-53 (2021) - [j33]Stavros Konstantinidis, Nelma Moreira
Partial derivatives of regular expressions over alphabet-invariant and user-defined labels. Theor. Comput. Sci. 870: 103-120 (2021) - [c45]Sabine Broda
On the Uniform Distribution of Regular Expressions. DCFS 2021: 13-25 - [c44]Stavros Konstantinidis, António Machiavelo
Partial Derivative Automaton by Compressing Regular Expressions. DCFS 2021: 100-112 - [c43]Sabine Broda
Location Based Automata for Expressions with Shuffle. LATA 2021: 43-54 - [p1]Martin Kutrib
Hot Current Topics of Descriptional Complexity. IFIP's Exciting First 60+ Years 2021: 3-28 - [e6]Nelma Moreira
Developments in Language Theory - 25th International Conference, DLT 2021, Porto, Portugal, August 16-20, 2021, Proceedings. Lecture Notes in Computer Science 12811, Springer 2021, ISBN 978-3-030-81507-3 [contents] - [i15]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Uniform Distribution of Regular Expressions. CoRR abs/2103.13175 (2021) - 2020
- [j32]Stavros Konstantinidis, Nelma Moreira
Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels. Int. J. Found. Comput. Sci. 31(8): 983-1019 (2020) - [j31]Bruno Loff
The computational power of parsing expression grammars. J. Comput. Syst. Sci. 111: 1-21 (2020) - [j30]Sabine Broda
Guest Column: Analytic Combinatorics and Descriptional Complexity of Regular Languages on Average. SIGACT News 51(1): 38-56 (2020) - [c42]Stavros Konstantinidis, António Machiavelo
On the Average State Complexity of Partial Derivative Transducers. SOFSEM 2020: 174-186
2010 – 2019
- 2019
- [j29]Sabine Broda
A mesh of automata. Inf. Comput. 265: 94-111 (2019) - [j28]Sabine Broda
On Average Behaviour of Regular Expressions in Strong Star Normal Form. Int. J. Found. Comput. Sci. 30(6-7): 899-920 (2019) - [c41]Stavros Konstantinidis, Nelma Moreira
Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels. CIAA 2019: 184-196 - [i14]Bruno Loff, Nelma Moreira, Rogério Reis:
The computational power of parsing expression grammars. CoRR abs/1902.08272 (2019) - 2018
- [j27]Sabine Broda
Automata for regular expressions with shuffle. Inf. Comput. 259(2): 162-173 (2018) - [j26]Stavros Konstantinidis, Nelma Moreira
Randomized generation of error control codes with automata and transducers. RAIRO Theor. Informatics Appl. 52(2-3-4): 169-184 (2018) - [j25]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
Position Automata for Semi-extended Expressions. J. Autom. Lang. Comb. 23(1-3): 39-65 (2018) - [j24]Stavros Konstantinidis
Symbolic Manipulation of Code Properties. J. Autom. Lang. Comb. 23(1-3): 243-269 (2018) - [c40]Miguel Ferreira, Nelma Moreira
Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs. DCFS 2018: 88-100 - [c39]Bruno Loff
The Computational Power of Parsing Expression Grammars. DLT 2018: 491-502 - [c38]Stavros Konstantinidis, Nelma Moreira
Regular Expressions and Transducers over Alphabet-Invariant and User-Defined Labels. CIAA 2018: 4-27 - [i13]Stavros Konstantinidis, Nelma Moreira
Regular Expressions and Transducers over Alphabet-invariant and User-defined Labels. CoRR abs/1805.01829 (2018) - 2017
- [j23]Yuan Gao, Nelma Moreira, Rogério Reis, Sheng Yu:
A Survey on Operational State Complexity. J. Autom. Lang. Comb. 21(4): 251-310 (2017) - [j22]Rafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Average Complexity of Partial Derivative Automata for Semi-extended Expressions. J. Autom. Lang. Comb. 22(1-3): 5-28 (2017) - [j21]Nelma Moreira
Optimal state reductions of automata with partially specified behaviors. Theor. Comput. Sci. 658: 235-245 (2017) - [c37]Sabine Broda
On the Average Complexity of Strong Star Normal Form. DCFS 2017: 77-88 - [c36]Sabine Broda
On the Mother of All Automata: The Position Automaton. DLT 2017: 134-146 - [e5]Stavros Konstantinidis
The Role of Theory in Computer Science - Essays Dedicated to Janusz Brzozowski. World Scientific 2017, ISBN 978-981-3148-19-2 [contents] - 2016
- [j20]Cezar Câmpeanu
Distinguishability Operations and Closures. Fundam. Informaticae 148(3-4): 243-266 (2016) - [j19]Rogério Reis
Ideal regular languages and strongly connected synchronizing automata. Theor. Comput. Sci. 653: 97-107 (2016) - [c35]Rafaela Bastos, Sabine Broda
On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection. DCFS 2016: 45-59 - [c34]Sabine Broda
Position Automaton Construction for Regular Expressions with Intersection. DLT 2016: 51-63 - [c33]Cezar Câmpeanu, Nelma Moreira, Rogério Reis:
On the dissimilarity operation on finite languages. NCMA 2016: 105-120 - [c32]Stavros Konstantinidis, Nelma Moreira, Rogério Reis:
Generating error control codes with automata and transducers. NCMA 2016: 211-226 - [c31]Miguel Ferreira, Nelma Moreira
Automata Serialization for Manipulation and Drawing. SLATE 2016: 15:1-15:7 - [c30]Stavros Konstantinidis
Implementation of Code Properties via Transducers. CIAA 2016: 189-201 - [i12]Stavros Konstantinidis
Channels with Synchronization/Substitution Errors and Computation of Error Control Codes. CoRR abs/1601.06312 (2016) - 2015
- [j18]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
Average Size of Automata Constructions from Regular Expressions. Bull. EATCS 116 (2015) - [j17]Eva Maia
Incomplete operational transition complexity of regular languages. Inf. Comput. 244: 1-22 (2015) - [j16]Ivone Amorim
On the Number of Linear Finite Transducers. Int. J. Found. Comput. Sci. 26(7): 873-894 (2015) - [c29]Eva Maia
Prefix and Right-Partial Derivative Automata. CiE 2015: 258-267 - [c28]Sabine Broda
Partial Derivative Automaton for Regular Expressions with Shuffle. DCFS 2015: 21-32 - [c27]Nelma Moreira
Universal Disjunctive Concatenation and Star. DCFS 2015: 197-208 - [c26]Nelma Moreira
Optimal State Reductions of Automata with Partially Specified Behaviors. SOFSEM 2015: 339-351 - [e4]Rudolf Freund, Markus Holzer, Nelma Moreira, Rogério Reis:
Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31 - September 1, 2015. Proceedings. books@ocg.at 318, Österreichische Computer Gesellschaft 2015, ISBN 978-3-903035-07-2 [contents] - [i11]Sabine Broda
Partial Derivative Automaton for Regular Expressions with Shuffle. CoRR abs/1503.00279 (2015) - [i10]Stavros Konstantinidis
Symbolic Manipulation of Code Properties. CoRR abs/1504.04715 (2015) - [i9]Yuan Gao, Nelma Moreira, Rogério Reis
A Survey on Operational State Complexity. CoRR abs/1509.03254 (2015) - 2014
- [j15]Helmut Jürgensen, Rogério Reis
Preface. Int. J. Found. Comput. Sci. 25(7): 803-806 (2014) - [j14]Ivone Amorim
On the invertibility of finite linear transducers. RAIRO Theor. Informatics Appl. 48(1): 107-125 (2014) - [j13]Marco Almeida, Nelma Moreira
Incremental DFA minimisation. RAIRO Theor. Informatics Appl. 48(2): 173-186 (2014) - [j12]Sabine Broda
A Hitchhiker's Guide to descriptional complexity through analytic combinatorics. Theor. Comput. Sci. 528: 85-100 (2014) - [c25]Sabine Broda
On the Equivalence of Automata for KAT-expressions. CiE 2014: 73-83 - [c24]Jason P. Bell, Janusz A. Brzozowski, Nelma Moreira
Symmetric Groups and Quotient Complexity of Boolean Operations. ICALP (2) 2014: 1-12 - [c23]Ivone Amorim, António Machiavelo, Rogério Reis:
Statistical study on the number of injective linear finite transducers. NCMA 2014: 57-72 - [c22]Cezar Câmpeanu, Nelma Moreira, Rogério Reis:
The distinguishability operation on regular languages. NCMA 2014: 85-100 - [c21]Ivone Amorim
Counting Equivalent Linear Finite Transducers Using a Canonical Form. CIAA 2014: 70-83 - [c20]Eva Maia
Partial Derivative and Position Bisimilarity Automata. CIAA 2014: 264-277 - [i8]Cezar Câmpeanu, Nelma Moreira, Rogério Reis:
The Distinguishability Operation On Regular Languages. CoRR abs/1407.0160 (2014) - [i7]Ivone Amorim, António Machiavelo, Rogério Reis:
Statistical Study On The Number Of Injective Linear Finite Transducers. CoRR abs/1407.0169 (2014) - 2013
- [j11]Nelma Moreira
Preface. Int. J. Found. Comput. Sci. 24(6): 689-690 (2013) - [c19]Rogério Reis
Regular Ideal Languages and Synchronizing Automata. WORDS 2013: 205-216 - [c18]Sabine Broda
On the Average Size of Glushkov and Equation Automata for KAT Expressions. FCT 2013: 72-83 - [c17]Eva Maia
Incomplete Transition Complexity of Some Basic Operations. SOFSEM 2013: 319-331 - [c16]Eva Maia
Incomplete Transition Complexity of Basic Operations on Finite Languages. CIAA 2013: 349-356 - [e3]Helmut Jürgensen, Rogério Reis
Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, London, ON, Canada, July 22-25, 2013. Proceedings. Lecture Notes in Computer Science 8031, Springer 2013, ISBN 978-3-642-39309-9 [contents] - [i6]Eva Maia, Nelma Moreira, Rogério Reis:
Incomplete Transition Complexity of Basic Operations on Finite Languages. CoRR abs/1302.0750 (2013) - [i5]Jason P. Bell, Janusz A. Brzozowski, Nelma Moreira, Rogério Reis:
Symmetric Groups and Quotient Complexity of Boolean Operations. CoRR abs/1310.1841 (2013) - 2012
- [j10]Sabine Broda
On the Average Size of Glushkov and Partial derivative Automata. Int. J. Found. Comput. Sci. 23(5): 969-984 (2012) - [j9]Jürgen Dassow, Martin Kutrib
Editorial. J. Autom. Lang. Comb. 17(2-4): 59-60 (2012) - [c15]Ivone Amorim, António Machiavelo, Rogério Reis:
Formal Power Series and the Invertibility of Finite Linear Transducers. NCMA 2012: 33-48 - [e2]Martin Kutrib
Descriptional Complexity of Formal Systems - 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings. Lecture Notes in Computer Science 7386, Springer 2012, ISBN 978-3-642-31622-7 [contents] - [e1]Nelma Moreira
Implementation and Application of Automata - 17th International Conference, CIAA 2012, Porto, Portugal, July 17-20, 2012. Proceedings. Lecture Notes in Computer Science 7381, Springer 2012, ISBN 978-3-642-31605-0 [contents] - [r1]Marco Almeida, Nelma Moreira
Finite Automata Minimization. Handbook of Finite State Based Models and Applications 2012: 145-169 - 2011
- [j8]Sabine Broda
On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach. Int. J. Found. Comput. Sci. 22(7): 1593-1606 (2011) - [c14]Sabine Broda
The Average Transition Complexity of Glushkov and Partial Derivative Automata. Developments in Language Theory 2011: 93-104 - 2010
- [j7]Marco Almeida, Nelma Moreira, Rogério Reis:
Testing the Equivalence of Regular Languages. J. Autom. Lang. Comb. 15(1/2): 7-25 (2010) - [c13]Sabine Broda
On the Average Number of States of Partial Derivative Automata. Developments in Language Theory 2010: 112-123 - [c12]Marco Almeida, Nelma Moreira
Incremental DFA Minimisation. CIAA 2010: 39-48 - [c11]Nelma Moreira
State Elimination Ordering Strategies: Some Experimental Results. DCFS 2010: 139-148 - [i4]Hugo Gouveia, Nelma Moreira
Small NFAs from Regular Expressions: Some Experimental Results. CoRR abs/1009.3599 (2010)
2000 – 2009
- 2009
- [j6]Nelma Moreira
Series-Parallel Automata and Short Regular Expressions. Fundam. Informaticae 91(3-4): 611-629 (2009) - [j5]Marco Almeida, Nelma Moreira
Antimirov and Mosses's Rewrite System Revisited. Int. J. Found. Comput. Sci. 20(4): 669-684 (2009) - [c10]André Almeida, Marco Almeida, José Alves, Nelma Moreira
FAdo and GUItar. CIAA 2009: 65-74 - [c9]Marco Almeida, Nelma Moreira
Testing the Equivalence of Regular Languages. DCFS 2009: 47-57 - [i3]Rogério Reis, Nelma Moreira, Marco Almeida:
On the Representation of Finite Automata. CoRR abs/0906.2477 (2009) - [i2]Marco Almeida, Nelma Moreira, Rogério Reis:
Aspects of enumeration and generation with a string automata representation. CoRR abs/0906.3853 (2009) - [i1]Marco Almeida, Nelma Moreira, Rogério Reis:
Exact generation of acyclic deterministic finite automata. CoRR abs/0908.3315 (2009) - 2008
- [j4]Marco Almeida, Nelma Moreira
Exact Generation of Minimal Acyclic Deterministic Finite Automata. Int. J. Found. Comput. Sci. 19(4): 751-765 (2008) - [c8]Marco Almeida, Nelma Moreira, Rogério Reis:
Exact Generation of Acyclic Deterministic Finite Automata. DCFS 2008: 48-60 - [c7]Marco Almeida, Nelma Moreira
Antimirov and Mosses's Rewrite System Revisited. CIAA 2008: 46-56 - 2007
- [j3]António Machiavelo
Automated Ciphertext - Only Cryptanalysis of the Bifid Cipher. Cryptologia 31(2): 112-124 (2007) - [j2]Marco Almeida, Nelma Moreira
Enumeration and generation with a string automata representation. Theor. Comput. Sci. 387(2): 93-102 (2007) - [c6]Marco Almeida, Nelma Moreira, Rogério Reis:
Exact Generation of Minimal Acyclic Deterministic Finite Automata. DCFS 2007: 57-68 - 2006
- [c5]Marco Almeida, Nelma Moreira, Rogério Reis:
Aspects of Enumeration and Generation with a String Automata Representation. DCFS 2006: 58-69 - 2005
- [c4]Rogério Reis, Nelma Moreira, Marco Almeida:
On the Representation of Finite Automata. DCFS 2005: 269-276 - [c3]Nelma Moreira
Interactive manipulation of regular objects with FAdo. ITiCSE 2005: 335-339 - [c2]José João Morais, Nelma Moreira
Acyclic Automata with Easy-to-Find Short Regular Expressions. CIAA 2005: 349-350 - 2001
- [j1]Rogério Reis
Apoo: an environment for a first course in assembly language programming. ACM SIGCSE Bull. 33(4): 43-47 (2001)
1990 – 1999
- 1990
- [c1]Miguel Filgueiras, Ana Paula Tomás, Nelma Moreira, Rogério Reis, José Paulo Leal:
Natural Language and Natural Menus Interfaces. Modelling the Innovation 1990: 299-306
Coauthor Index
[j41] [c50] [c49] [i17] [j40] [j39] [j38] [j37] [j36] [c48] [c47] [c46] [i16] [j35] [j34] [j33] [c45] [c44] [c43] [p1] [e6] [i15] [j32] [j31] [j30] [c42] [j29] [j28] [c41] [i14] [j27] [j26] [j25] [j24] [c40] [c39] [c38] [i13] [j23] [j22] [j21] [c37] [c36] [e5] [j20] [c35] [c34] [c33] [c32] [c31] [c30] [i12] [j18] [j17] [c29] [c28] [c27] [c26] [e4] [i11] [i10] [i9] [j13] [j12] [c25] [c24] [c22] [c20] [i8] [j11] [c18] [c17] [c16] [i6] [i5] [j10] [j9] [e2] [e1] [r1] [j8] [c14] [j7] [c13] [c12] [c11] [i4] [j6] [j5] [c10] [c9] [i3] [i2] [i1] [j4] [c8] [c7] [j2] [c6] [c5] [c4] [c3] [c2] [j1] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 22:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: