Why we need semirings in automata theory (extended abstract)

DOI10.1007/978-3-319-23021-4_4zbMATH Open1402.68125OpenAlexW2295592124MaRDI QIDQ2947145FDOQ2947145

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the entropy of context-free languages
• The equivalence problem of multitape finite automata
• Title not available (Why is that?)
• The characterization of nonexpansive grammars by rational power series
• Rational and Recognisable Power Series
• Forty years of formal power series in automata theory
• On power series over a graded monoid

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)