Groups, Codes and Unambiguous Automata. - Pascal Weil (STACS, 1985)

Concatenation product: a survey. - Pascal Weil (Formal Properties of Finite Automata and Applications, 1988)

On Varieties of Languages Closed Under Products with Counter. - Pascal Weil (MFCS, 1989)

Inverse Monoids of Dot-Depth Two. - Pascal Weil (Theor. Comput. Sci., 1989)

Products of Languages with Counter. - Pascal Weil (Theor. Comput. Sci., 1990)

A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words. - Bertrand Le Saëc; Jean-Eric Pin; Pascal Weil (FSTTCS, 1991)

Semigroups with Idempotent stabilizers and Applications to Automata Theory. - Bertrand Le Saëc; Jean-Eric Pin; Pascal Weil (Int. J. Algebra Comput., 1991)

Closure of Varieties of Languages under Products with Counter. - Pascal Weil (J. Comput. Syst. Sci., 1992)

On a Conjecture Concerning Dot-Depth Two Languages. - Howard Straubing; Pascal Weil (Theor. Comput. Sci., 1992)

PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups. - Jean-Camille Birget; Stuart W. Margolis; John C. Meakin; Pascal Weil (ICALP, 1994)

Reduced Factorizations in Free Profinite Groups and Join Decompositions of Pseudovarieties. - Jorge Almeida 001; Pascal Weil (Int. J. Algebra Comput., 1994)

Polynomial Closure and Unambiguous Product. - Jean-Eric Pin; Pascal Weil (ICALP, 1995)

Algebraic and Topological Theory of Languages. - John Rhodes 001; Pascal Weil (RAIRO Theor. Informatics Appl., 1995)

On the Indecomposibility of Certain Language Classes. - Stuart W. Margolis; Mark V. Sapir; Pascal Weil (ISTCS, 1996)

Free Profinite ℛ-Trivial Monoids. - Jorge Almeida 001; Pascal Weil (Int. J. Algebra Comput., 1997)

Ponynominal Closure and Unambiguous Product. - Jean-Eric Pin; Pascal Weil (Theory Comput. Syst., 1997)

A Kleene Iteration for Parallelism. - Kamal Lodaya; Pascal Weil (FSTTCS, 1998)

Series-Parallel Posets: Algebra, Automata and Languages. - Kamal Lodaya; Pascal Weil (STACS, 1998)

An Extension of the Wreath Product Principle for Finite Mazurkiewicz Traces. - Giovanna Guaiana; Raphaël Meyer; Antoine Petit 001; Pascal Weil (Inf. Process. Lett., 1998)

Uniformities on Free Semigroups. - Jean-Eric Pin; Pascal Weil (Int. J. Algebra Comput., 1999)

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)

Series-parallel languages and the bounded-width property. - Kamal Lodaya; Pascal Weil (Theor. Comput. Sci., 2000)

Graphs, intersections of subgroups of free groups and corank. - Pascal Weil (Electron. Notes Discret. Math., 2001)

Rationality in Algebras with a Series Operation. - Kamal Lodaya; Pascal Weil (Inf. Comput., 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)

A conjecture on the concatenation product. - Jean-Eric Pin; Pascal Weil (RAIRO Theor. Informatics Appl., 2001)

Workshop on Logic, Graph Transformations and Discrete Structures. - Bruno Courcelle; Pascal Weil (ICGT, 2002)

Profinite Methods in Semigroup Theory. - Pascal Weil (Int. J. Algebra Comput., 2002)

On Logically Defined Recognizable Tree Languages. - Zoltán Ésik; Pascal Weil (FSTTCS, 2003)

Algebraic Recognizability of Languages. - Pascal Weil (MFCS, 2004)

On the Logical Definability of Certain Graph and Poset Languages. - Pascal Weil (J. Autom. Lang. Comb., 2004)

The recognizability of sets of graphs is a robust property. - Bruno Courcelle; Pascal Weil (Theor. Comput. Sci., 2005)

Algebraic recognizability of regular tree languages. - Zoltán Ésik; Pascal Weil (Theor. Comput. Sci., 2005)

On the Complexity of the Whitehead Minimization Problem. - Abdó Roig; Enric Ventura; Pascal Weil (Int. J. Algebra Comput., 2007)

Preface - 25th International Symposium on Theoretical Aspects of Computer Science. - Susanne Albers; Pascal Weil (STACS, 2008)

Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science. - Susanne Albers; Pascal Weil (STACS, 2008)

