scientific article; zbMATH DE number 176924

MaRDI QIDQ4036758zbMATH OpenFDO

Authors Juha Honkala

Publication date 18 May 1993

zbMATH Keywords

decidabilitynumber system\(L\) ambiguity of morphisms of free monoid\(L\) codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 176764
• On (unit-)regular morphisms
• scientific article; zbMATH DE number 88788
• Publication:4890110
• scientific article; zbMATH DE number 3950689
• Regularity of residuated mappings
• scientific article; zbMATH DE number 3897332
• Regularity in residuated lattices
• Regularity and semipotency of Hom
• scientific article; zbMATH DE number 3976996

Cited in

(9)

• Noneffective regularity of equality languages and bounded delay morphisms
• It is decidable whether or not a permutation-free morphism is an l code
• Slender 0L languages
• Irreducible ambibuities in monoids of words
• On D0L systems with immigration
• Caractérisation results about $L$ codes
• Ambiguity of the multiple interpretations on regular languages
• scientific article; zbMATH DE number 176764 (Why is no real title available?)
• On generalized DT0L systems and their fixed points

This page was built for publication:

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