scientific article; zbMATH DE number 4178794

MaRDI QIDQ3201767zbMATH OpenFDO

Authors Udo Hebisch

Publication date 1990

zbMATH Keywords

finite automatonKleene theoremrational setcountably complete semirings

Mathematics Subject Classification ID

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

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

Cited in

(11)

• Crossability of cancellative Kleene semigroups
• Inductive \(^{*}\)-semirings
• 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
• scientific article; zbMATH DE number 4014944 (Why is no real title available?)
• 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)