Pages that link to "Item:Q5696947"

The following pages link to EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS (Q5696947):

Displaying 31 items.

• Approximate matching between a context-free grammar and a finite-state automaton (Q259082) (← links)
• Bounded repairability of word languages (Q394744) (← links)
• A coalgebraic perspective on linear weighted automata (Q418134) (← links)
• Deciding word neighborhood with universal neighborhood automata (Q533878) (← links)
• A sum-over-paths extension of edit distances accounting for all sequence alignments (Q632613) (← links)
• Quantitative monitoring of STL with edit distance (Q1667648) (← links)
• Efficient algorithms for computing the inner edit distance of a regular language via transducers (Q1712004) (← links)
• Weighted automata computation of edit distances with consolidations and fragmentations (Q2064523) (← links)
• Symbolic weighted language models, quantitative parsing and automated music transcription (Q2164736) (← links)
• Computing the edit distance of a regular language (Q2381500) (← links)
• Learning stochastic edit distance: application in handwritten character recognition (Q2498646) (← links)
• Computing the Expected Edit Distance from a String to a PFA (Q2830206) (← links)
• Prefix Distance Between Regular Languages (Q2830223) (← links)
• Edit-Distance Between Visibly Pushdown Languages (Q2971150) (← links)
• Edit distance for timed automata (Q2986983) (← links)
• The Cost of Traveling between Languages (Q3012923) (← links)
• GENERAL ALGORITHMS FOR TESTING THE AMBIGUITY OF FINITE AUTOMATA AND THE DOUBLE-TAPE AMBIGUITY OF FINITE-STATE TRANSDUCERS (Q3016223) (← links)
• <font>N</font>-WAY COMPOSITION OF WEIGHTED FINITE-STATE TRANSDUCERS (Q3395133) (← links)
• Edit Distance for Pushdown Automata (Q3449470) (← links)
• 3-Way Composition of Weighted Finite-State Transducers (Q3602821) (← links)
• Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton (Q4605516) (← links)
• Descriptional Complexity of Error Detection (Q4686648) (← links)
• Computing the Shortest String and the Edit-Distance for Parsing Expression Languages (Q5041248) (← links)
• On the definition of stochastic λ-transducers (Q5323205) (← links)
• THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE (Q5495420) (← links)
• On implementing recognizable transductions (Q5852138) (← links)
• Input-driven pushdown automata for edit distance neighborhood (Q5918675) (← links)
• Edit distance neighbourhoods of input-driven pushdown automata (Q5920061) (← links)
• Edit distance neighbourhoods of input-driven pushdown automata (Q5920214) (← links)
• Testing membership for timed automata (Q6090987) (← links)
• Robust satisfaction of metric interval temporal logic objectives in adversarial environments (Q6555607) (← links)