View in EDS PDF Full Text

Methods of constructing universal tests for finite-state automata.

Saved in:
Bibliographic Details
Title: Methods of constructing universal tests for finite-state automata.
Authors: Tverdokhlebov, V.1
Source: Automation & Remote Control. Jan2005, Vol. 66 Issue 1, p139-147. 9p.
Subjects: Sequential machine theory, Machine theory, Proof theory, Algorithms, Mathematical models
Abstract: Proves the existence of a unique common experiment for recognition of automata in all families satisfying several conditions. Main tasks of technical diagnosis; Universal tests of automata; Reduction of the universal test length.
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 16264436
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Methods of constructing universal tests for finite-state automata.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Tverdokhlebov%2C+V%2E%22">Tverdokhlebov, V.</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Automation+%26+Remote+Control%22">Automation & Remote Control</searchLink>. Jan2005, Vol. 66 Issue 1, p139-147. 9p.
– 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="%22Proof+theory%22">Proof theory</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+models%22">Mathematical models</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Proves the existence of a unique common experiment for recognition of automata in all families satisfying several conditions. Main tasks of technical diagnosis; Universal tests of automata; Reduction of the universal test length.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=16264436
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10513-005-0014-4
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 9
        StartPage: 139
    Subjects:
      – SubjectFull: Sequential machine theory
        Type: general
      – SubjectFull: Machine theory
        Type: general
      – SubjectFull: Proof theory
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Mathematical models
        Type: general
    Titles:
      – TitleFull: Methods of constructing universal tests for finite-state automata.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Tverdokhlebov, V.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Text: Jan2005
              Type: published
              Y: 2005
          Identifiers:
            – Type: issn-print
              Value: 00051179
          Numbering:
            – Type: volume
              Value: 66
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Automation & Remote Control
              Type: main
ResultId 1