Pascal Weil

According to our database, Pascal Weil authored at least 71 papers between 1985 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages.

Bharat Adsul, Paul Gastin, Shantanu Kulkarni, Pascal Weil

CoRR, 2024

Random Generation of Subgroups of the Modular Group with a Fixed Isomorphism Type.

Frédérique Bassino, Cyril Nicaud, Pascal Weil

Electron. J. Comb., 2024

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

Bharat Adsul, Paul Gastin, Shantanu Kulkarni, Pascal Weil

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.

Mallika Roy, Enric Ventura, Pascal Weil

CoRR, 2023

2022

Asynchronous wreath product and cascade decompositions for concurrent behaviours.

Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil

Log. Methods Comput. Sci., 2022

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

Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil

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

2021

Statistics of subgroups of the modular group.

Frédérique Bassino, Cyril Nicaud, Pascal Weil

Int. J. Algebra Comput., 2021

Varieties.

Howard Straubing, Pascal Weil

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).

Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil

CoRR, 2020

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

Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil

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

On the Generalized Membership Problem in Relatively Hyperbolic Groups.

Olga Kharlampovich, Pascal Weil

Proceedings of the Fields of Logic and Computation III, 2020

2019

Foreword.

Pascal Weil

Theory Comput. Syst., 2019

Covering and separation for logical fragments with modular predicates.

Thomas Place, Varun Ramanathan, Pascal Weil

Log. Methods Comput. Sci., 2019

The Quantifier Alternation Hierarchy of Synchronous Relations.

Diego Figueira, Varun Ramanathan, Pascal Weil

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

2016

Generic properties of subgroups of free groups and finite presentations.

Frédérique Bassino, Cyril Nicaud, Pascal Weil

Proceedings of the Algebra and Computer Science, 2016

2015

Varieties.

Howard Straubing, Pascal Weil

CoRR, 2015

2014

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

Pascal Weil

CoRR, 2014

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

Pascal Weil

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

2013

Statistical properties of subgroups of free groups.

Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil

Random Struct. Algorithms, 2013

Branching Processes of General Petri Nets.

Jean-Michel Couvreur, Denis Poitrenaud, Pascal Weil

Fundam. Informaticae, 2013

On the genericity of Whitehead minimality.

Frédérique Bassino, Cyril Nicaud, Pascal Weil

CoRR, 2013

2012

Star-free languages are Church-Rosser congruential.

Volker Diekert, Manfred Kufleitner, Pascal Weil

Theor. Comput. Sci., 2012

On logical hierarchies within FO²-definable languages

Manfred Kufleitner, Pascal Weil

Log. Methods Comput. Sci., 2012

The FO^2 alternation hierarchy is decidable

Manfred Kufleitner, Pascal Weil

CoRR, 2012

The FO2 alternation hierarchy is decidable.

Manfred Kufleitner, Pascal Weil

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

An Introduction to Finite Automata and their Connection to Logic.

Howard Straubing, Pascal Weil

Proceedings of the Modern Applications of Automata Theory., 2012

2010

Preface of STACS 2007 Special Issue.

Wolfgang Thomas, Pascal Weil

Theory Comput. Syst., 2010

STACS 2008 Foreword.

Susanne Albers, Pascal Weil

Theory Comput. Syst., 2010

Automorphic orbits in Free Groups: Words versus Subgroups.

Pedro V. Silva, Pascal Weil

Int. J. Algebra Comput., 2010

Algebraic Characterization of Logically Defined Tree Languages.

Zoltán Ésik, Pascal Weil

Int. J. Algebra Comput., 2010

An introduction to finite automata and their connection to logic

Howard Straubing, Pascal Weil

CoRR, 2010

On Two Distributions of Subgroups of Free Groups.

Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil

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

2009

On FO2 Quantifier Alternation over Words.

Manfred Kufleitner, Pascal Weil

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.

Pedro V. Silva, Pascal Weil

RAIRO Theor. Informatics Appl., 2008

Random Generation of Finitely Generated Subgroups of a Free Group.

Frédérique Bassino, Cyril Nicaud, Pascal Weil

Int. J. Algebra Comput., 2008

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

