View in EDS PDF Full Text

The Černý Conjecture for Aperiodic Automata.

Saved in:
Bibliographic Details
Title: The Černý Conjecture for Aperiodic Automata.
Authors: Trahtman, A. N.1
Source: Discrete Mathematics & Theoretical Computer Science (DMTCS). Dec2007, Vol. 9 Issue 2, p3-10. 8p.
Subjects: Sequential machine theory, Machine theory, Algorithms, Formal languages, Language & languages
Abstract: A word w is called a synchronizing (recurrent, reset, directable) word of a deterministic finite automaton (DFA) if w brings all states of the automaton to some specific state; a DFA that has a synchronizing word is said to be synchronizable. Černý conjectured in 1964 that every n-state synchronizable DFA possesses a synchronizing word of length at most (n-1)². We consider automata with aperiodic transition monoid (such automata are called aperiodic). We show that every synchronizable n-state aperiodic DFA has a synchronizing word of length at most n(n - 1)/2. Thus, for aperiodic automata as well as for automata accepting only star-free languages, the ČCerný conjecture holds true. [ABSTRACT FROM AUTHOR]
Copyright of Discrete Mathematics & Theoretical Computer Science (DMTCS) is the property of Discrete Mathematics & Theoretical Computer Science DMTCS and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 25515261
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: The Černý Conjecture for Aperiodic Automata.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Trahtman%2C+A%2E+N%2E%22">Trahtman, A. N.</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Discrete+Mathematics+%26+Theoretical+Computer+Science+%28DMTCS%29%22">Discrete Mathematics & Theoretical Computer Science (DMTCS)</searchLink>. Dec2007, Vol. 9 Issue 2, p3-10. 8p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Sequential+machine+theory%22">Sequential machine theory</searchLink><br /><searchLink fieldCode="DE" term="%22Machine+theory%22">Machine theory</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Formal+languages%22">Formal languages</searchLink><br /><searchLink fieldCode="DE" term="%22Language+%26+languages%22">Language & languages</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: A word w is called a synchronizing (recurrent, reset, directable) word of a deterministic finite automaton (DFA) if w brings all states of the automaton to some specific state; a DFA that has a synchronizing word is said to be synchronizable. Černý conjectured in 1964 that every n-state synchronizable DFA possesses a synchronizing word of length at most (n-1)². We consider automata with aperiodic transition monoid (such automata are called aperiodic). We show that every synchronizable n-state aperiodic DFA has a synchronizing word of length at most n(n - 1)/2. Thus, for aperiodic automata as well as for automata accepting only star-free languages, the ČCerný conjecture holds true. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Discrete Mathematics & Theoretical Computer Science (DMTCS) is the property of Discrete Mathematics & Theoretical Computer Science DMTCS and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=25515261
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 8
        StartPage: 3
    Subjects:
      – SubjectFull: Sequential machine theory
        Type: general
      – SubjectFull: Machine theory
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Formal languages
        Type: general
      – SubjectFull: Language & languages
        Type: general
    Titles:
      – TitleFull: The Černý Conjecture for Aperiodic Automata.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Trahtman, A. N.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 12
              Text: Dec2007
              Type: published
              Y: 2007
          Identifiers:
            – Type: issn-print
              Value: 13658050
          Numbering:
            – Type: volume
              Value: 9
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Discrete Mathematics & Theoretical Computer Science (DMTCS)
              Type: main
ResultId 1