State complexity of additive weighted finite automata

DOI10.1142/S0129054107005443MaRDI QIDQ3401489zbMATH OpenOpenAlexFDO

Authors Kai Salomaa, Paul Schofield

Publication date 29 January 2010

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054107005443

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Quasi-distances and weighted finite automata
• Quasi-distances and weighted finite automata
• State complexity of suffix distance
• State complexity of suffix distance
• State complexity of neighbourhoods and approximate pattern matching

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• Fast string correction with Levenshtein automata
• Finite Automata Computing Real Functions
• How hard is computing the edit distance?
• Order- n correction for regular languages

Cited in

(12)

• Quasi-distances and weighted finite automata
• Quasi-distances and weighted finite automata
• Descriptional complexity of error detection
• Edit distance neighbourhoods of input-driven pushdown automata
• Input-driven pushdown automata for edit distance neighborhood
• Edit distance neighbourhoods of input-driven pushdown automata
• Weak inverse neighborhoods of languages
• State complexity of neighbourhoods and approximate pattern matching
• State complexity of prefix distance
• On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
• State complexity of prefix distance
• State complexity of neighbourhoods and approximate pattern matching

This page was built for publication: State complexity of additive weighted finite automata

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