Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Pascal Weil
2010 – today
- 2013
[j28]Jean-Michel Couvreur, Denis Poitrenaud, Pascal Weil: Branching Processes of General Petri Nets. Fundam. Inform. 122(1-2): 31-58 (2013)- [j27]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)
- 2012
- [j26]Manfred Kufleitner, Pascal Weil: On logical hierarchies within FO2-definable languages. Logical Methods in Computer Science 8(3) (2012)
- [j25]Volker Diekert, Manfred Kufleitner, Pascal Weil: Star-free languages are Church-Rosser congruential. Theor. Comput. Sci. 454: 129-135 (2012)
- [c18]
- [i10]Manfred Kufleitner, Pascal Weil: The FO^2 alternation hierarchy is decidable. CoRR abs/1203.6152 (2012)
- 2011
- [c17]Jean-Michel Couvreur, Denis Poitrenaud, Pascal Weil: Branching Processes of General Petri Nets. Petri Nets 2011: 129-148
- [i9]Volker Diekert, Manfred Kufleitner, Pascal Weil: Star-Free Languages are Church-Rosser Congruential. CoRR abs/1111.4300 (2011)
- 2010
- [j24]Zoltán Ésik, Pascal Weil: Algebraic Characterization of Logically Defined Tree Languages. IJAC 20(2): 195-239 (2010)
- [j23]Pedro V. Silva, Pascal Weil: Automorphic orbits in Free Groups: Words versus Subgroups. IJAC 20(4): 561-590 (2010)
- [j22]Wolfgang Thomas, Pascal Weil: Preface of STACS 2007 Special Issue. Theory Comput. Syst. 46(3): 397 (2010)
- [j21]
- [c16]Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil: On Two Distributions of Subgroups of Free Groups. ANALCO 2010: 82-89
- [i8]Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil: Statistical properties of subgroups of free groups. CoRR abs/1001.4472 (2010)
- [i7]Howard Straubing, Pascal Weil: An introduction to finite automata and their connection to logic. CoRR abs/1011.6491 (2010)
2000 – 2009
- 2009
- [c15]
- [i6]Manfred Kufleitner, Pascal Weil: On FO2 quantifier alternation over words. CoRR abs/0904.2894 (2009)
- 2008
- [j20]Frédérique Bassino, Cyril Nicaud, Pascal Weil: Random Generation of Finitely Generated Subgroups of a Free Group. IJAC 18(2): 375-405 (2008)
- [j19]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)
- [c14]Susanne Albers, Pascal Weil: Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science. STACS 2008: 0-
- [c13]Susanne Albers, Pascal Weil: Preface - 25th International Symposium on Theoretical Aspects of Computer Science. STACS 2008: 1-6
- [e2]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
- 2007
- [j18]Abdó Roig, Enric Ventura, Pascal Weil: On the Complexity of the Whitehead Minimization Problem. IJAC 17(8): 1611-1634 (2007)
- [e1]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
- [i5]Zoltán Ésik, Pascal Weil: Algebraic characterization of logically defined tree languages. CoRR abs/0709.2962 (2007)
- 2006
- [i4]Pascal Weil: On the logical definability of certain graph and poset languages. CoRR abs/cs/0609048 (2006)
- [i3]Bruno Courcelle, Pascal Weil: The recognizability of sets of graphs is a robust property. CoRR abs/cs/0609109 (2006)
- [i2]
- [i1]Zoltán Ésik, Pascal Weil: Algebraic recognizability of regular tree languages. CoRR abs/cs/0609113 (2006)
- 2005
- [j17]Zoltán Ésik, Pascal Weil: Algebraic recognizability of regular tree languages. Theor. Comput. Sci. 340(1): 291-321 (2005)
- [j16]Bruno Courcelle, Pascal Weil: The recognizability of sets of graphs is a robust property. Theor. Comput. Sci. 342(2-3): 173-228 (2005)
- 2004
- [j15]Pascal Weil: On the Logical Definability of Certain Graph and Poset Languages. Journal of Automata, Languages and Combinatorics 9(1): 147-165 (2004)
- [c12]
- 2003
- [c11]
- 2002
- [j14]
- [c10]Bruno Courcelle, Pascal Weil: Workshop on Logic, Graph Transformations and Discrete Structures. ICGT 2002: 455-458
- 2001
- [j13]Pascal Weil: Graphs, intersections of subgroups of free groups and corank. Electronic Notes in Discrete Mathematics 10: 286-290 (2001)
- [j12]Kamal Lodaya, Pascal Weil: Rationality in Algebras with a Series Operation. Inf. Comput. 171(2): 269-293 (2001)
- [j11]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)
- [j10]
- 2000
- [j9]Kamal Lodaya, Pascal Weil: Series-parallel languages and the bounded-width property. Theor. Comput. Sci. 237(1-2): 347-380 (2000)
- [j8]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)
1990 – 1999
- 1998
- [j7]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)
- [c9]
- [c8]Kamal Lodaya, Pascal Weil: Series-Parallel Posets: Algebra, Automata and Languages. STACS 1998: 555-565
- 1997
- [j6]Jean-Eric Pin, Pascal Weil: Ponynominal Closure and Unambiguous Product. Theory Comput. Syst. 30(4): 383-422 (1997)
- 1996
- [c7]Stuart W. Margolis, Mark V. Sapir, Pascal Weil: On the Indecomposibility of Certain Language Classes. ISTCS 1996: 129-134
- 1995
- [j5]
- [c6]
- 1994
- [c5]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
- 1992
- [j4]Pascal Weil: Closure of Varieties of Languages under Products with Counter. J. Comput. Syst. Sci. 45(3): 316-339 (1992)
- [j3]Howard Straubing, Pascal Weil: On a Conjecture Concerning Dot-Depth Two Languages. Theor. Comput. Sci. 104(2): 161-183 (1992)
- 1991
- [c4]Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil: A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words. FSTTCS 1991: 141-151
- 1990
- [j2]
1980 – 1989
- 1989
- [j1]
- [c3]
- 1988
- [c2]Pascal Weil: Concatenation product: a survey. Formal Properties of Finite Automata and Applications 1988: 120-137
- 1985
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-16 02:30 CEST by the dblp team