We stand with Ukraine

We stand with Ukraine

Marc Zeitoun

Orcid: 0000-0003-4101-8437

Affiliations:

University of Bordeaux 1, LABRI, France

According to our database¹, Marc Zeitoun authored at least 59 papers between 1995 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

on orcid.org
on labri.fr

On csauthors.net:

Bibliography

2024

Temporal hierarchies of regular languages.

[BibT_eX]

[DOI]

,

CoRR, 2024

Dot-depth three, return of the J-class.

[BibT_eX]

[DOI]

,

CoRR, 2024

A Generic Characterization of Generalized Unary Temporal Logic and Two-Variable First-Order Logic.

[BibT_eX]

[DOI]

,

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

All about unambiguous polynomial closure.

[BibT_eX]

[DOI]

,

TheoretiCS, 2023

Closing star-free closure.

[BibT_eX]

[DOI]

,

CoRR, 2023

Group Separation Strikes Back.

[BibT_eX]

[DOI]

,

LICS, 2023

2022

Unambiguous polynomial closure explained.

[BibT_eX]

[DOI]

,

CoRR, 2022

How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic?

[BibT_eX]

[DOI]

,

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier Alternation.

[BibT_eX]

[DOI]

,

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Characterizing Level One in Group-Based Concatenation Hierarchies.

[BibT_eX]

[DOI]

,

Proceedings of the Computer Science - Theory and Applications, 2022

2021

Separation for dot-depth two.

[BibT_eX]

[DOI]

,

Log. Methods Comput. Sci., 2021

2020

Adding Successor: A Transfer Theorem for Separation and Covering.

[BibT_eX]

[DOI]

,

ACM Trans. Comput. Log., 2020

Selected papers of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017.

[BibT_eX]

[DOI]

,

J. Comput. Syst. Sci., 2020

2019

Generic Results for Concatenation Hierarchies.

[BibT_eX]

[DOI]

,

Theory Comput. Syst., 2019

Going Higher in First-Order Quantifier Alternation Hierarchies on Words.

[BibT_eX]

[DOI]

,

J. ACM, 2019

Recognizing pro-R closures of regular languages.

[BibT_eX]

[DOI]

,

José Carlos Costa

,

CoRR, 2019

Separation and covering for group based concatenation hierarchies.

[BibT_eX]

[DOI]

,

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

On All Things Star-Free.

[BibT_eX]

[DOI]

,

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

The Covering Problem.

[BibT_eX]

[DOI]

,

Log. Methods Comput. Sci., 2018

A generic characterization of Pol(C).

[BibT_eX]

[DOI]

,

CoRR, 2018

Separating Without Any Ambiguity.

[BibT_eX]

[DOI]

,

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

The Complexity of Separation for Levels in Concatenation Hierarchies.

[BibT_eX]

[DOI]

,

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

A Characterization for Decidable Separability by Piecewise Testable Languages.

[BibT_eX]

[DOI]

Wojciech Czerwinski

,

,

Lorijn van Rooijen

,

,

Discret. Math. Theor. Comput. Sci., 2017

The linear nature of pseudowords.

[BibT_eX]

[DOI]

,

,

José Carlos Costa

,

CoRR, 2017

Concatenation Hierarchies: New Bottle, Old Wine.

[BibT_eX]

[DOI]

,

Proceedings of the Computer Science - Theory and Applications, 2017

2016

Factoriality and the Pin-Reutenauer procedure.

[BibT_eX]

[DOI]

,

José Carlos Costa

,

Discret. Math. Theor. Comput. Sci., 2016

Separating Regular Languages with First-Order Logic.

[BibT_eX]

[DOI]

,

Log. Methods Comput. Sci., 2016

The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics.

[BibT_eX]

[DOI]

,

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Quantifier Alternation for Infinite Words.

[BibT_eX]

[DOI]

,

,

Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015

The tale of the quantifier alternation hierarchy of first-order logic over words.

[BibT_eX]

[DOI]

,

ACM SIGLOG News, 2015

McCammond's normal forms for free aperiodic semigroups revisited.

[BibT_eX]

[DOI]

,

José Carlos Costa

,

LMS J. Comput. Math., 2015

