default search action
António Machiavelo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j17]Sabine Broda
, António Machiavelo
Location automata for regular expressions with shuffle and intersection. Inf. Comput. 295(Part B): 104917 (2023) - [j16]Sabine Broda
Location automata for synchronised shuffle expressions. J. Log. Algebraic Methods Program. 132: 100847 (2023) - [j15]Stavros Konstantinidis, António Machiavelo
On the average complexity of partial derivative transducers. Theor. Comput. Sci. 956: 113830 (2023) - [c16]Sabine Broda
Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions. CIAA 2023: 103-115 - 2021
- [j14]Stavros Konstantinidis, António Machiavelo
On the size of partial derivatives and the word membership problem. Acta Informatica 58(4): 357-375 (2021) - [c15]Sabine Broda
On the Uniform Distribution of Regular Expressions. DCFS 2021: 13-25 - [c14]Stavros Konstantinidis, António Machiavelo
Partial Derivative Automaton by Compressing Regular Expressions. DCFS 2021: 100-112 - [c13]Sabine Broda
Location Based Automata for Expressions with Shuffle. LATA 2021: 43-54 - [i3]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Uniform Distribution of Regular Expressions. CoRR abs/2103.13175 (2021) - 2020
- [j13]Sabine Broda
Guest Column: Analytic Combinatorics and Descriptional Complexity of Regular Languages on Average. SIGACT News 51(1): 38-56 (2020) - [c12]Stavros Konstantinidis, António Machiavelo
On the Average State Complexity of Partial Derivative Transducers. SOFSEM 2020: 174-186
2010 – 2019
- 2019
- [j12]Sabine Broda
On Average Behaviour of Regular Expressions in Strong Star Normal Form. Int. J. Found. Comput. Sci. 30(6-7): 899-920 (2019) - 2018
- [j11]Sabine Broda
Automata for regular expressions with shuffle. Inf. Comput. 259(2): 162-173 (2018) - [j10]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) - 2017
- [j9]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) - [c11]Sabine Broda
On the Average Complexity of Strong Star Normal Form. DCFS 2017: 77-88 - 2016
- [c10]Rafaela Bastos, Sabine Broda
On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection. DCFS 2016: 45-59 - [c9]Sabine Broda
Position Automaton Construction for Regular Expressions with Intersection. DLT 2016: 51-63 - 2015
- [j8]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
Average Size of Automata Constructions from Regular Expressions. Bull. EATCS 116 (2015) - [j7]Ivone Amorim
On the Number of Linear Finite Transducers. Int. J. Found. Comput. Sci. 26(7): 873-894 (2015) - [c8]Sabine Broda
Partial Derivative Automaton for Regular Expressions with Shuffle. DCFS 2015: 21-32 - [i2]Sabine Broda
Partial Derivative Automaton for Regular Expressions with Shuffle. CoRR abs/1503.00279 (2015) - 2014
- [j6]Ivone Amorim
On the invertibility of finite linear transducers. RAIRO Theor. Informatics Appl. 48(1): 107-125 (2014) - [j5]Sabine Broda
A Hitchhiker's Guide to descriptional complexity through analytic combinatorics. Theor. Comput. Sci. 528: 85-100 (2014) - [c7]Sabine Broda
On the Equivalence of Automata for KAT-expressions. CiE 2014: 73-83 - [c6]Ivone Amorim, António Machiavelo, Rogério Reis:
Statistical study on the number of injective linear finite transducers. NCMA 2014: 57-72 - [c5]Ivone Amorim
Counting Equivalent Linear Finite Transducers Using a Canonical Form. CIAA 2014: 70-83 - [i1]Ivone Amorim, António Machiavelo, Rogério Reis:
Statistical Study On The Number Of Injective Linear Finite Transducers. CoRR abs/1407.0169 (2014) - 2013
- [c4]Sabine Broda
On the Average Size of Glushkov and Equation Automata for KAT Expressions. FCT 2013: 72-83 - 2012
- [j4]Sabine Broda
On the Average Size of Glushkov and Partial derivative Automata. Int. J. Found. Comput. Sci. 23(5): 969-984 (2012) - [c3]Ivone Amorim, António Machiavelo, Rogério Reis:
Formal Power Series and the Invertibility of Finite Linear Transducers. NCMA 2012: 33-48 - 2011
- [j3]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) - [c2]Sabine Broda
The Average Transition Complexity of Glushkov and Partial Derivative Automata. Developments in Language Theory 2011: 93-104 - 2010
- [c1]Sabine Broda
On the Average Number of States of Partial Derivative Automata. Developments in Language Theory 2010: 112-123
2000 – 2009
- 2007
- [j2]António Machiavelo
Automated Ciphertext - Only Cryptanalysis of the Bifid Cipher. Cryptologia 31(2): 112-124 (2007) - 2004
- [j1]Markus Hunziker, António Machiavelo
Chebyshev polynomials over finite fields and reversibility of -automata on square grids. Theor. Comput. Sci. 320(2-3): 465-483 (2004)
Coauthor Index
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-10-07 22:21 CEST 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: