On Distinguishing NC1 and NL

被引：1
|
作者：
Krebs, Andreas [1 ]
Lange, Klaus-Joern [1 ]
Ludwig, Michael [1 ]
机构：
[1] Univ Tubingen, WSI, D-72076 Tubingen, Germany
来源：
DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015) | 2015年 / 9168卷
关键词：
LANGUAGES;
D O I：
10.1007/978-3-319-21500-6_27
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We obtain results within the area of dense completeness, which describes a close relation between families of formal languages and complexity classes. Previously we were able show that this relation exists between counter languages and NL but not between the regular languages and NC1. We narrow the gap between the regular languages and the counter languages by considering visibly counter languages. It turns out that they are not densely complete for NC1. At the same time we found a restricted counter automaton model which is densely complete for NL. Besides counter automata we show more positive examples in terms of L-systems.
引用
收藏
页码：340 / 351
页数：12
相关论文
共 50 条
  • [1] AN ALGEBRA AND A LOGIC FOR NC1
    COMPTON, KJ
    LAFLAMME, C
    INFORMATION AND COMPUTATION, 1990, 87 (1-2) : 241 - 263
  • [2] ON UNIFORMITY WITHIN NC1
    BARRINGTON, DAM
    IMMERMAN, N
    STRAUBING, H
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1990, 41 (03) : 274 - 306
  • [3] Nondeterministic NC1 computation
    Caussinus, H
    McKenzie, P
    Therien, D
    Vollmer, H
    ELEVENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1996, : 12 - 21
  • [4] Nondeterministic NC1 computation
    Caussinus, H
    McKenzie, P
    Therien, D
    Vollmer, H
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1998, 57 (02) : 200 - 212
  • [5] Compact Adaptively Secure ABE from k-Lin: Beyond NC1 and Towards NL
    Lin, Huijia
    Luo, Ji
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2020, PT III, 2020, 12107 : 247 - 277
  • [6] On theories of bounded arithmetic for NC1
    Jerabek, Emil
    ANNALS OF PURE AND APPLIED LOGIC, 2011, 162 (04) : 322 - 340
  • [7] Classes of Szilard Languages in NC1
    Cojocaru, Liliana
    Makinen, Erkki
    Tiplea, Ferucio Laurentiu
    11TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2009), 2009, : 299 - 306
  • [8] 【寂静之声】 ASUS NC1
    张越
    个人电脑, 2012, 18 (04) : 45 - 46
  • [9] SOME CLASSES OF LANGUAGES IN NC1
    IBARRA, OH
    JIANG, T
    CHANG, JH
    RAVIKUMAR, B
    INFORMATION AND COMPUTATION, 1991, 90 (01) : 86 - 106
  • [10] Counting Paths in VPA Is Complete for #NC1
    Andreas Krebs
    Nutan Limaye
    Meena Mahajan
    Algorithmica, 2012, 64 : 279 - 294
12345