Uncountable Realtime Probabilistic Classes

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.
Type de document :
Communication dans un congrès
Giovanni Pighizzini; Cezar Câmpeanu. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. Springer International Publishing, Lecture Notes in Computer Science, LNCS-10316, pp.102-113, 2017, Descriptional Complexity of Formal Systems. 〈10.1007/978-3-319-60252-3_8〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01657007
Contributeur : Hal Ifip <>
Soumis le : mercredi 6 décembre 2017 - 11:44:09
Dernière modification le : mercredi 6 décembre 2017 - 13:46:19

Fichier

 Accès restreint
Fichier visible le : 2020-01-01

Connectez-vous pour demander l'accès au fichier

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Abuzer Yakaryılmaz, Maksims Dimitrijevs. Uncountable Realtime Probabilistic Classes. Giovanni Pighizzini; Cezar Câmpeanu. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. Springer International Publishing, Lecture Notes in Computer Science, LNCS-10316, pp.102-113, 2017, Descriptional Complexity of Formal Systems. 〈10.1007/978-3-319-60252-3_8〉. 〈hal-01657007〉

Partager

Métriques

Consultations de la notice

21