A Transfer Theorem for the Separation Problem.

[BibT_eX]

[DOI]

,

CoRR, 2015

Separation and the Successor Relation.

[BibT_eX]

[DOI]

,

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

A Note on Decidable Separability by Piecewise Testable Languages.

[BibT_eX]

[DOI]

Wojciech Czerwinski

,

,

Lorijn van Rooijen

,

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014

Pebble Weighted Automata and Weighted Logics.

[BibT_eX]

[DOI]

Benedikt Bollig

,

,

Benjamin Monmege

,

ACM Trans. Comput. Log., 2014

Temporal logics for concurrent recursive programs: Satisfiability and model checking.

[BibT_eX]

[DOI]

Benedikt Bollig

,

,

,

J. Appl. Log., 2014

Iterated periodicity over finite aperiodic semigroups.

[BibT_eX]

[DOI]

,

José Carlos Costa

,

Eur. J. Comb., 2014

Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages.

[BibT_eX]

[DOI]

,

Lorijn van Rooijen

,

Log. Methods Comput. Sci., 2014

Going Higher in the First-Order Quantifier Alternation Hierarchy on Words.

[BibT_eX]

[DOI]

,

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Logical characterization of weighted pebble walking automata.

[BibT_eX]

[DOI]

Benedikt Bollig

,

,

Benjamin Monmege

,

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013

The separation problem for regular languages by piecewise testable languages

[BibT_eX]

[DOI]

Lorijn van Rooijen

,

CoRR, 2013

Separating Regular Languages by Piecewise Testable and Unambiguous Languages.

[BibT_eX]

[DOI]

,

Lorijn van Rooijen

,

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012

Model Checking Vector Addition Systems with one zero-test

[BibT_eX]

[DOI]

,

,

Jérôme Leroux

,

Log. Methods Comput. Sci., 2012

A Probabilistic Kleene Theorem.

[BibT_eX]

[DOI]

Benedikt Bollig

,

,

Benjamin Monmege

,

Proceedings of the Automated Technology for Verification and Analysis, 2012

2010

Pebble Weighted Automata and Transitive Closure Logics.

[BibT_eX]

[DOI]

Benedikt Bollig

,

,

Benjamin Monmege

,

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Place-Boundedness for Vector Addition Systems with one zero-test.

[BibT_eX]

[DOI]

,

,

Jérôme Leroux

,

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009

Distributed synthesis for well-connected architectures.

[BibT_eX]

[DOI]

,

Nathalie Sznajder

,

Formal Methods Syst. Des., 2009

2008

Description and analysis of a bottom-up DFA minimization algorithm.

[BibT_eX]

[DOI]

,

Inf. Process. Lett., 2008

Accelerating Interpolation-Based Model-Checking.

[BibT_eX]

[DOI]

Nicolas Caniart

,

Emmanuel Fleury

,

Jérôme Leroux

,

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

Tree Pattern Rewriting Systems.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Automated Technology for Verification and Analysis, 2008

2007

An automata-theoretic approach to the word problem for omega -terms over R.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 2007

2006

Infinite-state high-level MSCs: Model-checking and realizability.

[BibT_eX]

[DOI]

,

,

,

J. Comput. Syst. Sci., 2006

2004

Scenarios and Covert Channels: Another Game...

[BibT_eX]

[DOI]

Loïc Hélouët

,

,

Proceedings of the Workshop on Games in Design and Verification, 2004

Minimization of Counterexamples in SPIN.

[BibT_eX]

[DOI]

,

,

Proceedings of the Model Checking Software, 2004

Distributed Games and Distributed Control for Asynchronous Systems.

[BibT_eX]

[DOI]

,

Benjamin Lerman

,

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems.

[BibT_eX]

[DOI]

,

Benjamin Lerman

,

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

1999

Pseudovariety Joins involving -Trivial Semigroups.

[BibT_eX]

[DOI]

,

,

Int. J. Algebra Comput., 1999

1997

The Pseudovariety J is Hyperdecidable.

[BibT_eX]

[DOI]

,

RAIRO Theor. Informatics Appl., 1997

1995

On the Decidability of the Membership Problem of the Pseudovariety J∨B.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1995

Loading...