scientific article; zbMATH DE number 1390068

zbMATH Open0945.68110MaRDI QIDQ4934333

Manfred Droste, Dietrich Kuske

Publication date: 17 January 2000

Title of this publication is not available (Why is that?)

zbMATH Keywords

recognizable languages in free monoids

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (3)

Recognizable languages in divisibility monoids ⋮ Languages recognized by programs over the two-element monoid ⋮ Counting monoids and rational languages

Recommendations

• Language-theoretic problems in certain matrix monoids 👍 👎
• Recognizable languages in concurrency monoids 👍 👎
• Counting monoids and rational languages 👍 👎
• Languages and monoids with disjunctive identity 👍 👎
• Finite transducers for divisibility monoids 👍 👎
• Recognizable languages in divisibility monoids 👍 👎
• A kleene theorem for recognizable languages over concurrency monoids 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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