| Issue |
RAIRO-Theor. Inf. Appl.
Volume 33, Number 3, May June 1999
|
|
|---|---|---|
| Page(s) | 271 - 277 | |
| DOI | https://doi.org/10.1051/ita:1999117 | |
| Published online | 15 August 2002 | |
There is no complete axiom system for shuffle expressions
Mathematical Institute, University of Gdańsk,
ul. Wita Stwosza 57, 80-952 Gdańsk, Po land;
matszp@halina.univ.gda.pl.
Received:
January
1999
Accepted:
March
1999
In this paper we show that neither the set of all valid equations between shuffle expressions nor the set of schemas of valid equations is recursively enumerable. Thus, neither of the sets can be recursively generated by any axiom system.
Mathematics Subject Classification: 68Q45
© EDP Sciences, 1999
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.