A carregar...
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:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Open Publishing Association
2016-09-01
|
| Colecção: | Electronic Proceedings in Theoretical Computer Science |
| Acesso em linha: | http://arxiv.org/pdf/1609.04101v1 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|