Uncountable Realtime Probabilistic Classes - Descriptional Complexity of Formal Systems (DCFS 2017) Access content directly
Conference Papers Year : 2017

Uncountable Realtime Probabilistic Classes

Abuzer Yakaryilmaz
  • Function : Author
  • PersonId : 1024587
Maksims Dimitrijevs
  • Function : Author
  • PersonId : 1024588

Abstract

We investigate the minimum cases for realtime probabilistic machines that can define uncountably many languages with bounded error. We show that logarithmic space is enough for realtime PTMs on unary languages. On binary case, we follow the same result for double logarithmic space, which is tight. When replacing the worktape with some limited memories, we can follow uncountable results on unary languages for two counters.
Fichier principal
Vignette du fichier
440206_1_En_8_Chapter.pdf (271.73 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01657007 , version 1 (06-12-2017)

Licence

Attribution

Identifiers

Cite

Abuzer Yakaryilmaz, Maksims Dimitrijevs. Uncountable Realtime Probabilistic Classes. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.102-113, ⟨10.1007/978-3-319-60252-3_8⟩. ⟨hal-01657007⟩
24 View
39 Download

Altmetric

Share

Gmail Facebook X LinkedIn More