Učitavanje...
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...
Spremljeno u:
| Glavni autor: | |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Open Publishing Association
2016-09-01
|
| Serija: | Electronic Proceedings in Theoretical Computer Science |
| Online pristup: | http://arxiv.org/pdf/1609.04101v1 |
| Oznake: |
Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|