The DFAs of Finitely Different Languages

Simple item page
dc.creatorBadr, Andrew
dc.creatorShipman, Ian
dc.date2007-02-09
dc.date.accessioned2026-07-07T07:45:57Z
dc.date.available2026-07-07T07:45:57Z
dc.descriptionTwo languages are "finitely different" if their symmetric difference is finite. We consider the DFAs of finitely different regular languages and find major structural similarities. We proceed to consider the smallest DFAs that recognize a language finitely different from some given DFA. Such "f-minimal" DFAs are not unique, and this non-uniqueness is characterized. Finally, we offer a solution to the minimization problem of finding such f-minimal DFAs.
dc.identifierhttps://arxiv.org/abs/cs/0702053
dc.identifierhttp://arxiv.org/abs/cs/0702053
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123673
dc.subjectComputational Complexity
dc.subjectF.1.1; F.4.3
dc.titleThe DFAs of Finitely Different Languages
dc.typetext

Files

Collections

arXiv