State complexity of prefix distance of subregular languages
From MaRDI portal
Publication:2829982
DOI10.1007/978-3-319-41114-9_15zbMATH Open1476.68136OpenAlexW2482750740MaRDI QIDQ2829982FDOQ2829982
Authors: Timothy Ng, David Rappaport, Kai Salomaa 
Publication date: 9 November 2016
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01633944/file/416473_1_En_15_Chapter.pdf
Recommendations
Cites Work
- Distances between languages and reflexivity of relations
- 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
- Determination of finite automata accepting subregular languages
- The magic number problem for subregular language families
- Nondeterministic state complexity of star-free languages
- On NFAs where all states are final, initial, or both
- Additive distances and quasi-distances between words
- State complexity of prefix distance
Cited In (8)
- Descriptional complexity of error detection
- State complexity of prefix distance of subregular languages
- Parameterized Prefix Distance between Regular Languages
- State complexity of suffix distance
- State complexity of neighbourhoods and approximate pattern matching
- State complexity of prefix distance
- State complexity of prefix distance
- State complexity of suffix distance
This page was built for publication: State complexity of prefix distance of subregular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829982)
