Why we need semirings in automata theory (extended abstract)

DOI10.1007/978-3-319-23021-4_4MaRDI QIDQ2947145zbMATH OpenOpenAlexFDO

Authors W. Kuich

Publication date 22 September 2015

Published in Algebraic Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-23021-4_4

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semirings (16Y60)

Recommendations

• scientific article; zbMATH DE number 19616
• Semitopological semirings and pushdown automata
• Forty years of formal power series in automata theory
• Mathematical Foundations of Computer Science 2004
• scientific article; zbMATH DE number 3932372

Cites work

• scientific article; zbMATH DE number 3911733 (Why is no real title available?)
• scientific article; zbMATH DE number 3932372 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• Forty years of formal power series in automata theory
• On power series over a graded monoid
• On the entropy of context-free languages
• Rational and Recognisable Power Series
• The characterization of nonexpansive grammars by rational power series
• The equivalence problem of multitape finite automata

Cited in

(3)

• scientific article; zbMATH DE number 19616 (Why is no real title available?)
• scientific article; zbMATH DE number 4057811 (Why is no real title available?)
• Semitopological semirings and pushdown automata

This page was built for publication: Why we need semirings in automata theory (extended abstract)

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