MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS-Reference-Cited by-同舟云学术

MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS

Published:1996-09 Issue:03 Volume:07 Page:253-291
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

BREVEGLIERI LUCA¹,CHERUBINI ALESSANDRA²,CITRINI CLAUDIO²,REGHIZZI STEFANO CRESPI¹

Affiliation:

1. Dipartimento di Elettronica e Informazione, Milano, Piazza Leonardo Da Vinci 32, 20133 Milano, Italy

2. Dipartimento di Matematica, Politecnico di Milano, Piazza Leonardo Da Vinci 32, 20133 Milano, Italy

Abstract

A new class of languages, called multi-push-down (mpd), that generalize the classical context-free (cf, or Chomsky type 2) ones is introduced. These languages preserve some important properties of cf languages: a generalization of the Chomsky-Schützenberger homomorphic characterization theorem, the Parikh theorem and a “pumping lemma” are proved. Multi-push-down languages are an AFL. Their recognizers are automata equipped with a multi-push-down tape. Multi-push-down languages form a hierarchy based on the number of push-down tapes.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054196000191

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

1. Cost Automata, Safe Schemes, and Downward Closures;Fundamenta Informaticae;2023-04-07

2. Reversible Computations of One-Way Counter Automata;Electronic Proceedings in Theoretical Computer Science;2022-08-27

3. How treewidth helps in verification;ACM SIGLOG News;2022-01

4. Input-driven multi-counter automata;Theoretical Computer Science;2021-05

5. Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity;Theoretical Computer Science;2021-03