Marc Zeitoun

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 43

Top Topics

Regular Languages

Quantifier Elimination

Expressive Power

Top Venues

Log. Methods Comput. Sci.

Publications

Thomas Place, Marc Zeitoun
A Generic Characterization of Generalized Unary Temporal Logic and Two-Variable First-Order Logic. CSL (2024)
Thomas Place, Marc Zeitoun
Dot-depth three, return of the J-class. LICS (2024)
Thomas Place, Marc Zeitoun
Temporal hierarchies of regular languages. CoRR (2024)
Thomas Place, Marc Zeitoun
Dot-depth three, return of the J-class. CoRR (2024)
Thomas Place, Marc Zeitoun
A generic characterization of generalized unary temporal logic and two-variable first-order logic. CoRR (2023)
Thomas Place, Marc Zeitoun
All about unambiguous polynomial closure. TheoretiCS 2 (2023)
Thomas Place, Marc Zeitoun
Group Separation Strikes Back. LICS (2023)
Thomas Place, Marc Zeitoun
Closing star-free closure. CoRR (2023)
Thomas Place, Marc Zeitoun
A generic polynomial time approach to separation by first-order logic without quantifier alternation. CoRR (2022)
Thomas Place, Marc Zeitoun
A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier Alternation. FSTTCS (2022)
Thomas Place, Marc Zeitoun
Group separation strikes back. CoRR (2022)
Thomas Place, Marc Zeitoun
Characterizing level one in group-based concatenation hierarchies. CoRR (2022)
Thomas Place, Marc Zeitoun
Characterizing Level One in Group-Based Concatenation Hierarchies. CSR (2022)
Thomas Place, Marc Zeitoun
How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic? LATIN (2022)
Thomas Place, Marc Zeitoun
Unambiguous polynomial closure explained. CoRR (2022)
Thomas Place, Marc Zeitoun
Separation for dot-depth two. Log. Methods Comput. Sci. 17 (3) (2021)
Ralf Klasing, Marc Zeitoun
Selected papers of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017. J. Comput. Syst. Sci. 114 (2020)
Thomas Place, Marc Zeitoun
Adding Successor: A Transfer Theorem for Separation and Covering. ACM Trans. Comput. Log. 21 (2) (2020)
Thomas Place, Marc Zeitoun
Generic Results for Concatenation Hierarchies. Theory Comput. Syst. 63 (4) (2019)
Thomas Place, Marc Zeitoun
On all things star-free. CoRR (2019)
Thomas Place, Marc Zeitoun
Separation and covering for group based concatenation hierarchies. LICS (2019)
Thomas Place, Marc Zeitoun
Separation and covering for group based concatenation hierarchies. CoRR (2019)
Thomas Place, Marc Zeitoun
Separation for dot-depth two. CoRR (2019)
Thomas Place, Marc Zeitoun
Going Higher in First-Order Quantifier Alternation Hierarchies on Words. J. ACM 66 (2) (2019)
Jorge Almeida, José Carlos Costa, Marc Zeitoun
Recognizing pro-R closures of regular languages. CoRR (2019)
Thomas Place, Marc Zeitoun
On All Things Star-Free. ICALP (2019)
Thomas Place, Marc Zeitoun
A generic characterization of Pol(C). CoRR (2018)
Thomas Place, Marc Zeitoun
The Complexity of Separation for Levels in Concatenation Hierarchies. FSTTCS (2018)
Thomas Place, Marc Zeitoun
The complexity of separation for levels in concatenation hierarchies. CoRR (2018)
Thomas Place, Marc Zeitoun
The Covering Problem. Log. Methods Comput. Sci. 14 (3) (2018)
Thomas Place, Marc Zeitoun
Separating Without Any Ambiguity. ICALP (2018)
Thomas Place, Marc Zeitoun
Generic Results for Concatenation Hierarchies. CoRR (2017)
Thomas Place, Marc Zeitoun
The Covering Problem. CoRR (2017)
Thomas Place, Marc Zeitoun
Separation for dot-depth two. LICS (2017)
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)
Thomas Place, Marc Zeitoun
Adding successor: A transfer theorem for separation and covering. CoRR (2017)
Thomas Place, Marc Zeitoun
Concatenation Hierarchies: New Bottle, Old Wine. CSR (2017)
Jorge Almeida, Alfredo Costa, José Carlos Costa, Marc Zeitoun
The linear nature of pseudowords. CoRR (2017)
Thomas Place, Marc Zeitoun
Going Higher in First-Order Quantifier Alternation Hierarchies on Words. CoRR (2017)
Thomas Place, Marc Zeitoun
Separating Regular Languages with First-Order Logic. Log. Methods Comput. Sci. 12 (1) (2016)
Thomas Place, Marc Zeitoun
The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics. MFCS (2016)
Jorge Almeida, José Carlos Costa, Marc Zeitoun
Factoriality and the Pin-Reutenauer procedure. Discret. Math. Theor. Comput. Sci. 18 (3) (2016)
Théo Pierron, Thomas Place, Marc Zeitoun
Quantifier Alternation for Infinite Words. FoSSaCS (2016)
Thomas Place, Marc Zeitoun
The tale of the quantifier alternation hierarchy of first-order logic over words. ACM SIGLOG News 2 (3) (2015)
Jorge Almeida, José Carlos Costa, Marc Zeitoun
McCammond's normal forms for free aperiodic semigroups revisited. LMS J. Comput. Math. 18 (1) (2015)
Thomas Place, Marc Zeitoun
A Transfer Theorem for the Separation Problem. CoRR (2015)
Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun
A Note on Decidable Separability by Piecewise Testable Languages. FCT (2015)
Thomas Place, Marc Zeitoun
Separation and the Successor Relation. STACS (2015)
Théo Pierron, Thomas Place, Marc Zeitoun
Quantifier Alternation for Infinite Words. CoRR (2015)
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)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
Pebble Weighted Automata and Weighted Logics. ACM Trans. Comput. Log. 15 (2) (2014)
Thomas Place, Marc Zeitoun
Going Higher in the First-Order Quantifier Alternation Hierarchy on Words. ICALP (2) (2014)
Thomas Place, Marc Zeitoun
Going higher in the First-order Quantifier Alternation Hierarchy on Words. CoRR (2014)
Benedikt Bollig, C. Aiswarya, Paul Gastin, Marc Zeitoun
Temporal logics for concurrent recursive programs: Satisfiability and model checking. J. Appl. Log. 12 (4) (2014)
Jorge Almeida, José Carlos Costa, Marc Zeitoun
McCammond's normal forms for free aperiodic semigroups revisited. CoRR (2014)
Jorge Almeida, José Carlos Costa, Marc Zeitoun
Iterated periodicity over finite aperiodic semigroups. Eur. J. Comb. 37 (2014)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
Logical characterization of weighted pebble walking automata. CSL-LICS (2014)
Thomas Place, Marc Zeitoun
Separating regular languages with first-order logic. CSL-LICS (2014)
Thomas Place, Lorijn van Rooijen, Marc Zeitoun
Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages. FSTTCS (2013)
Lorijn van Rooijen, Marc Zeitoun
The separation problem for regular languages by piecewise testable languages CoRR (2013)
Thomas Place, Lorijn van Rooijen, Marc Zeitoun
Separating regular languages by piecewise testable and unambiguous languages CoRR (2013)
Thomas Place, Lorijn van Rooijen, Marc Zeitoun
Separating Regular Languages by Piecewise Testable and Unambiguous Languages. MFCS (2013)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
A Probabilistic Kleene Theorem. ATVA (2012)
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)
Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. MFCS (2011)
Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun
Place-Boundedness for Vector Addition Systems with one zero-test. FSTTCS (2010)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
Pebble Weighted Automata and Transitive Closure Logics. ICALP (2) (2010)
Paul Gastin, Nathalie Sznajder, Marc Zeitoun
Distributed synthesis for well-connected architectures. Formal Methods Syst. Des. 34 (3) (2009)
Jorge Almeida, Marc Zeitoun
Description and analysis of a bottom-up DFA minimization algorithm. Inf. Process. Lett. 107 (2) (2008)
Nicolas Caniart, Emmanuel Fleury, Jérôme Leroux, Marc Zeitoun
Accelerating Interpolation-Based Model-Checking. TACAS (2008)
Blaise Genest, Anca Muscholl, Olivier Serre, Marc Zeitoun
Tree Pattern Rewriting Systems. ATVA (2008)
Jorge Almeida, Marc Zeitoun
An automata-theoretic approach to the word problem for omega -terms over R. Theor. Comput. Sci. 370 (1-3) (2007)
Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun
Infinite-state high-level MSCs: Model-checking and realizability. J. Comput. Syst. Sci. 72 (4) (2006)
Paul Gastin, Nathalie Sznajder, Marc Zeitoun
Distributed Synthesis for Well-Connected Architectures. FSTTCS (2006)
Loïc Hélouët, Marc Zeitoun, Aldric Degorre
Scenarios and Covert Channels: Another Game... Electron. Notes Theor. Comput. Sci. 119 (1) (2005)
Paul Gastin, Benjamin Lerman, Marc Zeitoun
Distributed Games and Distributed Control for Asynchronous Systems. LATIN (2004)
Paul Gastin, Pierre Moro, Marc Zeitoun
Minimization of Counterexamples in SPIN. SPIN (2004)
Paul Gastin, Benjamin Lerman, Marc Zeitoun
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems. FSTTCS (2004)
Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun
Infinite-State High-Level MSCs: Model-Checking and Realizability. ICALP (2002)
Jorge Almeida, Assis Azevedo, Marc Zeitoun
Pseudovariety Joins involving -Trivial Semigroups. Int. J. Algebra Comput. 9 (1) (1999)
Jorge Almeida, Marc Zeitoun
The Pseudovariety J is Hyperdecidable. RAIRO Theor. Informatics Appl. 31 (5) (1997)
Marc Zeitoun
On the Decidability of the Membership Problem of the Pseudovariety J∨B. Int. J. Algebra Comput. 5 (1) (1995)