| dc.contributor.author | Demaine, Erik D. | |
| dc.contributor.author | Eisenstat, Sarah Charmian | |
| dc.contributor.author | Shallit, Jeffrey | |
| dc.contributor.author | Wilson, David A. | |
| dc.date.accessioned | 2012-09-27T21:33:19Z | |
| dc.date.available | 2012-09-27T21:33:19Z | |
| dc.date.issued | 2011-07 | |
| dc.identifier.isbn | 978-3-642-22599-4 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/73455 | |
| dc.description | Proceedings of the 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. | en_US |
| dc.description.abstract | The separating words problem asks for the size of the smallest DFA needed to distinguish between two words of length ≤ n (by accepting one and rejecting the other). In this paper we survey what is known and unknown about the problem, consider some variations, and prove several new results. | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Springer Berlin/Heidelberg | en_US |
| dc.relation.isversionof | http://dx.doi.org/ 10.1007/978-3-642-22600-7_12 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike 3.0 | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
| dc.source | MIT web domain | en_US |
| dc.title | Remarks on separating words | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Demaine, Erik D. et al. “Remarks on Separating Words.” Descriptional Complexity of Formal Systems. Ed. Markus Holzer, Martin Kutrib, & Giovanni Pighizzini. LNCS Vol. 6808. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. 147-157. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.mitauthor | Demaine, Erik D. | |
| dc.contributor.mitauthor | Eisenstat, Sarah Charmian | |
| dc.contributor.mitauthor | Wilson, David A. | |
| dc.relation.journal | Descriptional Complexity of Formal Systems | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| dspace.orderedauthors | Demaine, Erik D.; Eisenstat, Sarah; Shallit, Jeffrey; Wilson, David A. | en |
| dc.identifier.orcid | https://orcid.org/0000-0003-3803-5703 | |
| dc.identifier.orcid | https://orcid.org/0000-0002-3182-1675 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |
