Unambiguous Erasing Morphisms in Free Monoids

DOI10.1007/978-3-540-95891-8_43MaRDI QIDQ3599095zbMATH OpenOpenAlexFDO

Authors Johannes Schneider

Publication date 3 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2010__44_2_193_0/

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Algebraic theory of languages and automata (68Q70)

Recommendations

• Unambiguous erasing morphisms in free monoids
• Restricted ambiguity of erasing morphisms
• Restricted ambiguity of erasing morphisms
• Developments in Language Theory
• UNAMBIGUOUS MORPHIC IMAGES OF STRINGS

Cites work

• 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^†
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Morphically primitive words
• The Unambiguity of Segmented Morphisms
• UNAMBIGUOUS MORPHIC IMAGES OF STRINGS

Cited in

(7)

• Ambiguity of morphisms in a free group
• Unambiguous erasing morphisms in free monoids
• Restricted ambiguity of erasing morphisms
• Weakly unambiguous morphisms
• Developments in Language Theory
• UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
• Restricted ambiguity of erasing morphisms

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 Q3599095)