Nonfinite axiomatizability of shuffle inequalities
From MaRDI portal
Publication:5096740
DOI10.1007/3-540-59293-8_204zbMath1496.68206MaRDI QIDQ5096740
Publication date: 18 August 2022
Published in: TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59293-8_204
68Q70: Algebraic theory of languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
Long words: The theory of concatenation and \(\omega\)-power, Free shuffle algebras in language varieties, Axiomatizing shuffle and concatenation in languages, Shuffle and scattered deletion closure of languages