Shuffle binoids
RAIRO-Theor. Inf. Appl., 32 4-6 (1998) 175-198
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Developments in Language Theory
Amrane Amazigh and Nicolas BedonLecture Notes in Computer Science, Developments in Language Theory 12086 1 (2020)
https://doi.org/10.1007/978-3-030-48516-0_1
Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by $$\omega $$
Christian Choffrut and Serge GrigorieffAlgebra universalis 81 (3) (2020)
https://doi.org/10.1007/s00012-020-00671-9
Two equational theories of partial words
Ch. Choffrut and Z. ÉsikTheoretical Computer Science 737 19 (2018)
https://doi.org/10.1016/j.tcs.2018.04.010
Series-parallel languages on scattered and countable posets
Nicolas Bedon and Chloé RispalTheoretical Computer Science 412 (22) 2356 (2011)
https://doi.org/10.1016/j.tcs.2011.01.016
CONCUR 2007 – Concurrency Theory
Luca Aceto and Anna IngolfsdottirLecture Notes in Computer Science, CONCUR 2007 – Concurrency Theory 4703 2 (2007)
https://doi.org/10.1007/978-3-540-74407-8_2
Mathematical Foundations of Computer Science 2007
Nicolas Bedon and Chloé RispalLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2007 4708 477 (2007)
https://doi.org/10.1007/978-3-540-74456-6_43
CCS with Hennessy's merge has no finite-equational axiomatization
Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir and Bas LuttikTheoretical Computer Science 330 (3) 377 (2005)
https://doi.org/10.1016/j.tcs.2004.10.003
Algebraic and graph-theoretic properties of infiniten-posets
Zoltán Ésik and Zoltán L. NémethRAIRO - Theoretical Informatics and Applications 39 (1) 305 (2005)
https://doi.org/10.1051/ita:2005018
Towards a language theory for infinite N-free pomsets
Dietrich KuskeTheoretical Computer Science 299 (1-3) 347 (2003)
https://doi.org/10.1016/S0304-3975(02)00370-5
Axiomatizing the subsumption and subword preorders on finite and infinite partial words
Zoltán ÉsikTheoretical Computer Science 273 (1-2) 225 (2002)
https://doi.org/10.1016/S0304-3975(00)00442-4
Long words: the theory of concatenation and ω-power
Stephen L. Bloom and Christian ChoffrutTheoretical Computer Science 259 (1-2) 533 (2001)
https://doi.org/10.1016/S0304-3975(00)00040-2
LATIN 2000: Theoretical Informatics
Stephen L. Bloom and Zoltán ÉsikLecture Notes in Computer Science, LATIN 2000: Theoretical Informatics 1776 367 (2000)
https://doi.org/10.1007/10719839_36
Automata, Languages and Programming
Dietrich KuskeLecture Notes in Computer Science, Automata, Languages and Programming 1853 648 (2000)
https://doi.org/10.1007/3-540-45022-X_55
Foundations of Software Technology and Theoretical Computer Science
Zoltán Ésik and Satoshi OkawaLecture Notes in Computer Science, Foundations of Software Technology and Theoretical Computer Science 1738 316 (1999)
https://doi.org/10.1007/3-540-46691-6_25
There is no complete axiom system for shuffle expressions
A. SzepietowskiRAIRO - Theoretical Informatics and Applications 33 (3) 271 (1999)
https://doi.org/10.1051/ita:1999117