The following pages link to Marc Zeitoun (Q814805):
Displaying 50 items.
- (Q467503) (redirect page) (← links)
- Closures of regular languages for profinite topologies. (Q467504) (← links)
- Temporal logics for concurrent recursive programs: satisfiability and model checking (Q472794) (← links)
- Tameness of pseudovariety joins involving R. (Q814806) (← links)
- Distributed synthesis for well-connected architectures (Q842581) (← links)
- An automata-theoretic approach to the word problem for \(\omega\)-terms over R (Q868948) (← links)
- Description and analysis of a bottom-up DFA minimization algorithm (Q963396) (← links)
- Three examples of join computations (Q1266926) (← links)
- On embedding of finitely generated profinite semigroups into \(2\)-generated profinite semigroups (Q1272151) (← links)
- The join of the pseudovarieties of idempotent semigroups and locally trivial semigroups (Q1891654) (← links)
- Corrigendum: ``The join of the pseudovarieties of idempotent semigroups and locally trivial semigroups'' (Q1910650) (← links)
- Characterizing level one in group-based concatenation hierarchies (Q2097235) (← links)
- Recognizing pro-\(\mathrm{R}\) closures of regular languages (Q2171905) (← links)
- Generic results for concatenation hierarchies (Q2311891) (← links)
- The linear nature of pseudowords (Q2318688) (← links)
- Reducibility of pointlike problems (Q2362748) (← links)
- Concatenation hierarchies: new bottle, old wine (Q2399361) (← links)
- Iterated periodicity over finite aperiodic semigroups (Q2434750) (← links)
- Pointlike sets with respect to R and J. (Q2463850) (← links)
- Complete reducibility of systems of equations with respect to \(\mathbf R\). (Q2479751) (← links)
- Infinite-state high-level MSCs: model-checking and realizability (Q2495403) (← links)
- (Q2743234) (← links)
- Separating Regular Languages with First-Order Logic (Q2794672) (← links)
- Quantifier Alternation for Infinite Words (Q2811342) (← links)
- (Q2849566) (← links)
- Separating Regular Languages by Piecewise Testable and Unambiguous Languages (Q2849957) (← links)
- Model Checking Vector Addition Systems with one zero-test (Q2895472) (← links)
- (Q2908849) (← links)
- On Separation by Locally Testable and Locally Threshold Testable Languages (Q2921121) (← links)
- McCammond’s normal forms for free aperiodic semigroups revisited (Q2940603) (← links)
- A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
- (Q2955031) (← links)
- Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages (Q2963927) (← links)
- Factoriality and the Pin-Reutenauer procedure (Q2965971) (← links)
- Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking (Q3088034) (← links)
- Tree Pattern Rewriting Systems (Q3540083) (← links)
- THE EQUATIONAL THEORY OF ω-TERMS FOR FINITE ${\mathcal R}$-TRIVIAL SEMIGROUPS (Q3552216) (← links)
- Pebble Weighted Automata and Transitive Closure Logics (Q3587470) (← links)
- (Q4227139) (← links)
- The pseudovariety $J$ is hyperdecidable (Q4385676) (← links)
- PSEUDOVARIETY JOINS INVOLVING ${\mathscr J}$ -TRIVIAL SEMIGROUPS (Q4513292) (← links)
- (Q4560219) (← links)
- (Q4580330) (← links)
- (Q4608640) (← links)
- Logical characterization of weighted pebble walking automata (Q4635602) (← links)
- Separating regular languages with first-order logic (Q4635660) (← links)
- A Probabilistic Kleene Theorem (Q4649311) (← links)
- ON THE DECIDABILITY OF THE MEMBERSHIP PROBLEM OF THE PSEUDOVARIETY J∨B (Q4697877) (← links)
- (Q4737197) (← links)
- Tameness of Some Locally Trivial Pseudovarieties (Q4803342) (← links)
