Weighted Finite Automata: Computing with Different Topologies

DOI10.1007/978-3-642-21341-0_6zbMath1330.68162OpenAlexW51899782MaRDI QIDQ3007699

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)

Related Items (2)

Function transformations with automata ⋮ On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages

This page was built for publication: Weighted Finite Automata: Computing with Different Topologies