Parameterized Prefix Distance between Regular Languages

DOI10.1007/978-3-319-04298-5_37zbMath1432.68232OpenAlexW2280220592MaRDI QIDQ2938119

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)

Related Items (7)

State Complexity of Prefix Distance ⋮ Finite Approximations and Similarity of Languages ⋮ Descriptional Complexity of Error Detection ⋮ State Complexity of Suffix Distance ⋮ Prefix Distance Between Regular Languages ⋮ Structural properties of NFAs and growth rates of nondeterminism measures ⋮ State complexity of prefix distance

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