Laddar...
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...
Sparad:
| Huvudupphovsman: | |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Publicerad: |
Open Publishing Association
2016-09-01
|
| Serie: | Electronic Proceedings in Theoretical Computer Science |
| Länkar: | http://arxiv.org/pdf/1609.04101v1 |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|