Nonfinite axiomatizability of shuffle inequalities

Stephen L. Bloom, Z. Ésik

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Citations (Scopus)

Abstract

There is some set of inequations t≤t′ whose models are the algebras in the variety of ordered algebras generated by the algebras L =(P ,.,⊗,1) where P consists of all subsets of the free monoid ∑ *, B·C={uv: u∈B, υ∈C}, and B ⊗ C is the shuffle product of the two languages. We show that there is no finite set of such inequations.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages318-333
Number of pages16
Volume915
ISBN (Print)3540592938, 9783540592938
DOIs
Publication statusPublished - 1995
Event6th International Joint Conference on Theory and Practice of Software Development, TAPSOFT 1995 - Aarhus, Denmark
Duration: May 22 1995May 26 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume915
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other6th International Joint Conference on Theory and Practice of Software Development, TAPSOFT 1995
CountryDenmark
CityAarhus
Period5/22/955/26/95

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Bloom, S. L., & Ésik, Z. (1995). Nonfinite axiomatizability of shuffle inequalities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 915, pp. 318-333). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 915). Springer Verlag. https://doi.org/10.1007/3-540-59293-8_204