Parameterized Prefix Distance between Regular Languages

DOI10.1007/978-3-319-04298-5_37MaRDI QIDQ2938119zbMATH OpenOpenAlexFDO

Authors Martin Kutrib, Katja Meckel, Matthias Wendlandt

Publication date 13 January 2015

Published in SOFSEM 2014: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04298-5_37

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Prefix distance between regular languages
• Alignment distance of regular tree languages
• Alignment distance of regular tree languages
• Computation of distances for regular and context-free probabilistic languages
• State complexity of prefix distance of subregular languages
• State complexity of prefix distance of subregular languages
• Regular language distance and entropy
• Computing the edit-distance between a regular language and a context-free language
• The edit-distance between a regular language and a context-free language
• Complexity of proper prefix-convex regular languages

Cited in

(13)

• Structural properties of NFAs and growth rates of nondeterminism measures
• State complexity of prefix distance
• Relative prefix distance between languages
• Prefix distance between regular languages
• State complexity of prefix distance
• Distances of formal languages
• A Similarity Measure for Cyclic Unary Regular Languages
• Descriptional complexity of error detection
• Regular language distance and entropy
• State complexity of suffix distance
• Definitions and properties of entropy and distance for regular languages
• Additive distances and quasi-distances between words
• Finite Approximations and Similarity of Languages

This page was built for publication: Parameterized Prefix Distance between Regular Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938119)