Φορτώνει......
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...
Αποθηκεύτηκε σε:
| Κύριος συγγραφέας: | |
|---|---|
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
Open Publishing Association
2016-09-01
|
| Σειρά: | Electronic Proceedings in Theoretical Computer Science |
| Διαθέσιμο Online: | http://arxiv.org/pdf/1609.04101v1 |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|