Axiomatizing shuffle and concatenation in languages
type: Item
instance of: scholarly article
title: Axiomatizing shuffle and concatenation in languages
zbMATH Open document ID: 0892.68055
author: Stephen L. Bloom
author: Zoltán Ésik
published in: Information and Computation
publication date: 1998-05-04T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1138499
zbMATH Keywords: variety \({\mathbf L}{\mathbf a}{\mathbf n}{\mathbf g}\)
MaRDI profile type: Publication
full work available at URL: inco.1997.2665
OpenAlex ID: W2061007349
cites work: Equational axioms for regular sets
cites work: Nonfinite axiomatizability of shuffle inequalities
cites work: Free shuffle algebras in language varieties
cites work: Varieties of ordered algebras
cites work: Nonfinite axiomatizability of the equational theory of shuffle
cites work: Shuffle languages, Petri nets, and context-sensitive grammars
cites work: The equational theory of pomsets
cites work: Q3922196
cites work: Q4287490
cites work: Languages under concatenation and shuffling
cites work: The Recognition of Series Parallel Digraphs
cites work: Failures semantics based on interval semiwords is a congruence for refinement
DOI: 10.1006/INCO.1997.2665
description: scientific article; zbMATH DE number 1138499