On regular compatibility of semi-commutations

DOI10.1007/3-540-56939-1_93zbMATH Open1422.68158OpenAlexW1529898349MaRDI QIDQ4630282FDOQ4630282

Authors: Edward Ochmański, Pierre-André Wacrenier 

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_93

Recommendations

• Semi-commutations
• scientific article; zbMATH DE number 3954296
• Efficiency of automata in semi-commutation verification techniques
• scientific article; zbMATH DE number 176737
• Regular languages and partial commutations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Semi-commutations
• Modelling concurrency with semi-commutations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recognizable closures and submonoids of free partially commutative monoids
• Semi-commutations and rational expressions
• Semi-commutations and Petri nets

Cited In (7)

• Semi-trace morphisms and rational transductions
• Semi-commutativity and the McCoy condition.
• The generalized rank of trace languages
• On the synchronization of semi-traces
• Efficiency of automata in semi-commutation verification techniques
• Computing the closure of sets of words under partial commutations
• Semicommutations and algebraic languages

This page was built for publication: On regular compatibility of semi-commutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630282)