Location automata for regular expressions with shuffle and intersection

Information and Computation

2023 | journal-article

Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions

2023 | book-chapter

Location automata for synchronised shuffle expressions

JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING

2023 | journal-article

Location Based Automata for Expressions with Shuffle

2021 | book-chapter

On the Uniform Distribution of Regular Expressions

DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2021

2021 | conference-paper

On the Uniform Distribution of Regular Expressions

CoRR

2021 | other

Pregrammars and Intersection Types

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

2021 | journal-article

The Prefix Automaton

J. Autom. Lang. Comb.

2021 | journal-article

Guest Column: Analytic Combinatorics and Descriptional Complexity of Regular Languages on Average

SIGACT News

2020 | journal-article

A mesh of automata

Information and Computation

2019 | journal-article

On Average Behaviour of Regular Expressions in Strong Star Normal Form

International Journal of Foundations of Computer Science

2019 | journal-article

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

Electronic Notes in Theoretical Computer Science

2019 | journal-article

A Unifying Framework for Type Inhabitation

FSCD 2018

2018 | conference-paper

A Unifying Framework for Type Inhabitation

3rd International Conference on Formal Structures for Computation and Deduction, FSCD 2018, July 9-12, 2018, Oxford, UK

2018 | conference-paper

Automata for regular expressions with shuffle

Information and Computation

2018 | journal-article

Position automata for semi-extended expressions

Journal of Automata, Languages and Combinatorics

2018 | journal-article

Inhabitation machines: determinism and principality

Ninth Workshop on Non-Classical Models of Automata and Applications, NCMA 2017, Prague, Czech Republic, August 17-18, 2017.

2017 | conference-paper

Inhabitation machines: determinism and principality

2017 | conference-paper

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

Journal of Automata, Languages and Combinatorics

2017 | journal-article

On the average complexity of strong star normal form

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

2017 | book

On the mother of all automata: The position automaton

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

2017 | book

On the state complexity of partial derivative automata for regular expressions with intersection

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

2016 | book

Position automaton construction for regular expressions with intersection

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

2016 | book

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

CoRR

2016 | other

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

Information Processing Letters

2015 | journal-article

A typed language for events

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

2015 | book

Average Size of Automata Constructions from Regular Expressions

Bulletin of the EATCS

2015 | journal-article

Deciding synchronous Kleene algebra with derivatives

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

2015 | book

Partial Derivative Automaton for Regular Expressions with Shuffle

CoRR

2015 | other

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)

2015 | book

A Hitchhiker's Guide to descriptional complexity through analytic combinatorics

Theoretical Computer Science

2014 | journal-article

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)

2014 | book

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)

2013 | book

Deciding KAT and Hoare logic with derivatives

Electronic Proceedings in Theoretical Computer Science, EPTCS

2012 | conference-paper

On the average size of glushkov and partial derivative automata

International Journal of Foundations of Computer Science

2012 | journal-article

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

International Journal of Foundations of Computer Science

2011 | journal-article

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)

2011 | book

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)

2010 | book

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

2010 | report

On principal types of BCK-λ-terms

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

2007 | book

On long normal inhabitants of a type

Journal of Logic and Computation

2005 | journal-article

The decidability of a fragment of BB′IW-logic

Theoretical Computer Science

2004 | journal-article

Studying provability in implicational intuitionistic logic: The formula tree approach

Electronic Notes in Theoretical Computer Science

2002 | journal-article

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)

2001 | book

Counting a type's (principal) inhabitants

Fundamenta Informaticae

2001 | journal-article

On principal types of combinators

Theoretical Computer Science

2000 | journal-article

Counting a type’s principal inhabitants

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

1999 | book

Compact bracket abstraction in combinatory logic

Journal of Symbolic Logic

1997 | journal-article

On combinatory complete sets of proper combinators

Journal of Functional Programming

1997 | journal-article

A new translation algorithm from lambda calculus into combinatory logic

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

1995 | book

Resolution of constraints in algebras of rational trees

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

1993 | book