Pascal Weil

Jean-Michel Couvreur, Denis Poitrenaud, Pascal Weil: Branching Processes of General Petri Nets. Fundam. Inform. 122(1-2): 31-58 (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): 349-373 (2013)

Manfred Kufleitner, Pascal Weil: On logical hierarchies within FO²-definable languages. Logical Methods in Computer Science 8(3) (2012)

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

Manfred Kufleitner, Pascal Weil: The FO2 alternation hierarchy is decidable. CSL 2012: 426-439

Manfred Kufleitner, Pascal Weil: The FO^2 alternation hierarchy is decidable. CoRR abs/1203.6152 (2012)

Jean-Michel Couvreur, Denis Poitrenaud, Pascal Weil: Branching Processes of General Petri Nets. Petri Nets 2011: 129-148

Volker Diekert, Manfred Kufleitner, Pascal Weil: Star-Free Languages are Church-Rosser Congruential. CoRR abs/1111.4300 (2011)

Zoltán Ésik, Pascal Weil: Algebraic Characterization of Logically Defined Tree Languages. IJAC 20(2): 195-239 (2010)

Pedro V. Silva, Pascal Weil: Automorphic orbits in Free Groups: Words versus Subgroups. IJAC 20(4): 561-590 (2010)

Wolfgang Thomas, Pascal Weil: Preface of STACS 2007 Special Issue. Theory Comput. Syst. 46(3): 397 (2010)

Susanne Albers, Pascal Weil: STACS 2008 Foreword. Theory Comput. Syst. 47(3): 611-612 (2010)

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

Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil: Statistical properties of subgroups of free groups. CoRR abs/1001.4472 (2010)

Howard Straubing, Pascal Weil: An introduction to finite automata and their connection to logic. CoRR abs/1011.6491 (2010)

Manfred Kufleitner, Pascal Weil: On FO2 Quantifier Alternation over Words. MFCS 2009: 513-524

Manfred Kufleitner, Pascal Weil: On FO2 quantifier alternation over words. CoRR abs/0904.2894 (2009)

Frédérique Bassino, Cyril Nicaud, Pascal Weil: Random Generation of Finitely Generated Subgroups of a Free Group. IJAC 18(2): 375-405 (2008)

Pedro V. Silva, Pascal Weil: On an algorithm to decide whether a free group is a free factor of another. ITA 42(2): 395-414 (2008)

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

Susanne Albers, Pascal Weil: Preface - 25th International Symposium on Theoretical Aspects of Computer Science. STACS 2008: 1-6

Susanne Albers, Pascal Weil (Eds.): STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings. LIPIcs 1, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2008

Abdó Roig, Enric Ventura, Pascal Weil: On the Complexity of the Whitehead Minimization Problem. IJAC 17(8): 1611-1634 (2007)

Wolfgang Thomas, Pascal Weil (Eds.): STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings. Lecture Notes in Computer Science 4393, Springer 2007, isbn 978-3-540-70917-6

Zoltán Ésik, Pascal Weil: Algebraic characterization of logically defined tree languages. CoRR abs/0709.2962 (2007)

Pascal Weil: On the logical definability of certain graph and poset languages. CoRR abs/cs/0609048 (2006)

Bruno Courcelle, Pascal Weil: The recognizability of sets of graphs is a robust property. CoRR abs/cs/0609109 (2006)

Pascal Weil: Algebraic recognizability of languages. CoRR abs/cs/0609110 (2006)

Zoltán Ésik, Pascal Weil: Algebraic recognizability of regular tree languages. CoRR abs/cs/0609113 (2006)

Zoltán Ésik, Pascal Weil: Algebraic recognizability of regular tree languages. Theor. Comput. Sci. 340(1): 291-321 (2005)

Bruno Courcelle, Pascal Weil: The recognizability of sets of graphs is a robust property. Theor. Comput. Sci. 342(2-3): 173-228 (2005)

Pascal Weil: On the Logical Definability of Certain Graph and Poset Languages. Journal of Automata, Languages and Combinatorics 9(1): 147-165 (2004)

Pascal Weil: Algebraic Recognizability of Languages. MFCS 2004: 149-175

Zoltán Ésik, Pascal Weil: On Logically Defined Recognizable Tree Languages. FSTTCS 2003: 195-207

Pascal Weil: Profinite Methods in Semigroup Theory. IJAC 12(1-2): 137-177 (2002)

Bruno Courcelle, Pascal Weil: Workshop on Logic, Graph Transformations and Discrete Structures. ICGT 2002: 455-458

Pascal Weil: Graphs, intersections of subgroups of free groups and corank. Electronic Notes in Discrete Mathematics 10: 286-290 (2001)

Kamal Lodaya, Pascal Weil: Rationality in Algebras with a Series Operation. Inf. Comput. 171(2): 269-293 (2001)

Stuart W. Margolis, Mark V. Sapir, Pascal Weil: Closed Subgroups in Pro-V Topologies and the Extension Problem for Inverse Automata. IJAC 11(4): 405-446 (2001)

Jean-Eric Pin, Pascal Weil: A conjecture on the concatenation product. ITA 35(6): 597-618 (2001)

Kamal Lodaya, Pascal Weil: Series-parallel languages and the bounded-width property. Theor. Comput. Sci. 237(1-2): 347-380 (2000)

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): 247-281 (2000)

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): 277-282 (1998)

Kamal Lodaya, Pascal Weil: A Kleene Iteration for Parallelism. FSTTCS 1998: 355-366

Kamal Lodaya, Pascal Weil: Series-Parallel Posets: Algebra, Automata and Languages. STACS 1998: 555-565

Jean-Eric Pin, Pascal Weil: Ponynominal Closure and Unambiguous Product. Theory Comput. Syst. 30(4): 383-422 (1997)

Stuart W. Margolis, Mark V. Sapir, Pascal Weil: On the Indecomposibility of Certain Language Classes. ISTCS 1996: 129-134

John Rhodes, Pascal Weil: Algebraic and Topological Theory of Languages. ITA 29(1): 1-44 (1995)

Jean-Eric Pin, Pascal Weil: Polynomial Closure and Unambiguous Product. ICALP 1995: 348-359

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: 274-285

Pascal Weil: Closure of Varieties of Languages under Products with Counter. J. Comput. Syst. Sci. 45(3): 316-339 (1992)

Howard Straubing, Pascal Weil: On a Conjecture Concerning Dot-Depth Two Languages. Theor. Comput. Sci. 104(2): 161-183 (1992)

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

Pascal Weil: Products of Languages with Counter. Theor. Comput. Sci. 76(2-3): 251-260 (1990)

Pascal Weil: Inverse Monoids of Dot-Depth Two. Theor. Comput. Sci. 66(3): 233-245 (1989)

Pascal Weil: On Varieties of Languages Closed Under Products with Counter. MFCS 1989: 534-544

Pascal Weil: Concatenation product: a survey. Formal Properties of Finite Automata and Applications 1988: 120-137

Pascal Weil: Groups, Codes and Unambiguous Automata. STACS 1985: 351-362