Sabine Broda

Orcid: 0000-0002-3798-9348

Affiliations:
  • University of Porto, Portugal


According to our database1, Sabine Broda authored at least 45 papers between 1993 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Location automata for regular expressions with shuffle and intersection.
Inf. Comput., December, 2023

Location automata for synchronised shuffle expressions.
J. Log. Algebraic Methods Program., April, 2023

Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions.
Proceedings of the Implementation and Application of Automata, 2023

2021
The Prefix Automaton.
J. Autom. Lang. Comb., 2021

Location Based Automata for Expressions with Shuffle.
Proceedings of the Language and Automata Theory and Applications, 2021

On the Uniform Distribution of Regular Expressions.
Proceedings of the Descriptional Complexity of Formal Systems, 2021

Pregrammars and Intersection Types.
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020
Guest Column: Analytic Combinatorics and Descriptional Complexity of Regular Languages on Average.
SIGACT News, 2020

2019
On Average Behaviour of Regular Expressions in Strong Star Normal Form.
Int. J. Found. Comput. Sci., 2019

A mesh of automata.
Inf. Comput., 2019

2018
Position Automata for Semi-extended Expressions.
J. Autom. Lang. Comb., 2018

Automata for regular expressions with shuffle.
Inf. Comput., 2018

Pre-grammars and Inhabitation for a Subset of Rank 2 Intersection Types.
Proceedings of the 13th Workshop on Logical and Semantic Frameworks with Applications, 2018

A Unifying Framework for Type Inhabitation.
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

2017
On the Average Complexity of Partial Derivative Automata for Semi-extended Expressions.
J. Autom. Lang. Comb., 2017

Inhabitation machines: determinism and principality.
Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017

On the Mother of All Automata: The Position Automaton.
Proceedings of the Developments in Language Theory - 21st International Conference, 2017

On the Average Complexity of Strong Star Normal Form.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016
The G-ACM Tool: using the Drools Rule Engine for Access Control Management.
CoRR, 2016

Position Automaton Construction for Regular Expressions with Intersection.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection.
Proceedings of the Descriptional Complexity of Formal Systems, 2016

2015
A short note on type-inhabitation: Formula-trees vs. game semantics.
Inf. Process. Lett., 2015

Average Size of Automata Constructions from Regular Expressions.
Bull. EATCS, 2015

Deciding Synchronous Kleene Algebra with Derivatives.
Proceedings of the Implementation and Application of Automata, 2015

A Typed Language for Events.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2015

Partial Derivative Automaton for Regular Expressions with Shuffle.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014
A Hitchhiker's Guide to descriptional complexity through analytic combinatorics.
Theor. Comput. Sci., 2014

On the Equivalence of Automata for KAT-expressions.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013
On the Average Size of Glushkov and Equation Automata for KAT Expressions.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

2012
On the Average Size of Glushkov and Partial derivative Automata.
Int. J. Found. Comput. Sci., 2012

Deciding KAT and Hoare Logic with Derivatives
Proceedings of the Proceedings Third International Symposium on Games, 2012

2011
On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach.
Int. J. Found. Comput. Sci., 2011

The Average Transition Complexity of Glushkov and Partial Derivative Automata.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010
On the Average Number of States of Partial Derivative Automata.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2007
On Principal Types of BCK- <i>lambda</i> -Terms.
Proceedings of the Logic, 2007

2005
On Long Normal Inhabitants of a Type.
J. Log. Comput., 2005

2004
The decidability of a fragment of BB'IW-logic.
Theor. Comput. Sci., 2004

2002
Studying provability in implicational intuitionistic logic the formula tree approach.
Proceedings of the 9th Workhop on Logic, Language, Information and Computation, 2002

2001
Counting a Type's (Principal) Inhabitants.
Fundam. Informaticae, 2001

A Context-Free Grammar Representation for Normal Inhabitants of Types in TA<sub>lambda</sub>.
Proceedings of the Progress in Artificial Intelligence, 2001

2000
On principal types of combinators.
Theor. Comput. Sci., 2000

1997
Compact Bracket Abstraction in Combinatory Logic.
J. Symb. Log., 1997

On Combinatory Complete Sets of Proper Combinators.
J. Funct. Program., 1997

1995
A New Translation Algorithm from Lambda Calculus into Combinatory Logic.
Proceedings of the Progress in Artificial Intelligence, 1995

1993
Resolution of Constraints in Algebras of Rational Trees.
Proceedings of the Progress in Artificial Intelligence, 1993


  Loading...