Sabine Broda

Sabine Broda

Algebra
Semigroups, Automata and Languages

Faculdade de Ciências da Universidade do Porto

.
ORCID Authenticus ID

Publications

Add new publicationAdd Preprint

2015

Average Size of Automata Constructions from Regular Expressions

Bulletin of the EATCS

A Machiavelo

Deciding synchronous Kleene algebra with derivatives

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

S. Cavadas

M. Ferreira

N. Moreira

Partial derivative automaton for regular expressions with shuffle

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

N. Moreira

R. Reis

Partial Derivative Automaton for Regular Expressions with Shuffle

CoRR

A Machiavelo

N Moreira

2014

A Hitchhiker's Guide to descriptional complexity through analytic combinatorics

Theoretical Computer Science

Locators: DOI

On the equivalence of automata for KAT-expressions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

N. Moreira

R. Reis

2013

On the average size of Glushkov and equation automata for KAT expressions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

N. Moreira

R. Reis

2012

On the average size of glushkov and partial derivative automata

International Journal of Foundations of Computer Science

Locators: DOI

2011

On the average state complexity of partial derivative automata: An analytic combinatorics approach

International Journal of Foundations of Computer Science

Locators: DOI

The average transition complexity of glushkov and partial derivative automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

N. Moreira

R. Reis

2010

On the average number of states of partial derivative automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Locators: DOI

N. Moreira

R. Reis

On the average size of pd automata: an analytic combinatorics approach

2007

On principal types of BCK-λ-terms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

L. Damas

2005

On long normal inhabitants of a type

Journal of Logic and Computation

Locators: DOI

L. Damas

2004

The decidability of a fragment of BB′IW-logic

Theoretical Computer Science

Locators: DOI

L. Damas

M. Finger

P. Silva e Silva

2002

Studying provability in implicational intuitionistic logic: The formula tree approach

Electronic Notes in Theoretical Computer Science

Locators: DOI

L. Damas

2001

A context-free grammar representation for normal inhabitants of types in TAλ

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

L. Damas

Counting a type's (principal) inhabitants

Fundamenta Informaticae

L. Damas

2000

On principal types of combinators

Theoretical Computer Science

Locators: DOI

L. Damas

1999

Counting a type’s principal inhabitants

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

L. Damas