載入...
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...
Na minha lista:
| 主要作者: | |
|---|---|
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
Open Publishing Association
2016-09-01
|
| 叢編: | Electronic Proceedings in Theoretical Computer Science |
| 在線閱讀: | http://arxiv.org/pdf/1609.04101v1 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|