On the asymptotic enumeration of accessible automata.
Saved in:
| Title: | On the asymptotic enumeration of accessible automata. |
|---|---|
| Authors: | Lebensztayn, Elcio1 |
| Source: | Discrete Mathematics & Theoretical Computer Science (DMTCS). Jun2010, Vol. 12 Issue 3, p75-79. 5p. 1 Diagram, 1 Chart. |
| Subjects: | Sequential machine theory, Machine theory, Binomial theorem, Lagrange problem, Calculus of variations |
| Abstract: | We simplify the known formula for the asymptotic estimate of the number of deterministic and accessible automata with n states over a k-letter alphabet. The proof relies on the theory of Lagrange inversion applied in the context of generalized binomial series. [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: 60989005 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: On the asymptotic enumeration of accessible automata. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Lebensztayn%2C+Elcio%22">Lebensztayn, Elcio</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>. Jun2010, Vol. 12 Issue 3, p75-79. 5p. 1 Diagram, 1 Chart. – 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="%22Binomial+theorem%22">Binomial theorem</searchLink><br /><searchLink fieldCode="DE" term="%22Lagrange+problem%22">Lagrange problem</searchLink><br /><searchLink fieldCode="DE" term="%22Calculus+of+variations%22">Calculus of variations</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: We simplify the known formula for the asymptotic estimate of the number of deterministic and accessible automata with n states over a k-letter alphabet. The proof relies on the theory of Lagrange inversion applied in the context of generalized binomial series. [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=60989005 |
| RecordInfo | BibRecord: BibEntity: Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 5 StartPage: 75 Subjects: – SubjectFull: Sequential machine theory Type: general – SubjectFull: Machine theory Type: general – SubjectFull: Binomial theorem Type: general – SubjectFull: Lagrange problem Type: general – SubjectFull: Calculus of variations Type: general Titles: – TitleFull: On the asymptotic enumeration of accessible automata. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Lebensztayn, Elcio IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 06 Text: Jun2010 Type: published Y: 2010 Identifiers: – Type: issn-print Value: 13658050 Numbering: – Type: volume Value: 12 – Type: issue Value: 3 Titles: – TitleFull: Discrete Mathematics & Theoretical Computer Science (DMTCS) Type: main |
| ResultId | 1 |
