Weighted finite automata: Computing with different topologies

DOI10.1007/978-3-642-21341-0_6MaRDI QIDQ3007699zbMATH OpenOpenAlexFDO

Authors Juhani Karhumäki, T. Sallinen

Publication date 17 June 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21341-0_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• On computational power of weighted finite automata
• scientific article; zbMATH DE number 871243
• On continuous functions computed by finite automata
• Finite Automata Computing Real Functions
• scientific article; zbMATH DE number 2040326

Cited in

(5)

• On the determinization blowup for finite automata recognizing equal-length languages
• Ancient Typefaces and Parametric Weighted Finite Automata
• Function transformations with automata
• scientific article; zbMATH DE number 871243 (Why is no real title available?)
• On computational power of weighted finite automata

This page was built for publication: Weighted finite automata: Computing with different topologies

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