Quasi-Distances and Weighted Finite Automata

DOI10.1007/978-3-319-19225-3_18zbMath1432.68239OpenAlexW779556307MaRDI QIDQ5500694

Timothy Ng, David Rappaport, Kai Salomaa

Publication date: 7 August 2015

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19225-3_18

zbMATH Keywords

regular languagesstate complexitydistance measuresweighted finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

State Complexity of Neighbourhoods and Approximate Pattern Matching ⋮ State Complexity of Prefix Distance ⋮ State Complexity of Neighbourhoods and Approximate Pattern Matching ⋮ Consensus String Problem for Multiple Regular Languages ⋮ Descriptional Complexity of Error Detection ⋮ State complexity of prefix distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded repairability of word languages
• Descriptional and computational complexity of finite automata -- a survey
• Handbook of weighted automata
• Distances between languages and reflexivity of relations
• How hard is computing the edit distance?
• Computing the edit distance of a regular language
• STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA
• State Complexity of Neighbourhoods and Approximate Pattern Matching
• A Second Course in Formal Languages and Automata Theory
• THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE
• Encyclopedia of Distances

This page was built for publication: Quasi-Distances and Weighted Finite Automata