No CrossRef data available.
Article contents
There is no complete axiom system for shuffle expressions
Published online by Cambridge University Press: 15 August 2002
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 1999