On regular compatibility of semi-commutations
From MaRDI portal
Publication:4630282
DOI10.1007/3-540-56939-1_93zbMath1422.68158OpenAlexW1529898349MaRDI QIDQ4630282
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
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
On the synchronization of semi-traces, Semi-trace morphisms and rational transductions, The Generalized Rank of Trace Languages, Computing the closure of sets of words under partial commutations
Cites Work