Regularity of a dynamic neighborhood of a regular language

DOI10.1134/S0081543809070189MaRDI QIDQ764745zbMATH OpenOpenAlexFDO

Authors G. A. Povarov

Publication date 14 March 2012

Published in Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0081543809070189

zbMATH Keywords

Hamming distanceregular languagefinite transducerneighborhood of a languagenondeterministic complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Descriptional complexity of error detection
• scientific article; zbMATH DE number 480523
• Language operations with regular expressions of polynomial size
• Towards a theory of complexity of regular languages
• State complexity of suffix distance

Cites work

• scientific article; zbMATH DE number 699389 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• Finding approximate patterns in strings
• Languages with mismatches

This page was built for publication: Regularity of a dynamic neighborhood of a regular language

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