On regular trace languages
From MaRDI portal
Publication:1097040
DOI10.1016/0304-3975(87)90080-6zbMath0634.68076MaRDI QIDQ1097040
Publication date: 1987
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(87)90080-6
68Q45: Formal languages and automata
68Q70: Algebraic theory of languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
Logical definability of some rational trace languages, A remark on the representation of trace monoids, Efficient recognition of trace languages defined by repeat-until loops, On some equations in free partially commutative monoids, Theory of traces, Star-free trace languages, On the decidability of the equivalence problem for partially commutative rational power series, Recognizable trace languages, distributed automata and the distribution problem, Equidivisible Kleene monoids and the Elgot-Mezei theorem, Two techniques in the area of the star problem in trace monoids, Complete subgraphs of bipartite graphs and applications to trace languages, RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS, WORD EQUATIONS OVER GRAPH PRODUCTS
Uses Software
Cites Work
- Maximal serializability of iterated transactions
- Recognizable subsets of some partially Abelian monoids
- Combinatorial problems of commutation and rearrangements
- Rational sets in commutative monoids
- Deux applications de la représentation matricielle d'une série rationnelle non commutative. (Two applications of matrix representations of a rational non -commutative series)
- Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
- Trace languages defined by regular string languages
- Bounded Algol-Like Languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
