Two equational theories of partial words

DOI10.1016/j.tcs.2018.04.010zbMath1435.68249OpenAlexW2803026316WikidataQ129979992 ScholiaQ129979992MaRDI QIDQ1643141

Christian Choffrut, Zoltán Ésik

Publication date: 18 June 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.04.010

zbMATH Keywords

varietiespartial ordersequational theories

Mathematics Subject Classification ID

Combinatorics on words (68R15) Equational logic, Mal'tsev conditions (08B05) Equational classes, universal algebra in model theory (03C05)

Related Items

Equational Theories of Scattered and Countable Series-Parallel Posets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Series-parallel languages on scattered and countable posets
• Modeling concurrency with partial orders
• The equational theory of pomsets
• Series-parallel languages and the bounded-width property
• Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets
• On frontiers of regular trees
• The Recognition of Series Parallel Digraphs
• AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
• Long words: The theory of concatenation and \(\omega\)-power