Axiomatizing shuffle and concatenation in languages
From MaRDI portal
Publication:1383153
DOI10.1006/INCO.1997.2665zbMATH Open0892.68055OpenAlexW2061007349MaRDI QIDQ1383153FDOQ1383153
Authors: Stephen L. Bloom, Zoltán Ésik 
Publication date: 4 May 1998
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1997.2665
Recommendations
Cites Work
- Varieties of ordered algebras
- Equational axioms for regular sets
- The Recognition of Series Parallel Digraphs
- The equational theory of pomsets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Free shuffle algebras in language varieties
- Shuffle languages, Petri nets, and context-sensitive grammars
- Languages under concatenation and shuffling
- Nonfinite axiomatizability of shuffle inequalities
- Failures semantics based on interval semiwords is a congruence for refinement
- Nonfinite axiomatizability of the equational theory of shuffle
Cited In (11)
- On Kedlaya-type inequalities for weighted means
- On a hierarchy of languages with catenation and shuffle
- Shuffle on trajectories: Syntactic constraints
- Shuffle on positive varieties of languages
- On Hardy-type inequalities for weighted means
- CCS with Hennessy's merge has no finite-equational axiomatization
- Nonfinite axiomatizability of shuffle inequalities
- The quest for equational axiomatizations of parallel composition: status and open problems
- There is no complete axiom system for shuffle expressions
- Shuffled languages -- representation and recognition
- Nonfinite axiomatizability of the equational theory of shuffle
This page was built for publication: Axiomatizing shuffle and concatenation in languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383153)
