A Similarity Measure for Cyclic Unary Regular Languages
From MaRDI portal
Publication:3400529
DOI10.3233/FI-2009-168zbMATH Open1200.68137OpenAlexW1611590294MaRDI QIDQ3400529FDOQ3400529
Gema M. Martín, Francisco J. Vico, Jürgen Dassow
Publication date: 5 February 2010
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2009-168
Recommendations
- scientific article; zbMATH DE number 3843141
- MEASURE OF REGULAR LANGUAGES
- A similarity measure for formal languages based on convergent geometric series
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Renormalized measure of regular languages
- Publication:3034842
- Finite Approximations and Similarity of Languages
- Parameterized Prefix Distance between Regular Languages
- LATIN 2004: Theoretical Informatics
- Testing the equivalence of regular languages
Cited In (2)
This page was built for publication: A Similarity Measure for Cyclic Unary Regular Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400529)