Resolution of Constraints in Algebras of Rational Trees. - Luís Damas; Nelma Moreira; Sabine Broda (EPIA, 1993)

A New Translation Algorithm from Lambda Calculus into Combinatory Logic. - Sabine Broda; Luís Damas (EPIA, 1995)

On Combinatory Complete Sets of Proper Combinators. - Sabine Broda; Luís Damas (J. Funct. Program., 1997)

Compact Bracket Abstraction in Combinatory Logic. - Sabine Broda; Luís Damas (J. Symb. Log., 1997)

On principal types of combinators. - Sabine Broda; Luís Damas (Theor. Comput. Sci., 2000)

A Context-Free Grammar Representation for Normal Inhabitants of Types in TAlambda. - Sabine Broda; Luís Damas (EPIA, 2001)

Counting a Type's (Principal) Inhabitants. - Sabine Broda; Luís Damas (Fundam. Informaticae, 2001)

Studying provability in implicational intuitionistic logic the formula tree approach. - Sabine Broda; Luís Damas (WoLLIC, 2002)

The decidability of a fragment of BB'IW-logic. - Sabine Broda; Luís Damas; Marcelo Finger; Paulo Silva e Silva (Theor. Comput. Sci., 2004)

On Long Normal Inhabitants of a Type. - Sabine Broda; Luís Damas (J. Log. Comput., 2005)

On Principal Types of BCK- lambda -Terms. - Sabine Broda; Luís Damas (WoLLIC, 2007)

On the Average Number of States of Partial Derivative Automata. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (Developments in Language Theory, 2010)

The Average Transition Complexity of Glushkov and Partial Derivative Automata. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (Developments in Language Theory, 2011)

On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (Int. J. Found. Comput. Sci., 2011)

Deciding KAT and Hoare Logic with Derivatives - Ricardo Almeida 003; Sabine Broda; Nelma Moreira (GandALF, 2012)

On the Average Size of Glushkov and Partial derivative Automata. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (Int. J. Found. Comput. Sci., 2012)

On the Average Size of Glushkov and Equation Automata for KAT Expressions. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (FCT, 2013)

On the Equivalence of Automata for KAT-expressions. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (CiE, 2014)

A Hitchhiker's Guide to descriptional complexity through analytic combinatorics. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (Theor. Comput. Sci., 2014)

Partial Derivative Automaton for Regular Expressions with Shuffle. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (DCFS, 2015)

A Typed Language for Events. - Sandra Alves; Sabine Broda; Maribel Fernández (LOPSTR, 2015)

Deciding Synchronous Kleene Algebra with Derivatives. - Sabine Broda; Sílvia Cavadas; Miguel Ferreira; Nelma Moreira (CIAA, 2015)

Average Size of Automata Constructions from Regular Expressions. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (Bull. EATCS, 2015)

A short note on type-inhabitation: Formula-trees vs. game semantics. - Sandra Alves; Sabine Broda (Inf. Process. Lett., 2015)

On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection. - Rafaela Bastos; Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (DCFS, 2016)

Position Automaton Construction for Regular Expressions with Intersection. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (DLT, 2016)

The G-ACM Tool: using the Drools Rule Engine for Access Control Management. - João Sá; Sandra Alves; Sabine Broda (CoRR, 2016)

On the Average Complexity of Strong Star Normal Form. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (DCFS, 2017)

On the Mother of All Automata: The Position Automaton. - Sabine Broda; Markus Holzer 001; Eva Maia; Nelma Moreira; Rogério Reis (DLT, 2017)

Inhabitation machines: determinism and principality. - Sandra Alves; Sabine Broda (NCMA, 2017)

On the Average Complexity of Partial Derivative Automata for Semi-extended Expressions. - Rafaela Bastos; Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (J. Autom. Lang. Comb., 2017)

A Unifying Framework for Type Inhabitation. - Sandra Alves; Sabine Broda (FSCD, 2018)

Pre-grammars and Inhabitation for a Subset of Rank 2 Intersection Types. - Sandra Alves; Sabine Broda (LSFA, 2018)

Automata for regular expressions with shuffle. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (Inf. Comput., 2018)

Position Automata for Semi-extended Expressions. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (J. Autom. Lang. Comb., 2018)

A mesh of automata. - Sabine Broda; Markus Holzer 001; Eva Maia; Nelma Moreira; Rogério Reis (Inf. Comput., 2019)

On Average Behaviour of Regular Expressions in Strong Star Normal Form. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (Int. J. Found. Comput. Sci., 2019)

Guest Column: Analytic Combinatorics and Descriptional Complexity of Regular Languages on Average. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (SIGACT News, 2020)

Pregrammars and Intersection Types. - Sabine Broda (CSL, 2021)

On the Uniform Distribution of Regular Expressions. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (DCFS, 2021)

Location Based Automata for Expressions with Shuffle. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (LATA, 2021)

The Prefix Automaton. - Sabine Broda; Eva Maia; Nelma Moreira; Rogério Reis (J. Autom. Lang. Comb., 2021)

Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (CIAA, 2023)

Location automata for synchronised shuffle expressions. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (J. Log. Algebraic Methods Program., 2023)

Location automata for regular expressions with shuffle and intersection. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (Inf. Comput., 2023)

Automata for Synchronised Shuffle on Backbones. - Sabine Broda; António Machiavelo; Nelma Moreira; Rogério Reis (DCFS, 2025)