Vote for your favorite mineral in #MinCup25! - Paddlewheelite vs. Mannardite
It's a battle of the tiny as bright green #paddlewheelite goes up against jet black #mannardite. Both are small yet mighty minerals, but only one can win!
Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Moriya, Tetsuo, Yamasaki, Hideki (1988) Accepting conditions for automata on ω-languages. Theoretical Computer Science, 61 (2). 137-147 doi:10.1016/0304-3975(88)90121-1

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleAccepting conditions for automata on ω-languages
JournalTheoretical Computer Science
AuthorsMoriya, TetsuoAuthor
Yamasaki, HidekiAuthor
Year1988 (November)Volume61
Issue2
PublisherElsevier BV
DOIdoi:10.1016/0304-3975(88)90121-1Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID6536634Long-form Identifiermindat:1:5:6536634:3
GUID0
Full ReferenceMoriya, Tetsuo, Yamasaki, Hideki (1988) Accepting conditions for automata on ω-languages. Theoretical Computer Science, 61 (2). 137-147 doi:10.1016/0304-3975(88)90121-1
Plain TextMoriya, Tetsuo, Yamasaki, Hideki (1988) Accepting conditions for automata on ω-languages. Theoretical Computer Science, 61 (2). 137-147 doi:10.1016/0304-3975(88)90121-1
In(1988) Theoretical Computer Science Vol. 61. Elsevier BV

See Also

These are possibly similar items as determined by title/reference text matching only.

Takahashi, Masako, Yamasaki, Hideki (1983) A note on ω-regular languages. Theoretical Computer Science, 23 (2). 217-225 doi:10.1016/0304-3975(83)90057-9
Yamasaki, Hideki (1989) Language-theoretical representations of ω-languages. Theoretical Computer Science, 66 (3). 247-254 doi:10.1016/0304-3975(89)90152-7
Yamasaki, Hideki, Takahashi, Masako (1984) Generalized parenthesis languages and minimization of their parenthesis parts. Theoretical Computer Science, 31 (1). 1-11 doi:10.1016/0304-3975(84)90121-x
Kuich, Werner (1991) Automata and languages generalized to ω-continuous semirings. Theoretical Computer Science, 79 (1). 137-150 doi:10.1016/0304-3975(91)90147-t
Yamasaki, Hideki, Takahashi, Masako, Kobayashi, Kojiro (1986) Characterization of ω-regular languages by monadic second-order formulas. Theoretical Computer Science, 46. 91-99 doi:10.1016/0304-3975(86)90024-1
Kobayashi, Kojiro, Takahashi, Masako, Yamasaki, Hideki (1983) Characterization of ω-regular languages by first-order formulas. Theoretical Computer Science, 28 (3). 315-327 doi:10.1016/0304-3975(83)90027-0
Mezník, Ivan (1988) On a subclass of ∞-regular languages. Theoretical Computer Science, 61 (1). 25-32 doi:10.1016/0304-3975(88)90105-3
Moriya, Tetsuo (1987) Topological characterizations of infinite tree languages. Theoretical Computer Science, 52 (1). 165-171 doi:10.1016/0304-3975(87)90085-5
King, K.N. (1988) Alternating multihead finite automata. Theoretical Computer Science, 61 (2). 149-174 doi:10.1016/0304-3975(88)90122-3
Hashiguchi, Kosaburo (1988) Notes on congruence relations and factor pumping conditions for rational languages. Theoretical Computer Science, 57 (2). 303-316 doi:10.1016/0304-3975(88)90044-8
Kretschmer, Thomas (1988) A closure property of regular languages. Theoretical Computer Science, 61 (2). 283-287 doi:10.1016/0304-3975(88)90128-4
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: September 16, 2025 20:32:40
Go to top of page