State complexity of prefix distance
From MaRDI portal
Recommendations
Cites work
- A Second Course in Formal Languages and Automata Theory
- Additive distances and quasi-distances between words
- Computing the edit distance of a regular language
- Descriptional and computational complexity of finite automata -- a survey
- Distances between languages and reflexivity of relations
- Encyclopedia of Distances
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 2201366 (Why is no real title available?)
- Intersection and union of regular languages and state complexity
- Maximal Words in Sequence Comparisons Based on Subword Composition
- Parameterized Prefix Distance between Regular Languages
- Quasi-distances and weighted finite automata
- Recent trends in descriptional complexity of formal languages
- State complexity of additive weighted finite automata
- State complexity of neighbourhoods and approximate pattern matching
Cited in
(9)- Consensus string problem for multiple regular languages
- State complexity of suffix distance
- Relative prefix distance between languages
- State complexity of prefix distance of subregular languages
- Prefix distance between regular languages
- State complexity of prefix distance
- State complexity of prefix distance of subregular languages
- On the state complexity of scattered substrings and superstrings
- State complexity of suffix distance
This page was built for publication: State complexity of prefix distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2357110)
