Distances between languages and reflexivity of relations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3976343 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- Improved limitedness theorems on finite automata with distance functions
- Limitedness theorem on finite automata with distance functions
- On Relations Defined by Generalized Finite Automata
- Rational equivalence relations
- Semigroups, Presburger formulas, and languages
- Synchronized rational relations of finite and infinite words
Cited in
(30)- Consensus string problem for multiple regular languages
- A similarity measure for formal languages based on convergent geometric series
- State complexity of prefix distance
- Relative prefix distance between languages
- Approximate matching between a context-free grammar and a finite-state automaton
- State complexity of prefix distance of subregular languages
- Prefix distance between regular languages
- Duplications and pseudo-duplications
- State complexity of prefix distance
- Edit-distance between visibly pushdown languages
- Distances of formal languages
- The cardinality of a sphere relative to an edit distance
- String distances and intrusion detection: Bridging the gap between formal languages and computer security
- Bounded repairability of word languages
- Decidability of involution hypercodes
- Descriptional complexity of error detection
- scientific article; zbMATH DE number 1361478 (Why is no real title available?)
- Unended Reflections on Family Resemblance and Predicates Linguistic Migration
- State complexity of suffix distance
- The edit-distance between a regular language and a context-free language
- Quasi-distances and weighted finite automata
- Consensus string problem for multiple regular languages
- Closest substring problems for regular languages
- Edit distance neighbourhoods of input-driven pushdown automata
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
- When variable-length codes meet the field of error detection
- Weights of formal languages based on geometric series with an application to automatic grading
- Finite Approximations and Similarity of Languages
- Topologies for error-detecting variable-length codes
- Edit distance of finite state transducers
This page was built for publication: Distances between languages and reflexivity of relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1608895)
