Caricamento...
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...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Open Publishing Association
2016-09-01
|
| Serie: | Electronic Proceedings in Theoretical Computer Science |
| Accesso online: | http://arxiv.org/pdf/1609.04101v1 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|