ロード中...
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 |
| オンライン･アクセス: | http://arxiv.org/pdf/1609.04101v1 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|