Why We Need Semirings in Automata Theory (Extended Abstract)

DOI10.1007/978-3-319-23021-4_4zbMath1402.68125OpenAlexW2295592124MaRDI QIDQ2947145

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

Cites Work

• The equivalence problem of multitape finite automata
• On Power Series over a Graded Monoid
• The characterization of nonexpansive grammars by rational power series
• Rational and Recognisable Power Series
• On the entropy of context-free languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Why We Need Semirings in Automata Theory (Extended Abstract)