Susanne Albers, Pascal Weil

Proceedings of the STACS 2008, 2008

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

Susanne Albers, Pascal Weil

Proceedings of the STACS 2008, 2008

2007

On the Complexity of the Whitehead Minimization Problem.

Abdó Roig, Enric Ventura, Pascal Weil

Int. J. Algebra Comput., 2007

2005

Algebraic recognizability of regular tree languages.

Zoltán Ésik, Pascal Weil

Theor. Comput. Sci., 2005

The recognizability of sets of graphs is a robust property.

Bruno Courcelle, Pascal Weil

Theor. Comput. Sci., 2005

2004

On the Logical Definability of Certain Graph and Poset Languages.

Pascal Weil

J. Autom. Lang. Comb., 2004

Algebraic Recognizability of Languages.

Pascal Weil

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003

On Logically Defined Recognizable Tree Languages.

Zoltán Ésik, Pascal Weil

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

2002

Profinite Methods in Semigroup Theory.

Pascal Weil

Int. J. Algebra Comput., 2002

Workshop on Logic, Graph Transformations and Discrete Structures.

Bruno Courcelle, Pascal Weil

Proceedings of the Graph Transformation, First International Conference, 2002

2001

A conjecture on the concatenation product.

Jean-Eric Pin, Pascal Weil

RAIRO Theor. Informatics Appl., 2001

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

Stuart W. Margolis, Mark V. Sapir, Pascal Weil

Int. J. Algebra Comput., 2001

Rationality in Algebras with a Series Operation.

Kamal Lodaya, Pascal Weil

Inf. Comput., 2001

Graphs, intersections of subgroups of free groups and corank.

Pascal Weil

Electron. Notes Discret. Math., 2001

2000

Series-parallel languages and the bounded-width property.

Kamal Lodaya, Pascal Weil

Theor. Comput. Sci., 2000

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

Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil

Theor. Comput. Sci., 2000

1999

Uniformities on Free Semigroups.

Jean-Eric Pin, Pascal Weil

Int. J. Algebra Comput., 1999

1998

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

Giovanna Guaiana, Raphaël Meyer, Antoine Petit, Pascal Weil

Inf. Process. Lett., 1998

Series-Parallel Posets: Algebra, Automata and Languages.

Kamal Lodaya, Pascal Weil

Proceedings of the STACS 98, 1998

A Kleene Iteration for Parallelism.

Kamal Lodaya, Pascal Weil

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

1997

Ponynominal Closure and Unambiguous Product.

Jean-Eric Pin, Pascal Weil

Theory Comput. Syst., 1997

Free Profinite ℛ-Trivial Monoids.

Jorge Almeida, Pascal Weil

Int. J. Algebra Comput., 1997

1996

On the Indecomposibility of Certain Language Classes.

Stuart W. Margolis, Mark V. Sapir, Pascal Weil

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

1995

Algebraic and Topological Theory of Languages.

John Rhodes, Pascal Weil

RAIRO Theor. Informatics Appl., 1995

Polynomial Closure and Unambiguous Product.

Jean-Eric Pin, Pascal Weil

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

1994

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

Jorge Almeida, Pascal Weil

Int. J. Algebra Comput., 1994

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

Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil

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

1992

On a Conjecture Concerning Dot-Depth Two Languages.

Howard Straubing, Pascal Weil

Theor. Comput. Sci., 1992

Closure of Varieties of Languages under Products with Counter.

Pascal Weil

J. Comput. Syst. Sci., 1992

1991

Semigroups with Idempotent stabilizers and Applications to Automata Theory.

Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil

Int. J. Algebra Comput., 1991

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

Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil

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

1990

Products of Languages with Counter.

Pascal Weil

Theor. Comput. Sci., 1990

1989

Inverse Monoids of Dot-Depth Two.

Pascal Weil

Theor. Comput. Sci., 1989

On Varieties of Languages Closed Under Products with Counter.

Pascal Weil

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1988

Concatenation product: a survey.

Pascal Weil

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

1985

Groups, Codes and Unambiguous Automata.

Pascal Weil

Proceedings of the STACS 85, 1985