Á lódáil...
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:
| Príomhúdar: | |
|---|---|
| Formáid: | Artigo |
| Teanga: | Inglês |
| Foilsithe: |
Open Publishing Association
2016-09-01
|
| Sraith: | Electronic Proceedings in Theoretical Computer Science |
| Rochtain Ar Líne: | http://arxiv.org/pdf/1609.04101v1 |
| Clibeanna: |
Cuir Clib Leis
Gan Chlibeanna, Bí ar an gcéad duine leis an taifead seo a chlibeáil!
|