1 Ocak 2017 Konferans bildirisi Açık Erişim

Altun, Omer Faruk; Atam, Kamil Tolga; Karahoda, Sertac; Kaya, Kamer

DataCite XML

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/45045</identifier>
  <creators>
    <creator>
      <creatorName>Altun, Omer Faruk</creatorName>
      <givenName>Omer Faruk</givenName>
      <familyName>Altun</familyName>
      <affiliation>Sabanci Univ, Fac Engn &amp; Nat Sci, Comp Sci &amp; Engn, Istanbul, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Atam, Kamil Tolga</creatorName>
      <givenName>Kamil Tolga</givenName>
      <familyName>Atam</familyName>
      <affiliation>Sabanci Univ, Fac Engn &amp; Nat Sci, Comp Sci &amp; Engn, Istanbul, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Karahoda, Sertac</creatorName>
      <givenName>Sertac</givenName>
      <familyName>Karahoda</familyName>
      <affiliation>Sabanci Univ, Fac Engn &amp; Nat Sci, Comp Sci &amp; Engn, Istanbul, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Kaya, Kamer</creatorName>
      <givenName>Kamer</givenName>
      <familyName>Kaya</familyName>
    </creator>
  </creators>
  <titles>
    <title>Synchronizing Heuristics: Speeding Up The Slowest</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2017</publicationYear>
  <dates>
    <date dateType="Issued">2017-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Conference paper</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/45045</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1007/978-3-319-67549-7_15</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">Computing a shortest synchronizing word of an automaton is an NP-hard problem. Therefore, heuristics are used to compute short synchronizing words. SYNCHROP is among the best heuristics in the literature in terms of word lengths. The heuristic and its variants such as SYNCHROPL have been frequently used as a baseline to judge the quality of the words generated by the new heuristics. Although, its quality is good, the heuristics are significantly slow especially compared to much cheaper heuristics such as Greedy and Cycle. This makes them infeasible for large-scale automatons. In this paper, we show how one can improve the time performance of SYNCHROP and its variants by avoiding unnecessary computations which makes these heuristics more competitive than they already are. Our experimental results show that for 2500 states, SYNCHROP can be made 70-160x faster, via the proposed optimizations. In particular, for 2500 states and 32 letters, the SYNCHROP execution reduces to 66 s from 4745 s. Furthermore, the suggested optimizations become more effective as the number of states in the automata increase.</description>
  </descriptions>
</resource>