Search Results - "Jean-eric Pin"

Elements of Timed Pattern Matching.

Authors: Ulus, Dogan Ferrère, Thomas Asarin, Eugene et al.

Source: ACM Transactions on Embedded Computing Systems; Jul2024, Vol. 23 Issue 4, p1-45, 45p

An Axiomatic Theory for Reversible Computation.

Authors: Lanese, Ivan Phillips, Iain Ulidowski, Irek

Source: ACM Transactions on Computational Logic; Apr2024, Vol. 25 Issue 2, p1-40, 40p

Products, Polynomials and Differential Equations in the Stream Calculus.

Authors: Boreale, Michele Collodi, Luisa Gorla, Daniele

Source: ACM Transactions on Computational Logic; Jan2024, Vol. 25 Issue 1, p1-26, 26p

In memoriam: Klaus Keimel (1939-2017).

Authors: Hofmann, Karl Lawson, Jimmie

Source: Semigroup Forum. Apr2018, Vol. 96 Issue 2, p199-202. 4p.

EXTENDED STONE DUALITY VIA MONOIDAL ADJUNCTIONS.

Authors: LENKE, FABIAN URBAT, HENNING MILIUS, STEFAN

Source: Logical Methods in Computer Science (LMCS); 2025, Vol. 21 Issue 4, p4:1-4:55, 55p

Subsequence versus substring constraints in sequence pattern languages.

Authors: Engels, Steven Tan, Tony Van den Bussche, Jan

Source: Acta Informatica; Apr2021, Vol. 58 Issue 1/2, p35-56, 22p

On partial endomorphisms of a star graph.

Authors: Dimitrova, Ilinka Fernandes, Vítor H. Koppitz, Jörg

Source: QM - Quaestiones Mathematicae. Dec2024, Vol. 47 Issue 12, p2485-2505. 21p.

LOGICAL AND ALGEBRAIC CHARACTERIZATIONS OF RATIONAL TRANSDUCTIONS.

Authors: FILIOT, EMMANUEL GAUWIN, OLIVIER LHOTE, NATHAN

Source: Logical Methods in Computer Science (LMCS); Oct2019, Vol. 15 Issue 4, p1-42, 42p, 4 Diagrams, 1 Chart

A NON-REGULAR LANGUAGE OF INFINITE TREES THAT IS RECOGNIZED BY A SORT-WISE FINITE ALGEBRA.

Authors: BOJAŃCZYK, MIKOŁAJ KLIN, BARTEK

Source: Logical Methods in Computer Science (LMCS); Oct2019, Vol. 15 Issue 4, p1-13, 13p, 5 Graphs

Preface.

Authors: Bulatov, Andrei Hirsch, Edward Pin, Jean-Éric

Source: Theory of Computing Systems; Aug2017, Vol. 61 Issue 2, p261-262, 2p

HALF-POSITIONAL OBJECTIVES RECOGNIZED BY DETERMINISTIC BÜCHI AUTOMATA.

Authors: BOUYER, PATRICIA CASARES, ANTONIO RANDOUR, MICKAEL et al.

Source: Logical Methods in Computer Science (LMCS); 2024, Vol. 20 Issue 3, p19:1-19:42, 42p

REGULAR TREE LANGUAGES IN LOW LEVELS OF THE WADGE HIERARCHY.

Authors: BOJANCZYK, MIKO LAJ CAVALLARI, FILIPPO PLACE, THOMAS et al.

Source: Logical Methods in Computer Science (LMCS); 2019, Vol. 15 Issue 3, p1-61, 61p

THE LOGICAL STRENGTH OF BÜCHI'S DECIDABILITY THEOREM.

Authors: KOŁODZIEJCZYK, LESZEK A. MICHALEWSKI, HENRYK PRADIC, CÉCILIA et al.

Source: Logical Methods in Computer Science (LMCS); Apr2019, Vol. 15 Issue 2, p1-31, 31p, 7 Graphs

AMBIGUITY HIERARCHY OF REGULAR INFINITE TREE LANGUAGES.

Authors: RABINOVICH, ALEXANDER TIFERET, DORON

Source: Logical Methods in Computer Science (LMCS); 2021, Vol. 17 Issue 3, p1-28, 28p

A short note on strongly flat covers of acts over monoids.

Authors: Bailey, Alex Renshaw, James

Source: Semigroup Forum. Oct2016, Vol. 93 Issue 2, p416-422. 7p.

Describing Weighted Safety with Weighted LTL over Product ω-valuation Monoids.

Authors: MANDRALI, Eleni¹, elemandr@gmail.comelemandr@math.auth.gr

Source: Scientific Annals of Computer Science; 2023, Vol. 33 Issue 2, p93-157, 65p

A tribute to John B. Fountain.

Authors: Gould, Victoria A. R. Lawson, Mark V.

Source: Semigroup Forum. Aug2019, Vol. 99 Issue 1, p1-8. 8p.

EFFECTIVE CHARACTERIZATIONS OF SIMPLE FRAGMENTS OF TEMPORAL LOGIC USING CARTON–MICHEL AUTOMATA.

Authors: PREUGSCHAT, EBASTIAN WILKE, THOMAS

Source: Logical Methods in Computer Science (LMCS); Apr2013, Vol. 9 Issue 2, p1-22, 22p

TAMENESS AND THE POWER OF PROGRAMS OVER MONOIDS IN DA.

Authors: GROSSHANS, NATHAN MCKENZIE, PIERRE SEGOUFIN, LUC

Source: Logical Methods in Computer Science (LMCS); 2022, Vol. 18 Issue 3, p1-34, 34p

A noncommutative extension of Mahler's interpolation theorem.

Authors: Pin, Jean-Éric Reutenauer, Christophe

Source: Journal of Noncommutative Geometry. 2022, Vol. 16 Issue 3, p1055-1101. 47p.