Noncounting Context-Free Languages-Reference-Cited by-同舟云学术

Noncounting Context-Free Languages

Published:1978-10 Issue:4 Volume:25 Page:571-580
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Crespi-Reghizzi S.¹,Guida G.²,Mandrioli D.²

Affiliation:

1. Istituto di Scienza dell'Informazione, Università di Pisa, Pisa, Italy

2. Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano, Piazza Leonardo da Vinci, 32, 20133 Milan, Italy

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference19 articles.

1. Algebra automata I: Parallel programming as a prolegomena to the categorical approach

2. CRESPI-REGHIZZI S AND DELLA VIGNA P Approximation of phrase markers by regular sets Proc. Syrup. on Automata Languages and Programming IRIA Rocquencourt France i972 367-376 CRESPI-REGHIZZI S AND DELLA VIGNA P Approximation of phrase markers by regular sets Proc. Syrup. on Automata Languages and Programming IRIA Rocquencourt France i972 367-376

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

1. Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages;Logical Methods in Computer Science;2023-11-22

2. Homomorphic Characterization of Tree Languages Based on Comma-Free Encoding;Language and Automata Theory and Applications;2021

3. Beyond operator-precedence grammars and languages;Journal of Computer and System Sciences;2020-11

4. Star-Freeness, First-Order Definability and Aperiodicity of Structured Context-Free Languages;Theoretical Aspects of Computing – ICTAC 2020;2020

5. A Quantum Query Complexity Trichotomy for Regular Languages;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11