scientific article; zbMATH DE number 4178794

zbMATH Open0715.68060MaRDI QIDQ3201767FDOQ3201767

Authors: Udo Hebisch 

Publication date: 1990

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

Recommendations

• Publication:3027187
• On embedding in complete semirings
• Automata and languages generalized to \(\omega\)-continuous semirings
• Monoides et semi-anneaux complets. (Complete monoids and semirings)
• scientific article; zbMATH DE number 177807

zbMATH Keywords

finite automatonKleene theoremrational setcountably complete semirings

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semirings (16Y60)

Cited In (11)

• Inductive \(^{*}\)-semirings
• Crossability of cancellative Kleene semigroups
• A unifying Kleene theorem for weighted finite automata
• The equational logic of fixed points
• An Ambrose-Kakutani representation theorem for countable-to-1 semiflows
• Monoides et semi-anneaux continus. (Continuous monoids and semirings)
• Iteration Semirings
• Equational theories for automata
• Automata and languages generalized to \(\omega\)-continuous semirings
• Title not available (Why is that?)
• Krivine's intuitionistic proof of classical completeness (for countable languages)

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