Vote for your favorite mineral in #MinCup25! - Sanidine vs. Hematite
It's a pair of often-overlooked classics as potassium feldspar sanidine competes with iron ore hematite.
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

Macarie, Ioan I. (1998) Space-Efficient Deterministic Simulation of Probabilistic Automata. SIAM Journal on Computing, 27 (2). 448-465 doi:10.1137/s0097539793253851

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleSpace-Efficient Deterministic Simulation of Probabilistic Automata
JournalSIAM Journal on Computing
AuthorsMacarie, Ioan I.Author
Year1998 (April)Volume27
Issue2
PublisherSociety for Industrial & Applied Mathematics (SIAM)
DOIdoi:10.1137/s0097539793253851Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11240176Long-form Identifiermindat:1:5:11240176:8
GUID0
Full ReferenceMacarie, Ioan I. (1998) Space-Efficient Deterministic Simulation of Probabilistic Automata. SIAM Journal on Computing, 27 (2). 448-465 doi:10.1137/s0097539793253851
Plain TextMacarie, Ioan I. (1998) Space-Efficient Deterministic Simulation of Probabilistic Automata. SIAM Journal on Computing, 27 (2). 448-465 doi:10.1137/s0097539793253851
In(1998, April) SIAM Journal on Computing Vol. 27 (2) Society for Industrial & Applied Mathematics (SIAM)

See Also

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

Macarie, Ioan I. (2000) On the Structure of Logspace Probabilistic Complexity Classes. SIAM Journal on Computing, 29 (3). 987-1007 doi:10.1137/s0097539796298339
Edmonds, Jeff A. (1998) Time--Space Tradeoffs For Undirected st-Connectivity on a Graph Automata. SIAM Journal on Computing, 27 (5). 1492-1513 doi:10.1137/s0097539794277135
Macarie, Ioan I., Ogihara, Mitsunori (1998) Properties of probabilistic pushdown automata. Theoretical Computer Science, 207 (1). 117-130 doi:10.1016/s0304-3975(98)00059-0
Condon, Anne, Hellerstein, Lisa, Pottle, Samuel, Wigderson, Avi (1998) On the Power of Finite Automata with both Nondeterministic and Probabilistic States. SIAM Journal on Computing, 27 (3). 739-762 doi:10.1137/s0097539794265578
Leung, Hing (1998) Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata. SIAM Journal on Computing, 27 (4). 1073-1082 doi:10.1137/s0097539793252092
Barnes, Greg, Edmonds, Jeff A. (1998) Time--Space Lower Bounds for Directed st-Connectivity on Graph Automata Models. SIAM Journal on Computing, 27 (4). 1190-1202 doi:10.1137/s0097539795294402
Blumofe, Robert D., Leiserson, Charles E. (1998) Space-Efficient Scheduling of Multithreaded Computations. SIAM Journal on Computing, 27 (1). 202-229 doi:10.1137/s0097539793259471
Goldwasser, Shafi (1998) Introduction to Special Section on Probabilistic Proof Systems. SIAM Journal on Computing, 27 (3). 737-738 doi:10.1137/smjcat000027000003000737000001
Tzeng, Wen-Guey (1992) A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata. SIAM Journal on Computing, 21 (2). 216-227 doi:10.1137/0221017
Fischer, Johannes, Heun, Volker (2011) Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays. SIAM Journal on Computing, 40 (2). 465-492 doi:10.1137/090779759
Rosenkrantz, Daniel J., Hunt III, Harry B. (1978) Polynomial Algorithms for Deterministic Pushdown Automata. SIAM Journal on Computing, 7 (4). 405-412 doi:10.1137/0207032
 
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 7, 2025 12:13:13
Go to top of page