default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSabine Broda
Person information
- affiliation: University of Porto, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j20]Sabine Broda
, António Machiavelo, Nelma Moreira, Rogério Reis:
Location automata for regular expressions with shuffle and intersection. Inf. Comput. 295(Part B): 104917 (2023)- [j19]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
Location automata for synchronised shuffle expressions. J. Log. Algebraic Methods Program. 132: 100847 (2023) - [c25]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions. CIAA 2023: 103-115 - 2021
- [j18]Sabine Broda, Eva Maia, Nelma Moreira, Rogério Reis:
The Prefix Automaton. J. Autom. Lang. Comb. 26(1-2): 17-53 (2021) - [c24]Sabine Broda:
Pregrammars and Intersection Types. CSL 2021: 14:1-14:22 - [c23]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Uniform Distribution of Regular Expressions. DCFS 2021: 13-25 - [c22]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
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
- [j17]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
Guest Column: Analytic Combinatorics and Descriptional Complexity of Regular Languages on Average. SIGACT News 51(1): 38-56 (2020)
2010 – 2019
- 2019
- [j16]Sabine Broda, Markus Holzer, Eva Maia, Nelma Moreira, Rogério Reis:
A mesh of automata. Inf. Comput. 265: 94-111 (2019) - [j15]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On Average Behaviour of Regular Expressions in Strong Star Normal Form. Int. J. Found. Comput. Sci. 30(6-7): 899-920 (2019) - 2018
- [j14]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
Automata for regular expressions with shuffle. Inf. Comput. 259(2): 162-173 (2018) - [j13]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) - [c21]Sandra Alves, Sabine Broda:
A Unifying Framework for Type Inhabitation. FSCD 2018: 5:1-5:16 - [c20]Sandra Alves, Sabine Broda:
Pre-grammars and Inhabitation for a Subset of Rank 2 Intersection Types. LSFA 2018: 25-45 - 2017
- [j12]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) - [c19]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Average Complexity of Strong Star Normal Form. DCFS 2017: 77-88 - [c18]Sabine Broda, Markus Holzer, Eva Maia, Nelma Moreira, Rogério Reis:
On the Mother of All Automata: The Position Automaton. DLT 2017: 134-146 - [c17]Sandra Alves, Sabine Broda:
Inhabitation machines: determinism and principality. NCMA 2017: 57-70 - 2016
- [c16]Rafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection. DCFS 2016: 45-59 - [c15]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
Position Automaton Construction for Regular Expressions with Intersection. DLT 2016: 51-63 - [i2]João Sá, Sandra Alves, Sabine Broda:
The G-ACM Tool: using the Drools Rule Engine for Access Control Management. CoRR abs/1611.08547 (2016) - 2015
- [j11]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
Average Size of Automata Constructions from Regular Expressions. Bull. EATCS 116 (2015) - [j10]Sandra Alves, Sabine Broda:
A short note on type-inhabitation: Formula-trees vs. game semantics. Inf. Process. Lett. 115(11): 908-911 (2015) - [c14]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
Partial Derivative Automaton for Regular Expressions with Shuffle. DCFS 2015: 21-32 - [c13]Sandra Alves, Sabine Broda, Maribel Fernández:
A Typed Language for Events. LOPSTR 2015: 107-123 - [c12]Sabine Broda, Sílvia Cavadas, Miguel Ferreira, Nelma Moreira:
Deciding Synchronous Kleene Algebra with Derivatives. CIAA 2015: 49-62 - [i1]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
Partial Derivative Automaton for Regular Expressions with Shuffle. CoRR abs/1503.00279 (2015) - 2014
- [j9]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
A Hitchhiker's Guide to descriptional complexity through analytic combinatorics. Theor. Comput. Sci. 528: 85-100 (2014) - [c11]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Equivalence of Automata for KAT-expressions. CiE 2014: 73-83 - 2013
- [c10]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Average Size of Glushkov and Equation Automata for KAT Expressions. FCT 2013: 72-83 - 2012
- [j8]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Average Size of Glushkov and Partial derivative Automata. Int. J. Found. Comput. Sci. 23(5): 969-984 (2012) - [c9]Ricardo Almeida, Sabine Broda, Nelma Moreira:
Deciding KAT and Hoare Logic with Derivatives. GandALF 2012: 127-140 - 2011
- [j7]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach. Int. J. Found. Comput. Sci. 22(7): 1593-1606 (2011) - [c8]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
The Average Transition Complexity of Glushkov and Partial Derivative Automata. Developments in Language Theory 2011: 93-104 - 2010
- [c7]Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Average Number of States of Partial Derivative Automata. Developments in Language Theory 2010: 112-123
2000 – 2009
- 2007
- [c6]Sabine Broda, Luís Damas:
On Principal Types of BCK- lambda -Terms. WoLLIC 2007: 120-130 - 2005
- [j6]Sabine Broda, Luís Damas:
On Long Normal Inhabitants of a Type. J. Log. Comput. 15(3): 353-390 (2005) - 2004
- [j5]Sabine Broda, Luís Damas, Marcelo Finger, Paulo Silva e Silva:
The decidability of a fragment of BB'IW-logic. Theor. Comput. Sci. 318(3): 373-408 (2004) - 2002
- [c5]Sabine Broda, Luís Damas:
Studying provability in implicational intuitionistic logic the formula tree approach. WoLLIC 2002: 131-147 - 2001
- [j4]Sabine Broda, Luís Damas:
Counting a Type's (Principal) Inhabitants. Fundam. Informaticae 45(1-2): 33-51 (2001) - [c4]Sabine Broda, Luís Damas:
A Context-Free Grammar Representation for Normal Inhabitants of Types in TAlambda. EPIA 2001: 321-334 - 2000
- [j3]Sabine Broda, Luís Damas:
On principal types of combinators. Theor. Comput. Sci. 247(1-2): 277-290 (2000)
1990 – 1999
- 1999
- [c3]Sabine Broda, Luís Damas:
Counting a Type's Principal Inhabitants. TLCA 1999: 69-82 - 1997
- [j2]Sabine Broda, Luís Damas:
On Combinatory Complete Sets of Proper Combinators. J. Funct. Program. 7(6): 593-612 (1997) - [j1]Sabine Broda, Luís Damas:
Compact Bracket Abstraction in Combinatory Logic. J. Symb. Log. 62(3): 729-740 (1997) - 1995
- [c2]Sabine Broda, Luís Damas:
A New Translation Algorithm from Lambda Calculus into Combinatory Logic. EPIA 1995: 359-370 - 1993
- [c1]Luís Damas, Nelma Moreira, Sabine Broda:
Resolution of Constraints in Algebras of Rational Trees. EPIA 1993: 61-76
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-06-10 21:28 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:
