Solving Equations on Words with Morphisms and Antimorphisms

DOI10.1007/978-3-319-04921-2_15zbMATH Open1407.68381OpenAlexW125925145MaRDI QIDQ5404911FDOQ5404911

S. Hallé, Michaël Larouche, S. Gaboury, Alexandre Blondin Massé

Publication date: 31 March 2014

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04921-2_15

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05) Combinatorics on words (68R15)

Cited In (5)

• On the Solvability Problem for Restricted Classes of Word Equations
• Title not available (Why is that?)
• On the edge-independence number and edge-covering number for regular graphs
• Unification modulo lists with reverse relation with certain word equations
• Solving word equations modulo partial commutations

This page was built for publication: Solving Equations on Words with Morphisms and Antimorphisms

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