Marc Zeitoun - RankMe

87 papers A* 8A 2B 11C 2Misc 2Journal 50Unranked 12

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