Marc Zeitoun

According to our database1, Marc Zeitoun authored at least 40 papers between 1995 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Generic Results for Concatenation Hierarchies.
Theory Comput. Syst., 2019

Going Higher in First-Order Quantifier Alternation Hierarchies on Words.
J. ACM, 2019

On All Things Star-Free.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
The Covering Problem.
Logical Methods in Computer Science, 2018

Separating Without Any Ambiguity.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

The Complexity of Separation for Levels in Concatenation Hierarchies.
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.
Discrete Mathematics & Theoretical Computer Science, 2017

Separation for dot-depth two.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Concatenation Hierarchies: New Bottle, Old Wine.
Proceedings of the Computer Science - Theory and Applications, 2017

2016
Factoriality and the Pin-Reutenauer procedure.
Discrete Mathematics & Theoretical Computer Science, 2016

The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Quantifier Alternation for Infinite Words.
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.
SIGLOG News, 2015

Separation and the Successor Relation.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

A Note on Decidable Separability by Piecewise Testable Languages.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014
Pebble Weighted Automata and Weighted Logics.
ACM Trans. Comput. Log., 2014

Iterated periodicity over finite aperiodic semigroups.
Eur. J. Comb., 2014

Going Higher in the First-Order Quantifier Alternation Hierarchy on Words.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Separating regular languages with first-order logic.
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

Logical characterization of weighted pebble walking automata.
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
Separating Regular Languages by Piecewise Testable and Unambiguous Languages.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012
Model Checking Vector Addition Systems with one zero-test
Logical Methods in Computer Science, 2012

A Probabilistic Kleene Theorem.
Proceedings of the Automated Technology for Verification and Analysis, 2012

2011
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010
Pebble Weighted Automata and Transitive Closure Logics.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Place-Boundedness for Vector Addition Systems with one zero-test.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2008
Description and analysis of a bottom-up DFA minimization algorithm.
Inf. Process. Lett., 2008

Accelerating Interpolation-Based Model-Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

Tree Pattern Rewriting Systems.
Proceedings of the Automated Technology for Verification and Analysis, 2008

2007
An automata-theoretic approach to the word problem for omega -terms over R.
Theor. Comput. Sci., 2007

2006
Distributed Synthesis for Well-Connected Architectures.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005
Scenarios and Covert Channels: Another Game...
Electr. Notes Theor. Comput. Sci., 2005

2004
Minimization of Counterexamples in SPIN.
Proceedings of the Model Checking Software, 2004

Distributed Games and Distributed Control for Asynchronous Systems.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2002
Infinite-State High-Level MSCs: Model-Checking and Realizability.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

1999
Pseudovariety Joins involving -Trivial Semigroups.
IJAC, 1999

1997
The Pseudovariety J is Hyperdecidable.
ITA, 1997

1995
On the Decidability of the Membership Problem of the Pseudovariety J∨B.
IJAC, 1995


  Loading...