State complexity of suffix distance
From MaRDI portal
Publication:5205049
DOI10.1142/S0129054119400355zbMATH Open1427.68151OpenAlexW4252967799MaRDI QIDQ5205049FDOQ5205049
Authors: Timothy Ng, David Rappaport, Kai Salomaa 
Publication date: 10 December 2019
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054119400355
Recommendations
Cites Work
- Title not available (Why is that?)
- Distances between languages and reflexivity of relations
- Computing the edit distance of a regular language
- Title not available (Why is that?)
- The edit-distance between a regular language and a context-free language
- Title not available (Why is that?)
- Encyclopedia of Distances
- A Second Course in Formal Languages and Automata Theory
- Descriptional and computational complexity of finite automata -- a survey
- A survey on operational state complexity
- Recent trends in descriptional complexity of formal languages
- Additive distances and quasi-distances between words
- Efficient algorithms for computing the inner edit distance of a regular language via transducers
- State complexity of prefix distance
- Parameterized Prefix Distance between Regular Languages
- String distances and intrusion detection: Bridging the gap between formal languages and computer security
- State complexity of prefix distance of subregular languages
- State complexity of neighbourhoods and approximate pattern matching
- Descriptional complexity of error detection
Cited In (12)
- Descriptional complexity of error detection
- State complexity of prefix distance of subregular languages
- State complexity of additive weighted finite automata
- State complexity of prefix distance of subregular languages
- State complexity of neighbourhoods and approximate pattern matching
- State complexity of prefix distance
- State complexity of prefix distance
- Regularity of a dynamic neighborhood of a regular language
- State complexity of suffix distance
- State complexity of neighbourhoods and approximate pattern matching
- Quasi-distances and weighted finite automata
- Quasi-distances and weighted finite automata
This page was built for publication: State complexity of suffix distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205049)
