Pages that link to "Item:Q1608895"

The following pages link to Distances between languages and reflexivity of relations (Q1608895):

Displaying 22 items.

• Approximate matching between a context-free grammar and a finite-state automaton (Q259082) (← links)
• Bounded repairability of word languages (Q394744) (← links)
• Decidability of involution hypercodes (Q401315) (← links)
• Consensus string problem for multiple regular languages (Q2042725) (← links)
• A similarity measure for formal languages based on convergent geometric series (Q2164738) (← links)
• State complexity of prefix distance (Q2357110) (← links)
• State Complexity of Prefix Distance of Subregular Languages (Q2829982) (← links)
• Prefix Distance Between Regular Languages (Q2830223) (← links)
• Duplications and Pseudo-Duplications (Q2945563) (← links)
• State Complexity of Prefix Distance (Q2947426) (← links)
• Edit-Distance Between Visibly Pushdown Languages (Q2971150) (← links)
• String distances and intrusion detection: Bridging the gap between formal languages and computer security (Q3431441) (← links)
• Descriptional Complexity of Error Detection (Q4686648) (← links)
• State Complexity of Suffix Distance (Q5205049) (← links)
• THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE (Q5495420) (← links)
• Quasi-Distances and Weighted Finite Automata (Q5500694) (← links)
• Consensus String Problem for Multiple Regular Languages (Q5738997) (← links)
• Closest substring problems for regular languages (Q5918147) (← links)
• Edit distance neighbourhoods of input-driven pushdown automata (Q5920214) (← links)
• Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708) (← links)
• Weights of formal languages based on geometric series with an application to automatic grading (Q6144019) (← links)
• Topologies for error-detecting variable-length codes (Q6186320) (← links)