A new algorithm for regularizing one-letter context-free grammars-Reference-Cited by-同舟云学术

A new algorithm for regularizing one-letter context-free grammars

Published:2003-09 Issue:1-3 Volume:306 Page:113-122
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Andrei Ştefan,Cavadini Salvador Valerio,Chin Wei-Ngan

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference16 articles.

1. Şt. Andrei, S. Cavadini, W.-N. Chin, Transforming self-embedded context-free grammars into regular expressions. Faculty of Computer Science. TR02-06, http://www.infoiasi.ro/~tr/tr.pl.cgi, Iaşi University, România, 2002, pp. 1–25.

2. D.N. Arden, Delayed logic and finite state machines, Theory of Computing Machine Design, University of Michigan Press, Ann Arbor, 1960, pp. 1–35.

3. Context-free languages and pushdown automata;Auteberg,1997

4. On formal properties of simple phrase structure grammars;Bar-Hillel;Z. Phonetik. Sprachwiss Kommunikationsforsch,1961

5. Two iteration theorems for some families of languages;Boasson;J. Comput. System Sci.,1973

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

1. Non-Self-Embedding Grammars and Descriptional Complexity;Fundamenta Informaticae;2021-05-12

2. POLYNOMIAL TIME-BOUNDED COMPUTATIONS IN SPIKING NEURAL P SYSTEMS;Neural Network World;2013

3. ON THE POWER OF FAMILIES OF RECOGNIZER SPIKING NEURAL P SYSTEMS;International Journal of Foundations of Computer Science;2011-01

4. Selected Topics in Computational Complexity of Membrane Systems;Computation, Cooperation, and Life;2011

5. Polynomial Complexity Classes in Spiking Neural P Systems;Membrane Computing;2010