First-order expressibility of languages with neutral letters or: The Crane Beach conjecture-Reference-Cited by-同舟云学术

First-order expressibility of languages with neutral letters or: The Crane Beach conjecture

Author:

Mix Barrington David A.,Immerman Neil,Lautemann Clemens,Schweikardt Nicole,Thérien Denis

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference35 articles.

1. Σ11-formulae on finite structures;Ajtai;Ann. Pure Appl. Logic,1983

2. A theorem on probabilistic constant depth computations;Ajtai,1984

3. Embedded finite models, stability theory and the impact of order;Baldwin,1998

4. Regular languages in NC1;Barrington;J. Comput. System Sci.,1992

5. The Crane Beach Conjecture;Barrington,2001

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

1. What Formal Languages Can Transformers Express? A Survey;Transactions of the Association for Computational Linguistics;2024

2. The Regular Languages of First-Order Logic with One Alternation;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02