On the Decidability of the Membership Problem of the Pseudovariety J∨B. - Marc Zeitoun (Int. J. Algebra Comput., 1995)

The Pseudovariety J is Hyperdecidable. - Jorge Almeida 001; Marc Zeitoun (RAIRO Theor. Informatics Appl., 1997)

Pseudovariety Joins involving -Trivial Semigroups. - Jorge Almeida 001; Assis Azevedo; Marc Zeitoun (Int. J. Algebra Comput., 1999)

Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems. - Paul Gastin; Benjamin Lerman; Marc Zeitoun (FSTTCS, 2004)

Distributed Games and Distributed Control for Asynchronous Systems. - Paul Gastin; Benjamin Lerman; Marc Zeitoun (LATIN, 2004)

Minimization of Counterexamples in SPIN. - Paul Gastin; Pierre Moro; Marc Zeitoun (SPIN, 2004)

Scenarios and Covert Channels: Another Game... - Loïc Hélouët; Marc Zeitoun; Aldric Degorre (GDV@CAV, 2004)

Infinite-state high-level MSCs: Model-checking and realizability. - Blaise Genest; Anca Muscholl; Helmut Seidl; Marc Zeitoun (J. Comput. Syst. Sci., 2006)

An automata-theoretic approach to the word problem for omega -terms over R. - Jorge Almeida 001; Marc Zeitoun (Theor. Comput. Sci., 2007)

Tree Pattern Rewriting Systems. - Blaise Genest; Anca Muscholl; Olivier Serre; Marc Zeitoun (ATVA, 2008)

Accelerating Interpolation-Based Model-Checking. - Nicolas Caniart; Emmanuel Fleury; Jérôme Leroux; Marc Zeitoun (TACAS, 2008)

Description and analysis of a bottom-up DFA minimization algorithm. - Jorge Almeida 001; Marc Zeitoun (Inf. Process. Lett., 2008)

Distributed synthesis for well-connected architectures. - Paul Gastin; Nathalie Sznajder; Marc Zeitoun (Formal Methods Syst. Des., 2009)

Place-Boundedness for Vector Addition Systems with one zero-test. - Rémi Bonnet; Alain Finkel; Jérôme Leroux; Marc Zeitoun (FSTTCS, 2010)

Pebble Weighted Automata and Transitive Closure Logics. - Benedikt Bollig; Paul Gastin; Benjamin Monmege; Marc Zeitoun (ICALP (2), 2010)

A Probabilistic Kleene Theorem. - Benedikt Bollig; Paul Gastin; Benjamin Monmege; Marc Zeitoun (ATVA, 2012)

Model Checking Vector Addition Systems with one zero-test - Rémi Bonnet; Alain Finkel; Jérôme Leroux; Marc Zeitoun (Log. Methods Comput. Sci., 2012)

Separating Regular Languages by Piecewise Testable and Unambiguous Languages. - Thomas Place; Lorijn van Rooijen; Marc Zeitoun (MFCS, 2013)

The separation problem for regular languages by piecewise testable languages - Lorijn van Rooijen; Marc Zeitoun (CoRR, 2013)

Logical characterization of weighted pebble walking automata. - Benedikt Bollig; Paul Gastin; Benjamin Monmege; Marc Zeitoun (CSL-LICS, 2014)

Going Higher in the First-Order Quantifier Alternation Hierarchy on Words. - Thomas Place; Marc Zeitoun (ICALP (2), 2014)

Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages. - Thomas Place; Lorijn van Rooijen; Marc Zeitoun (Log. Methods Comput. Sci., 2014)

Iterated periodicity over finite aperiodic semigroups. - Jorge Almeida 001; José Carlos Costa; Marc Zeitoun (Eur. J. Comb., 2014)

Temporal logics for concurrent recursive programs: Satisfiability and model checking. - Benedikt Bollig; C. Aiswarya; Paul Gastin; Marc Zeitoun (J. Appl. Log., 2014)

Pebble Weighted Automata and Weighted Logics. - Benedikt Bollig; Paul Gastin; Benjamin Monmege; Marc Zeitoun (ACM Trans. Comput. Log., 2014)

A Note on Decidable Separability by Piecewise Testable Languages. - Wojciech Czerwinski; Wim Martens; Lorijn van Rooijen; Marc Zeitoun (FCT, 2015)

