loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th Annual IEEE Conference on Computational Complexity (CCC'04)
Some Results on Majority Quantifiers over Words
Amherst, Massachusetts
June 21-June 24
ISBN: 0-7695-2120-7
ASCII Text
x 
 
Klaus-Jörn Lange, "Some Results on Majority Quantifiers over Words," Computational Complexity, Annual IEEE Conference on, pp. 123-129, 19th Annual IEEE Conference on Computational Complexity (CCC'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/CCC.2004.1313817,
author = {Klaus-Jörn Lange},
title = {Some Results on Majority Quantifiers over Words},
journal ={Computational Complexity, Annual IEEE Conference on},
volume = {0},
year = {2004},
issn = {1093-0159},
pages = {123-129},
doi = {http://doi.ieeecomputersociety.org/10.1109/CCC.2004.1313817},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computational Complexity, Annual IEEE Conference on
TI - Some Results on Majority Quantifiers over Words
SN - 1093-0159
SP123
EP129
A1 - Klaus-Jörn Lange,
PY - 2004
KW - null
VL - 0
JA - Computational Complexity, Annual IEEE Conference on
ER -
 
Klaus-Jörn Lange, Eberhard-Karls-Universität Tübingen
The class of languages definable by majority quantifiers using the order predicate is investigated. It is shown that the additional use of first order or counting quantifiers does not increase this class. Further on, addition is in this connection a definable numerical predicate, while the converse does not hold. The emptiness problem for this class turns out to be undecidable.
Citation:
Klaus-Jörn Lange, "Some Results on Majority Quantifiers over Words," ccc, pp.123-129, 19th Annual IEEE Conference on Computational Complexity (CCC'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.