New finite automata corresponding to semiextended regular expressions.
Saved in:
| Title: | New finite automata corresponding to semiextended regular expressions. |
|---|---|
| Authors: | Yamamoto, Hiroaki1 |
| Source: | Systems & Computers in Japan. 9/1/2005, Vol. 36 Issue 10, p54-61. 8p. |
| Subjects: | Sequential machine theory, Automation, Machine theory, Computers, Synchronization, Time measurements |
| Abstract: | A semiextended regular expression is a regular expression having an intersection operation. It is known that a regular expression of length m can be transformed into a nondeterministic finite automaton of at most 2m states; however, if the semiextended regular expression is to be transformed into an NFA, the number of states will increase exponentially because of the intersection operation. In this paper, we propose a new model called a partially input-synchronized alternating finite automaton and show that a semiextended regular expression can be transformed into a partially input-synchronized alternating finite automaton of at most 2m states. Yamamoto applied this result to the membership problem of semiextended regular expressions. © 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(10): 54–61, 2005; Published online in Wiley InterScience ( |
| Copyright of Systems & Computers in Japan is the property of Wiley-Blackwell 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: 17626946 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: New finite automata corresponding to semiextended regular expressions. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Yamamoto%2C+Hiroaki%22">Yamamoto, Hiroaki</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Systems+%26+Computers+in+Japan%22">Systems & Computers in Japan</searchLink>. 9/1/2005, Vol. 36 Issue 10, p54-61. 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="%22Automation%22">Automation</searchLink><br /><searchLink fieldCode="DE" term="%22Machine+theory%22">Machine theory</searchLink><br /><searchLink fieldCode="DE" term="%22Computers%22">Computers</searchLink><br /><searchLink fieldCode="DE" term="%22Synchronization%22">Synchronization</searchLink><br /><searchLink fieldCode="DE" term="%22Time+measurements%22">Time measurements</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: A semiextended regular expression is a regular expression having an intersection operation. It is known that a regular expression of length m can be transformed into a nondeterministic finite automaton of at most 2m states; however, if the semiextended regular expression is to be transformed into an NFA, the number of states will increase exponentially because of the intersection operation. In this paper, we propose a new model called a partially input-synchronized alternating finite automaton and show that a semiextended regular expression can be transformed into a partially input-synchronized alternating finite automaton of at most 2m states. Yamamoto applied this result to the membership problem of semiextended regular expressions. © 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(10): 54–61, 2005; Published online in Wiley InterScience (<URL>www.interscience.wiley.com</URL>). DOI 10.1002/scj.10623 [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Systems & Computers in Japan is the property of Wiley-Blackwell 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=17626946 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1002/scj.10623 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 8 StartPage: 54 Subjects: – SubjectFull: Sequential machine theory Type: general – SubjectFull: Automation Type: general – SubjectFull: Machine theory Type: general – SubjectFull: Computers Type: general – SubjectFull: Synchronization Type: general – SubjectFull: Time measurements Type: general Titles: – TitleFull: New finite automata corresponding to semiextended regular expressions. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Yamamoto, Hiroaki IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 09 Text: 9/1/2005 Type: published Y: 2005 Identifiers: – Type: issn-print Value: 08821666 Numbering: – Type: volume Value: 36 – Type: issue Value: 10 Titles: – TitleFull: Systems & Computers in Japan Type: main |
| ResultId | 1 |
