STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA
From MaRDI portal
Publication:3401489
DOI10.1142/S0129054107005443zbMath1183.68354MaRDI QIDQ3401489
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
68Q45: Formal languages and automata
Related Items
State Complexity of Neighbourhoods and Approximate Pattern Matching, Descriptional Complexity of Error Detection, Quasi-Distances and Weighted Finite Automata, Input-driven pushdown automata for edit distance neighborhood, Edit distance neighbourhoods of input-driven pushdown automata, Edit distance neighbourhoods of input-driven pushdown automata, 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 Prefix Distance, State Complexity of Neighbourhoods and Approximate Pattern Matching
Cites Work