Pascal Weil

Affiliations:
  • University of Bordeaux 1, LABRI, France


According to our database1, Pascal Weil authored at least 68 papers between 1985 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
The central tree property and algorithmic problems on subgroups of free groups.
CoRR, 2023

2022
Asynchronous wreath product and cascade decompositions for concurrent behaviours.
Log. Methods Comput. Sci., 2022

Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages.
Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021
Statistics of subgroups of the modular group.
Int. J. Algebra Comput., 2021

Varieties.
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).
CoRR, 2020

Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

On the Generalized Membership Problem in Relatively Hyperbolic Groups.
Proceedings of the Fields of Logic and Computation III, 2020

2019
Foreword.
Theory Comput. Syst., 2019

Covering and separation for logical fragments with modular predicates.
Log. Methods Comput. Sci., 2019

The Quantifier Alternation Hierarchy of Synchronous Relations.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2016
Generic properties of subgroups of free groups and finite presentations.
Proceedings of the Algebra and Computer Science, 2016

2015
Varieties.
CoRR, 2015

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

From Algebra to Logic: There and Back Again The Story of a Hierarchy - (Invited Paper).
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013
Statistical properties of subgroups of free groups.
Random Struct. Algorithms, 2013

Branching Processes of General Petri Nets.
Fundam. Informaticae, 2013

On the genericity of Whitehead minimality.
CoRR, 2013

2012
Star-free languages are Church-Rosser congruential.
Theor. Comput. Sci., 2012

On logical hierarchies within FO<sup>2</sup>-definable languages
Log. Methods Comput. Sci., 2012

The FO^2 alternation hierarchy is decidable
CoRR, 2012

The FO2 alternation hierarchy is decidable.
Proceedings of the Computer Science Logic (CSL'12), 2012

An Introduction to Finite Automata and their Connection to Logic.
Proceedings of the Modern Applications of Automata Theory., 2012

2010
Preface of STACS 2007 Special Issue.
Theory Comput. Syst., 2010

STACS 2008 Foreword.
Theory Comput. Syst., 2010

Automorphic orbits in Free Groups: Words versus Subgroups.
Int. J. Algebra Comput., 2010

Algebraic Characterization of Logically Defined Tree Languages.
Int. J. Algebra Comput., 2010

An introduction to finite automata and their connection to logic
CoRR, 2010

On Two Distributions of Subgroups of Free Groups.
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

2009
On FO2 Quantifier Alternation over Words.
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.
RAIRO Theor. Informatics Appl., 2008

Random Generation of Finitely Generated Subgroups of a Free Group.
Int. J. Algebra Comput., 2008

Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science.
Proceedings of the STACS 2008, 2008

Preface - 25th International Symposium on Theoretical Aspects of Computer Science.
Proceedings of the STACS 2008, 2008

2007
On the Complexity of the Whitehead Minimization Problem.
Int. J. Algebra Comput., 2007

2005
Algebraic recognizability of regular tree languages.
Theor. Comput. Sci., 2005

The recognizability of sets of graphs is a robust property.
Theor. Comput. Sci., 2005

2004
On the Logical Definability of Certain Graph and Poset Languages.
J. Autom. Lang. Comb., 2004

Algebraic Recognizability of Languages.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003
On Logically Defined Recognizable Tree Languages.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002
Profinite Methods in Semigroup Theory.
Int. J. Algebra Comput., 2002

Workshop on Logic, Graph Transformations and Discrete Structures.
Proceedings of the Graph Transformation, First International Conference, 2002

2001
A conjecture on the concatenation product.
RAIRO Theor. Informatics Appl., 2001

Closed Subgroups in Pro-V Topologies and the Extension Problem for Inverse Automata.
Int. J. Algebra Comput., 2001

Rationality in Algebras with a Series Operation.
Inf. Comput., 2001

Graphs, intersections of subgroups of free groups and corank.
Electron. Notes Discret. Math., 2001

2000
Series-parallel languages and the bounded-width property.
Theor. Comput. Sci., 2000

PSPACE-complete problems for subgroups of free groups and inverse finite automata.
Theor. Comput. Sci., 2000

1999
Uniformities on Free Semigroups.
Int. J. Algebra Comput., 1999

1998
An Extension of the Wreath Product Principle for Finite Mazurkiewicz Traces.
Inf. Process. Lett., 1998

Series-Parallel Posets: Algebra, Automata and Languages.
Proceedings of the STACS 98, 1998

A Kleene Iteration for Parallelism.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998

1997
Ponynominal Closure and Unambiguous Product.
Theory Comput. Syst., 1997

Free Profinite ℛ-Trivial Monoids.
Int. J. Algebra Comput., 1997

1996
On the Indecomposibility of Certain Language Classes.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995
Algebraic and Topological Theory of Languages.
RAIRO Theor. Informatics Appl., 1995

Polynomial Closure and Unambiguous Product.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994
Reduced Factorizations in Free Profinite Groups and Join Decompositions of Pseudovarieties.
Int. J. Algebra Comput., 1994

PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1992
On a Conjecture Concerning Dot-Depth Two Languages.
Theor. Comput. Sci., 1992

Closure of Varieties of Languages under Products with Counter.
J. Comput. Syst. Sci., 1992

1991
Semigroups with Idempotent stabilizers and Applications to Automata Theory.
Int. J. Algebra Comput., 1991

A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1990
Products of Languages with Counter.
Theor. Comput. Sci., 1990

1989
Inverse Monoids of Dot-Depth Two.
Theor. Comput. Sci., 1989

On Varieties of Languages Closed Under Products with Counter.
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988
Concatenation product: a survey.
Proceedings of the Formal Properties of Finite Automata and Applications, 1988

1985
Groups, Codes and Unambiguous Automata.
Proceedings of the STACS 85, 1985


  Loading...