Sabine Broda

发表

A mesh of automata

Nelma Moreira, Rogério Reis, Markus Holzer, 2019, Inf. Comput..

A Typed Language for Events

Maribel Fernández, Sandra Alves, Sabine Broda, 2015, LOPSTR.

Resolution of Constraints in Algebras of Rational Trees

Nelma Moreira, Sabine Broda, Luís Damas, 1993, EPIA.

A Hitchhiker's Guide to descriptional complexity through analytic combinatorics

Nelma Moreira, Rogério Reis, Sabine Broda, 2014, Theor. Comput. Sci..

A Context-Free Grammar Representation for Normal Inhabitants of Types in TAlambda

Sabine Broda, Luís Damas, 2001, EPIA.

On the Average Number of States of Partial Derivative Automata

Nelma Moreira, Rogério Reis, Sabine Broda, 2010, Developments in Language Theory.

On the Average Complexity of Partial Derivative Automata for Semi-extended Expressions

Nelma Moreira, Rogério Reis, Sabine Broda, 2017, J. Autom. Lang. Comb..

On the Average Size of Glushkov and Partial derivative Automata

Nelma Moreira, Rogério Reis, Sabine Broda, 2012, Int. J. Found. Comput. Sci..

Position Automata for Semi-extended Expressions

Nelma Moreira, Rogério Reis, Sabine Broda, 2018, J. Autom. Lang. Comb..

On Combinatory Complete Sets of Proper Combinators

Sabine Broda, Luís Damas, 1997, J. Funct. Program..

Average Size of Automata Constructions from Regular Expressions

Nelma Moreira, Rogério Reis, Sabine Broda, 2015, Bull. EATCS.

Guest Column

Nelma Moreira, Sabine Broda, Antonio Machiavelo, 2020, SIGACT News.

Pre-grammars and Inhabitation for a Subset of Rank 2 Intersection Types

Sabine Broda, Sandra Alves, 2018, LSFA.

On the Average Size of Glushkov and Equation Automata for KAT Expressions

Nelma Moreira, Rogério Reis, Sabine Broda, 2013, FCT.

On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach

Nelma Moreira, Rogério Reis, Sabine Broda, 2011, Int. J. Found. Comput. Sci..

Counting a Type's (Principal) Inhabitants

Sabine Broda, Luís Damas, 1999, Fundam. Informaticae.

Partial Derivative Automaton for Regular Expressions with Shuffle pdf

Nelma Moreira, Rogério Reis, Sabine Broda, 2015, DCFS.

Descriptional Complexity of Formal Systems

Nelma Moreira, Rogério Reis, Sabine Broda, 2017, Lecture Notes in Computer Science.

The G-ACM Tool: using the Drools Rule Engine for Access Control Management pdf

Sandra Alves, Sabine Broda, João Sá, 2016, ArXiv.

On principal types of combinators

Sabine Broda, Luís Damas, 2000, Theor. Comput. Sci..

A New Translation Algorithm from Lambda Calculus into Combinatory Logic

Sabine Broda, Luís Damas, L. Damas, 1995, EPIA.

Studying provability in implicational intuitionistic logic the formula tree approach

Sabine Broda, Luís Damas, 2002, Electron. Notes Theor. Comput. Sci..

On Average Behaviour of Regular Expressions in Strong Star Normal Form

Nelma Moreira, Rogério Reis, Sabine Broda, 2019, Int. J. Found. Comput. Sci..

Pregrammars and Intersection Types

Sabine Broda, Sabine Broda, 2021, CSL.

A Unifying Framework for Type Inhabitation

Sandra Alves, Sabine Broda, 2018, FSCD.

On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection

Nelma Moreira, Rogério Reis, Sabine Broda, 2016, DCFS.

Compact bracket abstraction in combinatory logic

Sabine Broda, Luís Damas, L. Damas, 1997, Journal of Symbolic Logic.

Position Automaton Construction for Regular Expressions with Intersection

Nelma Moreira, Rogério Reis, Sabine Broda, 2016, DLT.

The Average Transition Complexity of Glushkov and Partial Derivative Automata

Nelma Moreira, Rogério Reis, Sabine Broda, 2011, Developments in Language Theory.

Automata for regular expressions with shuffle

Nelma Moreira, Rogério Reis, Sabine Broda, 2018, Inf. Comput..

On the Average Complexity of Strong Star Normal Form

Nelma Moreira, Rogério Reis, Sabine Broda, 2017, DCFS.

A short note on type-inhabitation: Formula-trees vs. game semantics

Sandra Alves, Sabine Broda, Sandra Alves, 2015, Inf. Process. Lett..

Inhabitation machines: determinism and principality

Sandra Alves, Sabine Broda, Sandra Alves, 2017, NCMA.

Deciding KAT and Hoare Logic with Derivatives

Nelma Moreira, Ricardo Almeida, Sabine Broda, 2012, GandALF.

On the Equivalence of Automata for KAT-expressions

Nelma Moreira, Rogério Reis, Sabine Broda, 2014, CiE.

On Principal Types of BCK- lambda -Terms

Sabine Broda, Luís Damas, L. Damas, 2007, WoLLIC.

On Long Normal Inhabitants of a Type

Sabine Broda, Luís Damas, L. Damas, 2005, J. Log. Comput..

Deciding Synchronous Kleene Algebra with Derivatives

Nelma Moreira, Miguel Ferreira, Sabine Broda, 2015, CIAA.

On the Mother of All Automata: The Position Automaton

Nelma Moreira, Rogério Reis, Markus Holzer, 2017, DLT.

The decidability of a fragment of BB'IW-logic

Paulo J. S. Silva, Marcelo Finger, Sabine Broda, 2004, Theor. Comput. Sci..

The Prefix Automaton

Nelma Moreira, Rogério Reis, Sabine Broda, 2021, J. Autom. Lang. Comb..

Location Based Automata for Expressions with Shuffle

Nelma Moreira, Rogério Reis, Sabine Broda, 2021, LATA.

On the Uniform Distribution of Regular Expressions

Nelma Moreira, Sabine Broda, Ant'onio Machiavelo, 2021, DCFS.

Study of the average size of Glushkov and Partial Derivative Automata

Nelma Moreira, Rogério Reis, Sabine Broda, 2012 .