Unambiguous erasing morphisms in free monoids

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.1051/ITA/2009020" rel="nofollow">DOI 10.1051/ITA/2009020</a><a class="pub-badge pub-badge--grey" href="https://zbmath.org/1203.68132" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--grey" href="https://openalex.org/works/W2170353776" rel="nofollow">OpenAlex</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q3566348" rel="nofollow">MaRDI QID Q3566348</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q3566348" rel="nofollow">FDO</a>

Authors Johannes Schneider

Publication date 7 June 2010

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/44604

zbMATH Keywords

complexitycombinatorics on wordsunambiguitymorphisms in free monoids

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15)

Recommendations

• Unambiguous Erasing Morphisms in Free Monoids
• scientific article; zbMATH DE number 1303030
• scientific article; zbMATH DE number 826074
• Eraser morphisms and membership problem in groups and monoids
• Asymptotic properties of free monoid morphisms
• Factorizations of free monoids and unavoidable regularities
• scientific article; zbMATH DE number 3975229
• Publication:4723969
• scientific article; zbMATH DE number 1047906
• On equality sets of morphisms in topological free monoids

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A non-learnable class of E-pattern languages
• Decision problems for patterns
• Discontinuities in pattern inference
• Finding a homomorphism between two words is NP-complete
• Fixed languages and the adult languages of ol schemest^†
• Morphically primitive words
• The Unambiguity of Segmented Morphisms
• UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
• Unambiguous Erasing Morphisms in Free Monoids

Cited in

(9)

• On the parameterised complexity of string morphism problems
• Restricted ambiguity of erasing morphisms
• UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
• Restricted ambiguity of erasing morphisms
• Weakly unambiguous morphisms
• Developments in Language Theory
• Unambiguous Erasing Morphisms in Free Monoids
• Eraser morphisms and membership problem in groups and monoids
• Ambiguity of morphisms in a free group

This page was built for publication: Unambiguous erasing morphisms in free monoids

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