The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pascal Weil: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Zoltán Ésik, Pascal Weil
    On Logically Defined Recognizable Tree Languages. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:195-207 [Conf]
  2. Kamal Lodaya, Pascal Weil
    A Kleene Iteration for Parallelism. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:355-366 [Conf]
  3. Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil
    A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:141-151 [Conf]
  4. Bruno Courcelle, Pascal Weil
    Workshop on Logic, Graph Transformations and Discrete Structures. [Citation Graph (0, 0)][DBLP]
    ICGT, 2002, pp:455-458 [Conf]
  5. Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil
    PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:274-285 [Conf]
  6. Jean-Eric Pin, Pascal Weil
    Polynomial Closure and Unambiguous Product. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:348-359 [Conf]
  7. Stuart W. Margolis, Mark V. Sapir, Pascal Weil
    On the Indecomposibility of Certain Language Classes. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:129-134 [Conf]
  8. Pascal Weil
    Concatenation product: a survey. [Citation Graph (0, 0)][DBLP]
    Formal Properties of Finite Automata and Applications, 1988, pp:120-137 [Conf]
  9. Pascal Weil
    Algebraic Recognizability of Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:149-175 [Conf]
  10. Pascal Weil
    On Varieties of Languages Closed Under Products with Counter. [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:534-544 [Conf]
  11. Kamal Lodaya, Pascal Weil
    Series-Parallel Posets: Algebra, Automata and Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:555-565 [Conf]
  12. Pascal Weil
    Groups, Codes and Unambiguous Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:351-362 [Conf]
  13. Kamal Lodaya, Pascal Weil
    Rationality in Algebras with a Series Operation. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:171, n:2, pp:269-293 [Journal]
  14. Stuart W. Margolis, Mark V. Sapir, Pascal Weil
    Closed Subgroups in Pro-V Topologies and the Extension Problem for Inverse Automata. [Citation Graph (0, 0)][DBLP]
    IJAC, 2001, v:11, n:4, pp:405-446 [Journal]
  15. Pascal Weil
    Profinite Methods in Semigroup Theory. [Citation Graph (0, 0)][DBLP]
    IJAC, 2002, v:12, n:1-2, pp:137-177 [Journal]
  16. Giovanna Guaiana, Raphaël Meyer, Antoine Petit, Pascal Weil
    An Extension of the Wreath Product Principle for Finite Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:6, pp:277-282 [Journal]
  17. Jean-Eric Pin, Pascal Weil
    A conjecture on the concatenation product. [Citation Graph (0, 0)][DBLP]
    ITA, 2001, v:35, n:6, pp:597-618 [Journal]
  18. John Rhodes, Pascal Weil
    Algebraic and Topological Theory of Languages. [Citation Graph (0, 0)][DBLP]
    ITA, 1995, v:29, n:1, pp:1-44 [Journal]
  19. Pascal Weil
    On the Logical Definability of Certain Graph and Poset Languages. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2004, v:9, n:1, pp:147-165 [Journal]
  20. Pascal Weil
    Closure of Varieties of Languages under Products with Counter. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:45, n:3, pp:316-339 [Journal]
  21. Jean-Eric Pin, Pascal Weil
    Ponynominal Closure and Unambiguous Product. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:4, pp:383-422 [Journal]
  22. Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil
    PSPACE-complete problems for subgroups of free groups and inverse finite automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:242, n:1-2, pp:247-281 [Journal]
  23. Bruno Courcelle, Pascal Weil
    The recognizability of sets of graphs is a robust property. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:342, n:2-3, pp:173-228 [Journal]
  24. Zoltán Ésik, Pascal Weil
    Algebraic recognizability of regular tree languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:340, n:1, pp:291-321 [Journal]
  25. Kamal Lodaya, Pascal Weil
    Series-parallel languages and the bounded-width property. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:347-380 [Journal]
  26. Howard Straubing, Pascal Weil
    On a Conjecture Concerning Dot-Depth Two Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:104, n:2, pp:161-183 [Journal]
  27. Pascal Weil
    Inverse Monoids of Dot-Depth Two. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:66, n:3, pp:233-245 [Journal]
  28. Pascal Weil
    Products of Languages with Counter. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:76, n:2-3, pp:251-260 [Journal]
  29. Pascal Weil
    On the logical definability of certain graph and poset languages [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  30. Bruno Courcelle, Pascal Weil
    The recognizability of sets of graphs is a robust property [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  31. Pascal Weil
    Algebraic recognizability of languages [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  32. Zoltán Ésik, Pascal Weil
    Algebraic recognizability of regular tree languages [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  33. Zoltán Ésik, Pascal Weil
    Algebraic characterization of logically defined tree languages [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  34. On FO2 Quantifier Alternation over Words. [Citation Graph (, )][DBLP]


  35. Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science. [Citation Graph (, )][DBLP]


  36. Preface - 25th International Symposium on Theoretical Aspects of Computer Science. [Citation Graph (, )][DBLP]


  37. On FO2 quantifier alternation over words [Citation Graph (, )][DBLP]


  38. Statistical properties of subgroups of free groups [Citation Graph (, )][DBLP]


Search in 0.293secs, Finished in 0.295secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002