Random Generation of Finitely Generated Subgroups of a Free Group. - Frédérique Bassino; Cyril Nicaud; Pascal Weil (Int. J. Algebra Comput., 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)

On FO2 Quantifier Alternation over Words. - Manfred Kufleitner; Pascal Weil (MFCS, 2009)

On Two Distributions of Subgroups of Free Groups. - Frédérique Bassino; Armando Martino; Cyril Nicaud; Enric Ventura; Pascal Weil (ANALCO, 2010)

An introduction to finite automata and their connection to logic - Howard Straubing; Pascal Weil (CoRR, 2010)

Algebraic Characterization of Logically Defined Tree Languages. - Zoltán Ésik; Pascal Weil (Int. J. Algebra Comput., 2010)

Automorphic orbits in Free Groups: Words versus Subgroups. - Pedro V. Silva; Pascal Weil (Int. J. Algebra Comput., 2010)

STACS 2008 Foreword. - Susanne Albers; Pascal Weil (Theory Comput. Syst., 2010)

Preface of STACS 2007 Special Issue. - Wolfgang Thomas; Pascal Weil (Theory Comput. Syst., 2010)

An Introduction to Finite Automata and their Connection to Logic. - Howard Straubing; Pascal Weil (Modern Applications of Automata Theory, 2012)

The FO2 alternation hierarchy is decidable. - Manfred Kufleitner; Pascal Weil (CSL, 2012)

The FO^2 alternation hierarchy is decidable - Manfred Kufleitner; Pascal Weil (CoRR, 2012)

On logical hierarchies within FO2-definable languages - Manfred Kufleitner; Pascal Weil (Log. Methods Comput. Sci., 2012)

Star-free languages are Church-Rosser congruential. - Volker Diekert; Manfred Kufleitner; Pascal Weil (Theor. Comput. Sci., 2012)

On the genericity of Whitehead minimality. - Frédérique Bassino; Cyril Nicaud; Pascal Weil (CoRR, 2013)

Branching Processes of General Petri Nets. - Jean-Michel Couvreur; Denis Poitrenaud; Pascal Weil (Fundam. Informaticae, 2013)

Statistical properties of subgroups of free groups. - Frédérique Bassino; Armando Martino; Cyril Nicaud; Enric Ventura; Pascal Weil (Random Struct. Algorithms, 2013)

From Algebra to Logic: There and Back Again The Story of a Hierarchy - (Invited Paper). - Pascal Weil (Developments in Language Theory, 2014)

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

Varieties. - Howard Straubing; Pascal Weil (CoRR, 2015)

Generic properties of subgroups of free groups and finite presentations. - Frédérique Bassino; Cyril Nicaud; Pascal Weil (AMS-EMS-SPM Joint Meeting, 2016)

The Quantifier Alternation Hierarchy of Synchronous Relations. - Diego Figueira; Varun Ramanathan 001; Pascal Weil (MFCS, 2019)

Covering and separation for logical fragments with modular predicates. - Thomas Place; Varun Ramanathan 001; Pascal Weil (Log. Methods Comput. Sci., 2019)

Foreword. - Pascal Weil (Theory Comput. Syst., 2019)

On the Generalized Membership Problem in Relatively Hyperbolic Groups. - Olga Kharlampovich; Pascal Weil (Fields of Logic and Computation III, 2020)

Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces. - Bharat Adsul; Paul Gastin; Saptarshi Sarkar 001; Pascal Weil (CONCUR, 2020)

Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces (extended version). - Bharat Adsul; Paul Gastin; Saptarshi Sarkar 001; Pascal Weil (CoRR, 2020)

Varieties. - Howard Straubing; Pascal Weil (Handbook of Automata Theory (I.), 2021)

Statistics of subgroups of the modular group. - Frédérique Bassino; Cyril Nicaud; Pascal Weil (Int. J. Algebra Comput., 2021)

Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages. - Bharat Adsul; Paul Gastin; Saptarshi Sarkar 001; Pascal Weil (CONCUR, 2022)

Asynchronous wreath product and cascade decompositions for concurrent behaviours. - Bharat Adsul; Paul Gastin; Saptarshi Sarkar 001; Pascal Weil (Log. Methods Comput. Sci., 2022)

The central tree property and algorithmic problems on subgroups of free groups. - Mallika Roy; Enric Ventura; Pascal Weil (CoRR, 2023)

An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications. - Bharat Adsul; Paul Gastin; Shantanu Kulkarni; Pascal Weil (LICS, 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)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages. - Bharat Adsul; Paul Gastin; Shantanu Kulkarni; Pascal Weil (CoRR, 2024)