default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPascal Weil
- > Home > Persons > Pascal Weil
Publications
- 2024
[j37]Frédérique Bassino, Cyril Nicaud, Pascal Weil:
Random Generation of Subgroups of the Modular Group with a Fixed Isomorphism Type. Electron. J. Comb. 31(4) (2024)- [c25]Bharat Adsul
, Paul Gastin, Shantanu Kulkarni, Pascal Weil:
An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications. LICS 2024: 2:1-2:13 - [i19]Bharat Adsul, Paul Gastin, Shantanu Kulkarni, Pascal Weil:
Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages. CoRR abs/2405.11308 (2024) - 2023
- [i18]Mallika Roy, Enric Ventura, Pascal Weil:
The central tree property and algorithmic problems on subgroups of free groups. CoRR abs/2303.14697 (2023) - 2022
- [j36]Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil:
Asynchronous wreath product and cascade decompositions for concurrent behaviours. Log. Methods Comput. Sci. 18(2) (2022) - [c24]Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil:
Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages. CONCUR 2022: 28:1-28:19 - 2021
- [j35]Frédérique Bassino, Cyril Nicaud, Pascal Weil:
Statistics of subgroups of the modular group. Int. J. Algebra Comput. 31(8): 1691-1751 (2021) - [p2]Howard Straubing, Pascal Weil:
Varieties. Handbook of Automata Theory (I.) 2021: 569-614 - [i17]Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil:
Asynchronous wreath product and cascade decompositions for concurrent behaviours. CoRR abs/2105.10897 (2021) - 2020
- [c23]Olga Kharlampovich, Pascal Weil:
On the Generalized Membership Problem in Relatively Hyperbolic Groups. Fields of Logic and Computation III 2020: 147-155 - [c22]Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil:
Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces. CONCUR 2020: 19:1-19:17 - [i16]Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil:
Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces (extended version). CoRR abs/2007.07940 (2020) - 2016
- [c20]Frédérique Bassino, Cyril Nicaud, Pascal Weil:
Generic properties of subgroups of free groups and finite presentations. AMS-EMS-SPM Joint Meeting 2016 - 2015
- [i14]Howard Straubing, Pascal Weil:
Varieties. CoRR abs/1502.03951 (2015) - [i13]Frédérique Bassino, Cyril Nicaud, Pascal Weil:
Generic properties of subgroups of free groups and finite presentations. CoRR abs/1507.01088 (2015) - 2013
- [j31]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) - [i11]Frédérique Bassino, Cyril Nicaud, Pascal Weil:
On the genericity of Whitehead minimality. CoRR abs/1312.4510 (2013) - 2012
- [j30]Manfred Kufleitner, Pascal Weil:
On logical hierarchies within FO2-definable languages. Log. Methods Comput. Sci. 8(3) (2012) - [j29]Volker Diekert, Manfred Kufleitner, Pascal Weil:
Star-free languages are Church-Rosser congruential. Theor. Comput. Sci. 454: 129-135 (2012) - [c18]Manfred Kufleitner, Pascal Weil:
The FO2 alternation hierarchy is decidable. CSL 2012: 426-439 - [p1]Howard Straubing, Pascal Weil:
An Introduction to Finite Automata and their Connection to Logic. Modern Applications of Automata Theory 2012: 3-44 - [i10]Manfred Kufleitner, Pascal Weil:
The FO^2 alternation hierarchy is decidable. CoRR abs/1203.6152 (2012) - 2011
- [i9]Volker Diekert, Manfred Kufleitner, Pascal Weil:
Star-Free Languages are Church-Rosser Congruential. CoRR abs/1111.4300 (2011) - 2010
- [j28]Zoltán Ésik, Pascal Weil:
Algebraic Characterization of Logically Defined Tree Languages. Int. J. Algebra Comput. 20(2): 195-239 (2010) - [j27]Pedro V. Silva, Pascal Weil:
Automorphic orbits in Free Groups: Words versus Subgroups. Int. J. Algebra Comput. 20(4): 561-590 (2010) - [j26]Wolfgang Thomas, Pascal Weil:
Preface of STACS 2007 Special Issue. Theory Comput. Syst. 46(3): 397 (2010) - [j25]Susanne Albers, Pascal Weil:
STACS 2008 Foreword. Theory Comput. Syst. 47(3): 611-612 (2010) - [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) - 2009
- [c15]Manfred Kufleitner, Pascal Weil:
On FO2 Quantifier Alternation over Words. MFCS 2009: 513-524 - [i6]Manfred Kufleitner, Pascal Weil:
On FO2 quantifier alternation over words. CoRR abs/0904.2894 (2009) - 2008
- [j24]Frédérique Bassino, Cyril Nicaud, Pascal Weil:
Random Generation of Finitely Generated Subgroups of a Free Group. Int. J. Algebra Comput. 18(2): 375-405 (2008) - [j23]Pedro V. Silva, Pascal Weil:
On an algorithm to decide whether a free group is a free factor of another. RAIRO Theor. Informatics Appl. 42(2): 395-414 (2008) - [c14]Susanne Albers, Pascal Weil:
Preface - 25th International Symposium on Theoretical Aspects of Computer Science. STACS 2008: 1-6 - [c13]Susanne Albers, Pascal Weil:
Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science. STACS 2008 - [e2]Susanne Albers, Pascal Weil:
STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings. LIPIcs 1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - 2007
- [j22]Abdó Roig, Enric Ventura, Pascal Weil:
On the Complexity of the Whitehead Minimization Problem. Int. J. Algebra Comput. 17(8): 1611-1634 (2007) - [e1]Wolfgang Thomas, Pascal Weil:
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 [contents] - [i5]Zoltán Ésik, Pascal Weil:
Algebraic characterization of logically defined tree languages. CoRR abs/0709.2962 (2007) - 2006
- [i1]Zoltán Ésik, Pascal Weil:
Algebraic recognizability of regular tree languages. CoRR abs/cs/0609113 (2006) - 2005
- [j21]Zoltán Ésik, Pascal Weil:
Algebraic recognizability of regular tree languages. Theor. Comput. Sci. 340(1): 291-321 (2005) - 2003
- [c11]Zoltán Ésik, Pascal Weil:
On Logically Defined Recognizable Tree Languages. FSTTCS 2003: 195-207 - 2001
- [j16]Kamal Lodaya, Pascal Weil:
Rationality in Algebras with a Series Operation. Inf. Comput. 171(2): 269-293 (2001) - [j15]Stuart W. Margolis, Mark V. Sapir, Pascal Weil:
Closed Subgroups in Pro-V Topologies and the Extension Problem for Inverse Automata. Int. J. Algebra Comput. 11(4): 405-446 (2001) - [j14]Jean-Eric Pin, Pascal Weil:
A conjecture on the concatenation product. RAIRO Theor. Informatics Appl. 35(6): 597-618 (2001) - 2000
- [j13]Kamal Lodaya, Pascal Weil:
Series-parallel languages and the bounded-width property. Theor. Comput. Sci. 237(1-2): 347-380 (2000) - [j12]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) - 1999
- [j11]Jean-Eric Pin, Pascal Weil:
Uniformities on Free Semigroups. Int. J. Algebra Comput. 9(3-4): 431-454 (1999) - 1998
- [j10]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]Kamal Lodaya, Pascal Weil:
A Kleene Iteration for Parallelism. FSTTCS 1998: 355-366 - [c8]Kamal Lodaya, Pascal Weil:
Series-Parallel Posets: Algebra, Automata and Languages. STACS 1998: 555-565 - 1997
- [j9]Jorge Almeida, Pascal Weil:
Free Profinite ℛ-Trivial Monoids. Int. J. Algebra Comput. 7(5): 625-672 (1997) - [j8]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
- [j7]John Rhodes, Pascal Weil:
Algebraic and Topological Theory of Languages. RAIRO Theor. Informatics Appl. 29(1): 1-44 (1995) - [c6]Jean-Eric Pin, Pascal Weil:
Polynomial Closure and Unambiguous Product. ICALP 1995: 348-359 - 1994
- [j6]Jorge Almeida, Pascal Weil:
Reduced Factorizations in Free Profinite Groups and Join Decompositions of Pseudovarieties. Int. J. Algebra Comput. 4(3): 375-404 (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]Howard Straubing, Pascal Weil:
On a Conjecture Concerning Dot-Depth Two Languages. Theor. Comput. Sci. 104(2): 161-183 (1992) - 1991
- [j3]Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil:
Semigroups with Idempotent stabilizers and Applications to Automata Theory. Int. J. Algebra Comput. 1(3): 291-314 (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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-07-02 18:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
