تحميل...
The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities
We introduce p-equivalence by asymptotic probabilities, which is a weak almost-equivalence based on zero-one laws in finite model theory. In this paper, we consider the computational complexities of p-equivalence problems for regular languages and provide the following details. First, we give an rob...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Open Publishing Association
2016-09-01
|
| سلاسل: | Electronic Proceedings in Theoretical Computer Science |
| الوصول للمادة أونلاين: | http://arxiv.org/pdf/1609.04101v1 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|