Separation and the Successor Relation. - Thomas Place; Marc Zeitoun (STACS, 2015)

A Transfer Theorem for the Separation Problem. - Thomas Place; Marc Zeitoun (CoRR, 2015)

McCammond's normal forms for free aperiodic semigroups revisited. - Jorge Almeida 001; José Carlos Costa; Marc Zeitoun (LMS J. Comput. Math., 2015)

The tale of the quantifier alternation hierarchy of first-order logic over words. - Thomas Place; Marc Zeitoun (ACM SIGLOG News, 2015)

Quantifier Alternation for Infinite Words. - Théo Pierron; Thomas Place; Marc Zeitoun (FoSSaCS, 2016)

The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics. - Thomas Place; Marc Zeitoun (MFCS, 2016)

Separating Regular Languages with First-Order Logic. - Thomas Place; Marc Zeitoun (Log. Methods Comput. Sci., 2016)

Factoriality and the Pin-Reutenauer procedure. - Jorge Almeida 001; José Carlos Costa; Marc Zeitoun (Discret. Math. Theor. Comput. Sci., 2016)

Concatenation Hierarchies: New Bottle, Old Wine. - Thomas Place; Marc Zeitoun (CSR, 2017)

The linear nature of pseudowords. - Jorge Almeida 001; Alfredo Costa; José Carlos Costa; Marc Zeitoun (CoRR, 2017)

A Characterization for Decidable Separability by Piecewise Testable Languages. - Wojciech Czerwinski; Wim Martens; Lorijn van Rooijen; Marc Zeitoun; Georg Zetzsche (Discret. Math. Theor. Comput. Sci., 2017)

The Complexity of Separation for Levels in Concatenation Hierarchies. - Thomas Place; Marc Zeitoun (FSTTCS, 2018)

Separating Without Any Ambiguity. - Thomas Place; Marc Zeitoun (ICALP, 2018)

A generic characterization of Pol(C). - Thomas Place; Marc Zeitoun (CoRR, 2018)

The Covering Problem. - Thomas Place; Marc Zeitoun (Log. Methods Comput. Sci., 2018)

On All Things Star-Free. - Thomas Place; Marc Zeitoun (ICALP, 2019)

Separation and covering for group based concatenation hierarchies. - Thomas Place; Marc Zeitoun (LICS, 2019)

Recognizing pro-R closures of regular languages. - Jorge Almeida 001; José Carlos Costa; Marc Zeitoun (CoRR, 2019)

Going Higher in First-Order Quantifier Alternation Hierarchies on Words. - Thomas Place; Marc Zeitoun (J. ACM, 2019)

Generic Results for Concatenation Hierarchies. - Thomas Place; Marc Zeitoun (Theory Comput. Syst., 2019)

Selected papers of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017. - Ralf Klasing; Marc Zeitoun (J. Comput. Syst. Sci., 2020)

Adding Successor: A Transfer Theorem for Separation and Covering. - Thomas Place; Marc Zeitoun (ACM Trans. Comput. Log., 2020)

Separation for dot-depth two. - Thomas Place; Marc Zeitoun (Log. Methods Comput. Sci., 2021)

Characterizing Level One in Group-Based Concatenation Hierarchies. - Thomas Place; Marc Zeitoun (CSR, 2022)

A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier Alternation. - Thomas Place; Marc Zeitoun (FSTTCS, 2022)

How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic? - Thomas Place; Marc Zeitoun (LATIN, 2022)

Unambiguous polynomial closure explained. - Thomas Place; Marc Zeitoun (CoRR, 2022)

Group Separation Strikes Back. - Thomas Place; Marc Zeitoun (LICS, 2023)

All about unambiguous polynomial closure. - Thomas Place; Marc Zeitoun (TheoretiCS, 2023)

A Generic Characterization of Generalized Unary Temporal Logic and Two-Variable First-Order Logic. - Thomas Place; Marc Zeitoun (CSL, 2024)

Dot-depth three, return of the J-class. - Thomas Place; Marc Zeitoun (LICS, 2024)

Temporal hierarchies of regular languages. - Thomas Place; Marc Zeitoun (CoRR, 2024)

Closing Star-Free Closure. - Thomas Place; Marc Zeitoun (ACM Trans. Comput. Log., 2025)