Llwytho...
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...
Wedi'i Gadw mewn:
| Prif Awdur: | |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
Open Publishing Association
2016-09-01
|
| Cyfres: | Electronic Proceedings in Theoretical Computer Science |
| Mynediad Ar-lein: | http://arxiv.org/pdf/1609.04101v1 |
| Tagiau: |
Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|