Pascal Weil

Electron. J. Comb., 2024

An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2023

The central tree property and algorithmic problems on subgroups of free groups.

[BibT_eX]

[DOI]

Mallika Roy

Enric Ventura

CoRR, 2023

2022

Asynchronous wreath product and cascade decompositions for concurrent behaviours.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2022

Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021

Statistics of subgroups of the modular group.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2021

Varieties.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Automata Theory., 2021

2020

Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces (extended version).

[BibT_eX]

[DOI]

CoRR, 2020

Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Concurrency Theory, 2020

On the Generalized Membership Problem in Relatively Hyperbolic Groups.

[BibT_eX]

[DOI]

Olga Kharlampovich

Proceedings of the Fields of Logic and Computation III, 2020

2019

Foreword.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

Covering and separation for logical fragments with modular predicates.

[BibT_eX]

[DOI]

Thomas Place

Varun Ramanathan

Log. Methods Comput. Sci., 2019

The Quantifier Alternation Hierarchy of Synchronous Relations.

[BibT_eX]

[DOI]

Diego Figueira

Varun Ramanathan

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2016

Generic properties of subgroups of free groups and finite presentations.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Computer Science, 2016

2015

Varieties.

[BibT_eX]

[DOI]

CoRR, 2015

2014

From algebra to logic: there and back again - the story of a hierarchy.

[BibT_eX]

[DOI]

CoRR, 2014

From Algebra to Logic: There and Back Again The Story of a Hierarchy - (Invited Paper).

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013

Statistical properties of subgroups of free groups.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2013

Branching Processes of General Petri Nets.

[BibT_eX]

[DOI]

Jean-Michel Couvreur

Denis Poitrenaud

Fundam. Informaticae, 2013

On the genericity of Whitehead minimality.

[BibT_eX]

[DOI]

CoRR, 2013

2012

Star-free languages are Church-Rosser congruential.

[BibT_eX]

[DOI]

Volker Diekert

Theor. Comput. Sci., 2012

On logical hierarchies within FO<sup>2</sup>-definable languages

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

The FO^2 alternation hierarchy is decidable

[BibT_eX]

[DOI]

CoRR, 2012

The FO2 alternation hierarchy is decidable.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic (CSL'12), 2012

An Introduction to Finite Automata and their Connection to Logic.

[BibT_eX]

[DOI]

Proceedings of the Modern Applications of Automata Theory., 2012

2010

Preface of STACS 2007 Special Issue.

[BibT_eX]

[DOI]

Wolfgang Thomas

Theory Comput. Syst., 2010

STACS 2008 Foreword.

[BibT_eX]

[DOI]

Susanne Albers

Theory Comput. Syst., 2010

Automorphic orbits in Free Groups: Words versus Subgroups.

[BibT_eX]

[DOI]

Pedro V. Silva

Int. J. Algebra Comput., 2010

Algebraic Characterization of Logically Defined Tree Languages.

[BibT_eX]

[DOI]

Zoltán Ésik

Int. J. Algebra Comput., 2010

An introduction to finite automata and their connection to logic

[BibT_eX]

[DOI]

CoRR, 2010

On Two Distributions of Subgroups of Free Groups.

[BibT_eX]

[DOI]

Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

2009

On FO2 Quantifier Alternation over Words.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008

On an algorithm to decide whether a free group is a free factor of another.

[BibT_eX]

[DOI]

Pedro V. Silva

RAIRO Theor. Informatics Appl., 2008

Random Generation of Finitely Generated Subgroups of a Free Group.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2008

Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science.

[BibT_eX]

[DOI]

Susanne Albers

Proceedings of the STACS 2008, 2008

Preface - 25th International Symposium on Theoretical Aspects of Computer Science.

[BibT_eX]

[DOI]

Susanne Albers

Proceedings of the STACS 2008, 2008

2007

On the Complexity of the Whitehead Minimization Problem.

[BibT_eX]

[DOI]

Abdó Roig

Enric Ventura

Int. J. Algebra Comput., 2007

2005

Algebraic recognizability of regular tree languages.

[BibT_eX]

[DOI]

Zoltán Ésik

Theor. Comput. Sci., 2005

The recognizability of sets of graphs is a robust property.

[BibT_eX]

[DOI]

Bruno Courcelle

Theor. Comput. Sci., 2005

2004

On the Logical Definability of Certain Graph and Poset Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2004

Algebraic Recognizability of Languages.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003

On Logically Defined Recognizable Tree Languages.

[BibT_eX]

[DOI]

Zoltán Ésik

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002

Profinite Methods in Semigroup Theory.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2002

Workshop on Logic, Graph Transformations and Discrete Structures.

[BibT_eX]

[DOI]

Bruno Courcelle

Proceedings of the Graph Transformation, First International Conference, 2002

2001

A conjecture on the concatenation product.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2001

Closed Subgroups in Pro-V Topologies and the Extension Problem for Inverse Automata.

[BibT_eX]

[DOI]

Stuart W. Margolis

Mark V. Sapir

Int. J. Algebra Comput., 2001

Rationality in Algebras with a Series Operation.

[BibT_eX]

[DOI]

Inf. Comput., 2001

Graphs, intersections of subgroups of free groups and corank.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

2000

Series-parallel languages and the bounded-width property.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

PSPACE-complete problems for subgroups of free groups and inverse finite automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

1999

Uniformities on Free Semigroups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1999

1998

An Extension of the Wreath Product Principle for Finite Mazurkiewicz Traces.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Series-Parallel Posets: Algebra, Automata and Languages.

[BibT_eX]

[DOI]

Proceedings of the STACS 98, 1998

A Kleene Iteration for Parallelism.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1997

Ponynominal Closure and Unambiguous Product.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1997

Free Profinite ℛ-Trivial Monoids.

[BibT_eX]

[DOI]

Jorge Almeida

Int. J. Algebra Comput., 1997

1996

On the Indecomposibility of Certain Language Classes.

[BibT_eX]

Stuart W. Margolis

Mark V. Sapir

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995

Algebraic and Topological Theory of Languages.

[BibT_eX]

[DOI]

John Rhodes

RAIRO Theor. Informatics Appl., 1995

Polynomial Closure and Unambiguous Product.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994

Reduced Factorizations in Free Profinite Groups and Join Decompositions of Pseudovarieties.

[BibT_eX]

[DOI]

Jorge Almeida

Int. J. Algebra Comput., 1994

PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1992

On a Conjecture Concerning Dot-Depth Two Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Closure of Varieties of Languages under Products with Counter.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1992

1991

Semigroups with Idempotent stabilizers and Applications to Automata Theory.

[BibT_eX]

[DOI]

Bertrand Le Saëc

Int. J. Algebra Comput., 1991

A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words.

[BibT_eX]

[DOI]

Bertrand Le Saëc

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1990

Products of Languages with Counter.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

1989

Inverse Monoids of Dot-Depth Two.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

On Varieties of Languages Closed Under Products with Counter.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988

Concatenation product: a survey.

[BibT_eX]

[DOI]

Proceedings of the Formal Properties of Finite Automata and Applications, 1988

1985

Groups, Codes and Unambiguous Automata.

[BibT_eX]

[DOI]