| 2009 |
|---|
| 41 | EE | Manfred Kufleitner,
Pascal Weil:
On FO2 quantifier alternation over words
CoRR abs/0904.2894: (2009) |
| 2008 |
|---|
| 40 | | Susanne Albers,
Pascal Weil:
STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
| 39 | EE | Susanne Albers,
Pascal Weil:
Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science.
STACS 2008 |
| 38 | EE | Susanne Albers,
Pascal Weil:
Preface - 25th International Symposium on Theoretical Aspects of Computer Science.
STACS 2008: 1-6 |
| 37 | EE | Frédérique Bassino,
Cyril Nicaud,
Pascal Weil:
Random Generation of Finitely Generated Subgroups of a Free Group.
IJAC 18(2): 375-405 (2008) |
| 2007 |
|---|
| 36 | | Wolfgang Thomas,
Pascal Weil:
STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings
Springer 2007 |
| 35 | EE | Zoltán Ésik,
Pascal Weil:
Algebraic characterization of logically defined tree languages
CoRR abs/0709.2962: (2007) |
| 34 | EE | Abdó Roig,
Enric Ventura,
Pascal Weil:
On the Complexity of the Whitehead Minimization Problem.
IJAC 17(8): 1611-1634 (2007) |
| 2006 |
|---|
| 33 | EE | Pascal Weil:
On the logical definability of certain graph and poset languages
CoRR abs/cs/0609048: (2006) |
| 32 | EE | Bruno Courcelle,
Pascal Weil:
The recognizability of sets of graphs is a robust property
CoRR abs/cs/0609109: (2006) |
| 31 | EE | Pascal Weil:
Algebraic recognizability of languages
CoRR abs/cs/0609110: (2006) |
| 30 | EE | Zoltán Ésik,
Pascal Weil:
Algebraic recognizability of regular tree languages
CoRR abs/cs/0609113: (2006) |
| 2005 |
|---|
| 29 | EE | Zoltán Ésik,
Pascal Weil:
Algebraic recognizability of regular tree languages.
Theor. Comput. Sci. 340(1): 291-321 (2005) |
| 28 | EE | Bruno Courcelle,
Pascal Weil:
The recognizability of sets of graphs is a robust property.
Theor. Comput. Sci. 342(2-3): 173-228 (2005) |
| 2004 |
|---|
| 27 | EE | Pascal Weil:
Algebraic Recognizability of Languages.
MFCS 2004: 149-175 |
| 26 | | Pascal Weil:
On the Logical Definability of Certain Graph and Poset Languages.
Journal of Automata, Languages and Combinatorics 9(1): 147-165 (2004) |
| 2003 |
|---|
| 25 | EE | Zoltán Ésik,
Pascal Weil:
On Logically Defined Recognizable Tree Languages.
FSTTCS 2003: 195-207 |
| 2002 |
|---|
| 24 | EE | Bruno Courcelle,
Pascal Weil:
Workshop on Logic, Graph Transformations and Discrete Structures.
ICGT 2002: 455-458 |
| 23 | EE | Pascal Weil:
Profinite Methods in Semigroup Theory.
IJAC 12(1-2): 137-177 (2002) |
| 2001 |
|---|
| 22 | EE | Pascal Weil:
Graphs, intersections of subgroups of free groups and corank.
Electronic Notes in Discrete Mathematics 10: 286-290 (2001) |
| 21 | EE | 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) |
| 20 | EE | Jean-Eric Pin,
Pascal Weil:
A conjecture on the concatenation product.
ITA 35(6): 597-618 (2001) |
| 19 | EE | Kamal Lodaya,
Pascal Weil:
Rationality in Algebras with a Series Operation.
Inf. Comput. 171(2): 269-293 (2001) |
| 2000 |
|---|
| 18 | EE | Kamal Lodaya,
Pascal Weil:
Series-parallel languages and the bounded-width property.
Theor. Comput. Sci. 237(1-2): 347-380 (2000) |
| 17 | EE | 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) |
| 1998 |
|---|
| 16 | | Kamal Lodaya,
Pascal Weil:
A Kleene Iteration for Parallelism.
FSTTCS 1998: 355-366 |
| 15 | | Kamal Lodaya,
Pascal Weil:
Series-Parallel Posets: Algebra, Automata and Languages.
STACS 1998: 555-565 |
| 14 | EE | 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) |
| 1997 |
|---|
| 13 | | Jean-Eric Pin,
Pascal Weil:
Ponynominal Closure and Unambiguous Product.
Theory Comput. Syst. 30(4): 383-422 (1997) |
| 1996 |
|---|
| 12 | | Stuart W. Margolis,
Mark V. Sapir,
Pascal Weil:
On the Indecomposibility of Certain Language Classes.
ISTCS 1996: 129-134 |
| 1995 |
|---|
| 11 | | Jean-Eric Pin,
Pascal Weil:
Polynomial Closure and Unambiguous Product.
ICALP 1995: 348-359 |
| 10 | | John Rhodes,
Pascal Weil:
Algebraic and Topological Theory of Languages.
ITA 29(1): 1-44 (1995) |
| 1994 |
|---|
| 9 | | 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 |
|---|
| 8 | | Pascal Weil:
Closure of Varieties of Languages under Products with Counter.
J. Comput. Syst. Sci. 45(3): 316-339 (1992) |
| 7 | | Howard Straubing,
Pascal Weil:
On a Conjecture Concerning Dot-Depth Two Languages.
Theor. Comput. Sci. 104(2): 161-183 (1992) |
| 1991 |
|---|
| 6 | | 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 |
|---|
| 5 | | Pascal Weil:
Products of Languages with Counter.
Theor. Comput. Sci. 76(2-3): 251-260 (1990) |
| 1989 |
|---|
| 4 | | Pascal Weil:
On Varieties of Languages Closed Under Products with Counter.
MFCS 1989: 534-544 |
| 3 | | Pascal Weil:
Inverse Monoids of Dot-Depth Two.
Theor. Comput. Sci. 66(3): 233-245 (1989) |
| 1988 |
|---|
| 2 | | Pascal Weil:
Concatenation product: a survey.
Formal Properties of Finite Automata and Applications 1988: 120-137 |
| 1985 |
|---|
| 1 | | Pascal Weil:
Groups, Codes and Unambiguous Automata.
STACS 1985: 351-362 |
