default search action
Marc Zeitoun
Person information
- affiliation: University of Bordeaux 1, LABRI, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c33]Thomas Place, Marc Zeitoun:
A Generic Characterization of Generalized Unary Temporal Logic and Two-Variable First-Order Logic. CSL 2024: 45:1-45:23 - [c32]Thomas Place
, Marc Zeitoun
Dot-depth three, return of the J-class. LICS 2024: 64:1-64:15 - [i25]Thomas Place, Marc Zeitoun:
Dot-depth three, return of the J-class. CoRR abs/2401.16195 (2024) - [i24]Thomas Place, Marc Zeitoun:
Temporal hierarchies of regular languages. CoRR abs/2402.10080 (2024) - 2023
- [j24]Thomas Place, Marc Zeitoun
All about unambiguous polynomial closure. TheoretiCS 2 (2023) - [c31]Thomas Place, Marc Zeitoun:
Group Separation Strikes Back. LICS 2023: 1-13 - [i23]Thomas Place, Marc Zeitoun:
A generic characterization of generalized unary temporal logic and two-variable first-order logic. CoRR abs/2307.09349 (2023) - [i22]Thomas Place, Marc Zeitoun:
Closing star-free closure. CoRR abs/2307.09376 (2023) - 2022
- [c30]Thomas Place, Marc Zeitoun:
Characterizing Level One in Group-Based Concatenation Hierarchies. CSR 2022: 320-337 - [c29]Thomas Place, Marc Zeitoun:
A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier Alternation. FSTTCS 2022: 43:1-43:22 - [c28]Thomas Place, Marc Zeitoun
How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic? LATIN 2022: 409-425 - [i21]Thomas Place, Marc Zeitoun:
Characterizing level one in group-based concatenation hierarchies. CoRR abs/2201.06826 (2022) - [i20]Thomas Place, Marc Zeitoun:
Group separation strikes back. CoRR abs/2205.01632 (2022) - [i19]Thomas Place, Marc Zeitoun:
Unambiguous polynomial closure explained. CoRR abs/2205.12703 (2022) - [i18]Thomas Place, Marc Zeitoun:
A generic polynomial time approach to separation by first-order logic without quantifier alternation. CoRR abs/2210.00946 (2022) - 2021
- [j23]Thomas Place, Marc Zeitoun:
Separation for dot-depth two. Log. Methods Comput. Sci. 17(3) (2021) - 2020
- [j22]Ralf Klasing, Marc Zeitoun:
Selected papers of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017. J. Comput. Syst. Sci. 114: 105-106 (2020) - [j21]Thomas Place, Marc Zeitoun:
Adding Successor: A Transfer Theorem for Separation and Covering. ACM Trans. Comput. Log. 21(2): 9:1-9:45 (2020)
2010 – 2019
- 2019
- [j20]Thomas Place, Marc Zeitoun:
Going Higher in First-Order Quantifier Alternation Hierarchies on Words. J. ACM 66(2): 12:1-12:65 (2019) - [j19]Thomas Place, Marc Zeitoun
Generic Results for Concatenation Hierarchies. Theory Comput. Syst. 63(4): 849-901 (2019) - [c27]Thomas Place, Marc Zeitoun:
On All Things Star-Free. ICALP 2019: 126:1-126:14 - [c26]Thomas Place, Marc Zeitoun:
Separation and covering for group based concatenation hierarchies. LICS 2019: 1-13 - [i17]Thomas Place, Marc Zeitoun:
Separation for dot-depth two. CoRR abs/1901.03361 (2019) - [i16]Thomas Place, Marc Zeitoun:
Separation and covering for group based concatenation hierarchies. CoRR abs/1902.04957 (2019) - [i15]Thomas Place, Marc Zeitoun:
On all things star-free. CoRR abs/1904.11863 (2019) - [i14]Jorge Almeida, José Carlos Costa, Marc Zeitoun:
Recognizing pro-R closures of regular languages. CoRR abs/1905.10460 (2019) - 2018
- [j18]Thomas Place, Marc Zeitoun:
The Covering Problem. Log. Methods Comput. Sci. 14(3) (2018) - [c25]Thomas Place, Marc Zeitoun:
The Complexity of Separation for Levels in Concatenation Hierarchies. FSTTCS 2018: 47:1-47:17 - [c24]Thomas Place, Marc Zeitoun
Separating Without Any Ambiguity. ICALP 2018: 137:1-137:14 - [i13]Thomas Place, Marc Zeitoun:
A generic characterization of Pol(C). CoRR abs/1802.06141 (2018) - [i12]Thomas Place, Marc Zeitoun:
The complexity of separation for levels in concatenation hierarchies. CoRR abs/1810.09287 (2018) - 2017
- [j17]Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun, Georg Zetzsche
A Characterization for Decidable Separability by Piecewise Testable Languages. Discret. Math. Theor. Comput. Sci. 19(4) (2017) - [c23]Thomas Place, Marc Zeitoun
Concatenation Hierarchies: New Bottle, Old Wine. CSR 2017: 25-37 - [c22]Thomas Place, Marc Zeitoun
Separation for dot-depth two. LICS 2017: 1-12 - [e1]Ralf Klasing, Marc Zeitoun:
Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings. Lecture Notes in Computer Science 10472, Springer 2017, ISBN 978-3-662-55750-1 [contents] - [i11]Jorge Almeida, Alfredo Costa, José Carlos Costa, Marc Zeitoun:
The linear nature of pseudowords. CoRR abs/1702.08083 (2017) - [i10]Thomas Place, Marc Zeitoun:
The Covering Problem. CoRR abs/1707.03370 (2017) - [i9]Thomas Place, Marc Zeitoun:
Going Higher in First-Order Quantifier Alternation Hierarchies on Words. CoRR abs/1707.05696 (2017) - [i8]Thomas Place, Marc Zeitoun:
Adding successor: A transfer theorem for separation and covering. CoRR abs/1709.10052 (2017) - [i7]Thomas Place, Marc Zeitoun:
Generic Results for Concatenation Hierarchies. CoRR abs/1710.04313 (2017) - 2016
- [j16]Thomas Place, Marc Zeitoun:
Separating Regular Languages with First-Order Logic. Log. Methods Comput. Sci. 12(1) (2016) - [j15]Jorge Almeida, José Carlos Costa, Marc Zeitoun:
Factoriality and the Pin-Reutenauer procedure. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [c21]Théo Pierron, Thomas Place, Marc Zeitoun
Quantifier Alternation for Infinite Words. FoSSaCS 2016: 234-251 - [c20]Thomas Place, Marc Zeitoun
The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics. MFCS 2016: 77:1-77:15 - 2015
- [j14]Jorge Almeida, José Carlos Costa
McCammond's normal forms for free aperiodic semigroups revisited. LMS J. Comput. Math. 18(1): 130-147 (2015) - [j13]Thomas Place, Marc Zeitoun:
The tale of the quantifier alternation hierarchy of first-order logic over words. ACM SIGLOG News 2(3): 4-17 (2015) - [c19]Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun
A Note on Decidable Separability by Piecewise Testable Languages. FCT 2015: 173-185 - [c18]Thomas Place, Marc Zeitoun
Separation and the Successor Relation. STACS 2015: 662-675 - [i6]Thomas Place, Marc Zeitoun:
A Transfer Theorem for the Separation Problem. CoRR abs/1501.00569 (2015) - [i5]Théo Pierron
Quantifier Alternation for Infinite Words. CoRR abs/1511.09011 (2015) - 2014
- [j12]Thomas Place, Lorijn van Rooijen, Marc Zeitoun
Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages. Log. Methods Comput. Sci. 10(3) (2014) - [j11]Jorge Almeida
Iterated periodicity over finite aperiodic semigroups. Eur. J. Comb. 37: 115-149 (2014) - [j10]Benedikt Bollig, C. Aiswarya
Temporal logics for concurrent recursive programs: Satisfiability and model checking. J. Appl. Log. 12(4): 395-416 (2014) - [j9]Benedikt Bollig, Paul Gastin, Benjamin Monmege
Pebble Weighted Automata and Weighted Logics. ACM Trans. Comput. Log. 15(2): 15:1-15:35 (2014) - [c17]Benedikt Bollig, Paul Gastin, Benjamin Monmege
Logical characterization of weighted pebble walking automata. CSL-LICS 2014: 19:1-19:10 - [c16]Thomas Place, Marc Zeitoun
Separating regular languages with first-order logic. CSL-LICS 2014: 75:1-75:10 - [c15]Thomas Place, Marc Zeitoun
Going Higher in the First-Order Quantifier Alternation Hierarchy on Words. ICALP (2) 2014: 342-353 - [i4]Thomas Place, Marc Zeitoun:
Going higher in the First-order Quantifier Alternation Hierarchy on Words. CoRR abs/1404.6832 (2014) - [i3]Jorge Almeida, José Carlos Costa, Marc Zeitoun:
McCammond's normal forms for free aperiodic semigroups revisited. CoRR abs/1406.0888 (2014) - 2013
- [c14]Thomas Place, Lorijn van Rooijen, Marc Zeitoun
Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages. FSTTCS 2013: 363-375 - [c13]Thomas Place, Lorijn van Rooijen, Marc Zeitoun
Separating Regular Languages by Piecewise Testable and Unambiguous Languages. MFCS 2013: 729-740 - [i2]Lorijn van Rooijen, Marc Zeitoun:
The separation problem for regular languages by piecewise testable languages. CoRR abs/1303.2143 (2013) - [i1]Thomas Place, Lorijn van Rooijen, Marc Zeitoun:
Separating regular languages by piecewise testable and unambiguous languages. CoRR abs/1304.6734 (2013) - 2012
- [j8]Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun:
Model Checking Vector Addition Systems with one zero-test. Log. Methods Comput. Sci. 8(2) (2012) - [c12]Benedikt Bollig, Paul Gastin, Benjamin Monmege
A Probabilistic Kleene Theorem. ATVA 2012: 400-415 - 2011
- [c11]Benedikt Bollig, Aiswarya Cyriac
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. MFCS 2011: 132-144 - 2010
- [c10]Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun
Place-Boundedness for Vector Addition Systems with one zero-test. FSTTCS 2010: 192-203 - [c9]Benedikt Bollig, Paul Gastin, Benjamin Monmege
Pebble Weighted Automata and Transitive Closure Logics. ICALP (2) 2010: 587-598
2000 – 2009
- 2009
- [j7]Paul Gastin, Nathalie Sznajder, Marc Zeitoun
Distributed synthesis for well-connected architectures. Formal Methods Syst. Des. 34(3): 215-237 (2009) - 2008
- [j6]Jorge Almeida
Description and analysis of a bottom-up DFA minimization algorithm. Inf. Process. Lett. 107(2): 52-59 (2008) - [c8]Blaise Genest, Anca Muscholl, Olivier Serre, Marc Zeitoun:
Tree Pattern Rewriting Systems. ATVA 2008: 332-346 - [c7]Nicolas Caniart, Emmanuel Fleury, Jérôme Leroux, Marc Zeitoun
Accelerating Interpolation-Based Model-Checking. TACAS 2008: 428-442 - 2007
- [j5]Jorge Almeida
An automata-theoretic approach to the word problem for omega -terms over R. Theor. Comput. Sci. 370(1-3): 131-169 (2007) - 2006
- [j4]Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun
Infinite-state high-level MSCs: Model-checking and realizability. J. Comput. Syst. Sci. 72(4): 617-647 (2006) - [c6]Paul Gastin, Nathalie Sznajder, Marc Zeitoun:
Distributed Synthesis for Well-Connected Architectures. FSTTCS 2006: 321-332 - 2004
- [c5]Paul Gastin, Benjamin Lerman, Marc Zeitoun:
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems. FSTTCS 2004: 275-286 - [c4]Paul Gastin, Benjamin Lerman, Marc Zeitoun:
Distributed Games and Distributed Control for Asynchronous Systems. LATIN 2004: 455-465 - [c3]Paul Gastin, Pierre Moro, Marc Zeitoun:
Minimization of Counterexamples in SPIN. SPIN 2004: 92-108 - [c2]Loïc Hélouët, Marc Zeitoun
Scenarios and Covert Channels: Another Game... GDV@CAV 2004: 93-116 - 2002
- [c1]Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun:
Infinite-State High-Level MSCs: Model-Checking and Realizability. ICALP 2002: 657-668
1990 – 1999
- 1999
- [j3]Jorge Almeida
Pseudovariety Joins involving -Trivial Semigroups. Int. J. Algebra Comput. 9(1): 99-112 (1999) - 1997
- [j2]Jorge Almeida, Marc Zeitoun
The Pseudovariety J is Hyperdecidable. RAIRO Theor. Informatics Appl. 31(5): 457-482 (1997) - 1995
- [j1]Marc Zeitoun:
On the Decidability of the Membership Problem of the Pseudovariety J∨B. Int. J. Algebra Comput. 5(1): 47-64 (1995)
Coauthor Index
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.
Reference lists
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.
Citation data
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.
OpenAlex data
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 2024-07-05 20:15 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: