Languages defined with modular counting quantifiers - (extended abstract)

被引:0
|
作者
Straubing, H [1 ]
机构
[1] Boston Coll, Dept Comp Sci, Chestnut Hill, MA 02167 USA
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:332 / 343
页数:12
相关论文
共 50 条
  • [1] Languages defined with modular counting quantifiers
    Straubing, H
    INFORMATION AND COMPUTATION, 2001, 166 (02) : 112 - 132
  • [2] The complexity of counting quantifiers on equality languages
    Martin, Barnaby
    Pongracz, Andras
    Wrona, Michal
    THEORETICAL COMPUTER SCIENCE, 2017, 670 : 56 - 67
  • [3] The Complexity of Counting Quantifiers on Equality Languages
    Martin, Barnaby
    Pongracz, Andras
    Wrona, Michal
    Pursuit of the Universal, 2016, 9709 : 333 - 342
  • [4] REGULAR LANGUAGES DEFINED WITH GENERALIZED QUANTIFIERS
    STRAUBING, H
    THERIEN, D
    THOMAS, W
    INFORMATION AND COMPUTATION, 1995, 118 (02) : 289 - 301
  • [5] REGULAR LANGUAGES DEFINED WITH GENERALIZED QUANTIFIERS
    STRAUBING, H
    THERIEN, D
    THOMAS, W
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 317 : 561 - 575
  • [6] COMPLEXITY CLASSES DEFINED BY COUNTING QUANTIFIERS
    TORAN, J
    JOURNAL OF THE ACM, 1991, 38 (03) : 753 - 774
  • [7] On Presburger Arithmetic Extended with Modulo Counting Quantifiers
    Habermehl, Peter
    Kuske, Dietrich
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2015), 2015, 9034 : 375 - 389
  • [8] Counting the Cost in the Picalculus (Extended Abstract)
    Hennessy, Matthew
    Gaur, Manish
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 229 (03) : 117 - 129
  • [9] Varieties and Covarieties of Languages (Extended Abstract)
    Rutten, Jan
    Ballester-Bolinches, Adolfo
    Cosme-Llopez, Enric
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2013, 298 : 7 - 28
  • [10] Exotic quantifiers, complexity classes, and complete problems -: (Extended abstract)
    Buergisser, Peter
    Cucker, Felipe
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 207 - +