Distances between languages and reflexivity of relations
From MaRDI portal
Publication:1608895
DOI10.1016/S0304-3975(01)00238-9zbMath1016.68045WikidataQ61677529 ScholiaQ61677529MaRDI QIDQ1608895
Giovanni Pighizzini, Christian Choffrut
Publication date: 13 August 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Quasi-Distances and Weighted Finite Automata, THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE, Bounded repairability of word languages, Decidability of involution hypercodes, Duplications and Pseudo-Duplications, State Complexity of Prefix Distance, String distances and intrusion detection: Bridging the gap between formal languages and computer security
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synchronized rational relations of finite and infinite words
- Improved limitedness theorems on finite automata with distance functions
- Limitedness theorem on finite automata with distance functions
- Rational equivalence relations
- Semigroups, Presburger formulas, and languages
- On Relations Defined by Generalized Finite Automata