Pages that link to "Item:Q3401489"
From MaRDI portal
The following pages link to STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA (Q3401489):
Displayed 10 items.
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- State complexity of prefix distance (Q2357110) (← links)
- State Complexity of Prefix Distance (Q2947426) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q3451118) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q4640043) (← links)
- Descriptional Complexity of Error Detection (Q4686648) (← links)
- Quasi-Distances and Weighted Finite Automata (Q5500694) (← 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)