The complexity of ranking simple languages-Reference-Cited by-同舟云学术

The complexity of ranking simple languages

Published:1990-12 Issue:1 Volume:23 Page:1-19
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Huynh Dung T.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF02090763.pdf

Reference24 articles.

1. Allender, E.: Invertible Functions, Ph.D. Thesis, Georgia Institute of Technology, 1985.

2. Bertoni, A., Goldwurm, M., and Sabadini, N.: Computing the Counting Function of Context-Free Languages,Proc. 4th Symposium on Theoretical Aspects of Computer Science, LNCS 247, pp. 169–179, 1987.

3. Brandenburg, F.-J.: On One-Way Auxiliary Pushdown Automata,Proc. 3rd GI Conference on Theoretical Computer Science, LNCS 48, pp. 131–144, 1977.

4. Buss, S.: The Boolean Formula Value Problem Is in ALOGTIME,Proc. 19th ACM Symposium on Theory of Computing, pp. 123–131, 1987.

5. Chandra, A., Kozen, D., and Stockmeyer, L.: Alternation,J. Assoc. Comput. Mach.,28, pp. 114–133, 1981.

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Closure and nonclosure properties of the classes of compressible and rankable sets;Journal of Computer and System Sciences;2021-09

2. Recursion-theoretic ranking and compression;Journal of Computer and System Sciences;2019-05

3. Closure and Nonclosure Properties of the Compressible and Rankable Sets;Language and Automata Theory and Applications;2019

4. The Complexity of Finding Top-Toda-Equivalence-Class Members;Theory of Computing Systems;2005-08-03

5. The Complexity of Finding Top-Toda-Equivalence-Class Members;LATIN 2004: Theoretical Informatics;2004