Ładuje się......
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...
Zapisane w:
| 1. autor: | |
|---|---|
| Format: | Artigo |
| Język: | Inglês |
| Wydane: |
Open Publishing Association
2016-09-01
|
| Seria: | Electronic Proceedings in Theoretical Computer Science |
| Dostęp online: | http://arxiv.org/pdf/1609.04101v1 |
| Etykiety: |
Dodaj etykietę
Nie ma etykietki, Dołącz pierwszą etykiete!
|