Pascal Weil

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 15

Top Topics

Logical Formulas

Boolean Algebra

Propositional Dynamic Logic

Mazurkiewicz Traces

Top Venues

Log. Methods Comput. Sci.

Developments in Language Theory

Publications

Bharat Adsul, Paul Gastin, Shantanu Kulkarni, Pascal Weil
An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications. LICS (2024)
Bharat Adsul, Paul Gastin, Shantanu Kulkarni, Pascal Weil
Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages. CoRR (2024)
Mallika Roy, Enric Ventura, Pascal Weil
The central tree property and algorithmic problems on subgroups of free groups. CoRR (2023)
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
Asynchronous wreath product and cascade decompositions for concurrent behaviours. Log. Methods Comput. Sci. 18 (2) (2022)
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages. CONCUR (2022)
Frédérique Bassino, Cyril Nicaud, Pascal Weil
Statistics of subgroups of the modular group. Int. J. Algebra Comput. 31 (8) (2021)
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
Asynchronous wreath product and cascade decompositions for concurrent behaviours. CoRR (2021)
Olga Kharlampovich, Pascal Weil
On the Generalized Membership Problem in Relatively Hyperbolic Groups. Fields of Logic and Computation III (2020)
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces (extended version). CoRR (2020)
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces. CONCUR (2020)
Pascal Weil
Foreword. Theory Comput. Syst. 63 (4) (2019)
Diego Figueira, Varun Ramanathan, Pascal Weil
The Quantifier Alternation Hierarchy of Synchronous Relations. MFCS (2019)
Thomas Place, Varun Ramanathan, Pascal Weil
Covering and separation for logical fragments with modular predicates. Log. Methods Comput. Sci. 15 (2) (2019)
Thomas Place, Varun Ramanathan, Pascal Weil
Covering and separation for logical fragments with modular predicates. CoRR (2018)
Frédérique Bassino, Cyril Nicaud, Pascal Weil
Generic properties of subgroups of free groups and finite presentations. AMS-EMS-SPM Joint Meeting (2016)
Howard Straubing, Pascal Weil
Varieties. CoRR (2015)
Frédérique Bassino, Cyril Nicaud, Pascal Weil
Generic properties of subgroups of free groups and finite presentations. CoRR (2015)
Pascal Weil
From algebra to logic: there and back again - the story of a hierarchy. CoRR (2014)
Pascal Weil
From Algebra to Logic: There and Back Again The Story of a Hierarchy - (Invited Paper). Developments in Language Theory (2014)
Jean-Michel Couvreur, Denis Poitrenaud, Pascal Weil
Branching Processes of General Petri Nets. Fundam. Informaticae 122 (1-2) (2013)
Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil
Statistical properties of subgroups of free groups. Random Struct. Algorithms 42 (3) (2013)
Frédérique Bassino, Cyril Nicaud, Pascal Weil
On the genericity of Whitehead minimality. CoRR (2013)
Manfred Kufleitner, Pascal Weil
The FO2 alternation hierarchy is decidable. CSL (2012)
Volker Diekert, Manfred Kufleitner, Pascal Weil
Star-free languages are Church-Rosser congruential. Theor. Comput. Sci. 454 (2012)
Manfred Kufleitner, Pascal Weil
-definable languages Log. Methods Comput. Sci. 8 (3) (2012)
Manfred Kufleitner, Pascal Weil
The FO^2 alternation hierarchy is decidable CoRR (2012)
Volker Diekert, Manfred Kufleitner, Pascal Weil
Star-Free Languages are Church-Rosser Congruential CoRR (2011)
Jean-Michel Couvreur, Denis Poitrenaud, Pascal Weil
Branching Processes of General Petri Nets. Petri Nets (2011)
Susanne Albers, Pascal Weil
STACS 2008 Foreword. Theory Comput. Syst. 47 (3) (2010)
Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil
On Two Distributions of Subgroups of Free Groups. ANALCO (2010)
Wolfgang Thomas, Pascal Weil
Preface of STACS 2007 Special Issue. Theory Comput. Syst. 46 (3) (2010)
Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil
Statistical properties of subgroups of free groups CoRR (2010)
Zoltán Ésik, Pascal Weil
Algebraic Characterization of Logically Defined Tree Languages. Int. J. Algebra Comput. 20 (2) (2010)
Pedro V. Silva, Pascal Weil
Automorphic orbits in Free Groups: Words versus Subgroups. Int. J. Algebra Comput. 20 (4) (2010)
Howard Straubing, Pascal Weil
An introduction to finite automata and their connection to logic CoRR (2010)
Manfred Kufleitner, Pascal Weil
On FO2 Quantifier Alternation over Words. MFCS (2009)
Manfred Kufleitner, Pascal Weil
On FO2 quantifier alternation over words CoRR (2009)
Susanne Albers, Pascal Weil
Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science. STACS (2008)
Susanne Albers, Pascal Weil
Preface - 25th International Symposium on Theoretical Aspects of Computer Science. STACS (2008)
Pedro V. Silva, Pascal Weil
On an algorithm to decide whether a free group is a free factor of another. RAIRO Theor. Informatics Appl. 42 (2) (2008)
Frédérique Bassino, Cyril Nicaud, Pascal Weil
Random Generation of Finitely Generated Subgroups of a Free Group. Int. J. Algebra Comput. 18 (2) (2008)
Zoltán Ésik, Pascal Weil
Algebraic characterization of logically defined tree languages CoRR (2007)
Abdó Roig, Enric Ventura, Pascal Weil
On the Complexity of the Whitehead Minimization Problem. Int. J. Algebra Comput. 17 (8) (2007)
Pascal Weil
On the logical definability of certain graph and poset languages CoRR (2006)
Bruno Courcelle, Pascal Weil
The recognizability of sets of graphs is a robust property CoRR (2006)
Zoltán Ésik, Pascal Weil
Algebraic recognizability of regular tree languages CoRR (2006)
Pascal Weil
Algebraic recognizability of languages CoRR (2006)
Zoltán Ésik, Pascal Weil
Algebraic recognizability of regular tree languages. Theor. Comput. Sci. 340 (1) (2005)
Bruno Courcelle, Pascal Weil
The recognizability of sets of graphs is a robust property. Theor. Comput. Sci. 342 (2-3) (2005)
Pascal Weil
On the Logical Definability of Certain Graph and Poset Languages. J. Autom. Lang. Comb. 9 (1) (2004)
Pascal Weil
Algebraic Recognizability of Languages. MFCS (2004)
Zoltán Ésik, Pascal Weil
On Logically Defined Recognizable Tree Languages. FSTTCS (2003)
Bruno Courcelle, Pascal Weil
Workshop on Logic, Graph Transformations and Discrete Structures. ICGT (2002)
Pascal Weil
Profinite Methods in Semigroup Theory. Int. J. Algebra Comput. 12 (1-2) (2002)
Kamal Lodaya, Pascal Weil
Rationality in Algebras with a Series Operation. Inf. Comput. 171 (2) (2001)
Stuart W. Margolis, Mark V. Sapir, Pascal Weil
Closed Subgroups in Pro-V Topologies and the Extension Problem for Inverse Automata. Int. J. Algebra Comput. 11 (4) (2001)
Pascal Weil
Graphs, intersections of subgroups of free groups and corank. Electron. Notes Discret. Math. 10 (2001)
Jean-Eric Pin, Pascal Weil
A conjecture on the concatenation product. RAIRO Theor. Informatics Appl. 35 (6) (2001)
Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil
PSPACE-complete problems for subgroups of free groups and inverse finite automata. Theor. Comput. Sci. 242 (1-2) (2000)
Kamal Lodaya, Pascal Weil
Series-parallel languages and the bounded-width property. Theor. Comput. Sci. 237 (1-2) (2000)
Jean-Eric Pin, Pascal Weil
Uniformities on Free Semigroups. Int. J. Algebra Comput. 9 (3-4) (1999)
Kamal Lodaya, Pascal Weil
Series-Parallel Posets: Algebra, Automata and Languages. STACS (1998)
Kamal Lodaya, Pascal Weil
A Kleene Iteration for Parallelism. FSTTCS (1998)
Giovanna Guaiana, Raphaël Meyer, Antoine Petit, Pascal Weil
An Extension of the Wreath Product Principle for Finite Mazurkiewicz Traces. Inf. Process. Lett. 67 (6) (1998)
Jorge Almeida, Pascal Weil
Free Profinite ℛ-Trivial Monoids. Int. J. Algebra Comput. 7 (5) (1997)
Jean-Eric Pin, Pascal Weil
Ponynominal Closure and Unambiguous Product. Theory Comput. Syst. 30 (4) (1997)
Stuart W. Margolis, Mark V. Sapir, Pascal Weil
On the Indecomposibility of Certain Language Classes. ISTCS (1996)
John Rhodes, Pascal Weil
Algebraic and Topological Theory of Languages. RAIRO Theor. Informatics Appl. 29 (1) (1995)
Jean-Eric Pin, Pascal Weil
Polynomial Closure and Unambiguous Product. ICALP (1995)
Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil
PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups. ICALP (1994)
Jorge Almeida, Pascal Weil
Reduced Factorizations in Free Profinite Groups and Join Decompositions of Pseudovarieties. Int. J. Algebra Comput. 4 (3) (1994)
Pascal Weil
Closure of Varieties of Languages under Products with Counter. J. Comput. Syst. Sci. 45 (3) (1992)
Howard Straubing, Pascal Weil
On a Conjecture Concerning Dot-Depth Two Languages. Theor. Comput. Sci. 104 (2) (1992)
Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil
Semigroups with Idempotent stabilizers and Applications to Automata Theory. Int. J. Algebra Comput. 1 (3) (1991)
Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil
A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words. FSTTCS (1991)
Pascal Weil
Products of Languages with Counter. Theor. Comput. Sci. 76 (2-3) (1990)
Pascal Weil
On Varieties of Languages Closed Under Products with Counter. MFCS (1989)
Pascal Weil
Inverse Monoids of Dot-Depth Two. Theor. Comput. Sci. 66 (3) (1989)
Pascal Weil
Concatenation product: a survey. Formal Properties of Finite Automata and Applications (1988)
Pascal Weil
Groups, Codes and Unambiguous Automata. STACS (1985)