Filters








4 Hits in 4.1 sec

MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS

LUCA BREVEGLIERI, ALESSANDRA CHERUBINI, CLAUDIO CITRINI, STEFANO CRESPI REGHIZZI
1996 International Journal of Foundations of Computer Science  
These languages preserve some important properties of cf languages: a generalization of the Chomsky-Sch utzenberger homomorphic characterization theorem, the Parikh theorem and a \pumping lemma" are proved  ...  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.  ...  Acknowledgment Thanks to Dino Mandrioli and to Pierluigi Sanpietro for their help. An anonymous referee has given valuable suggestions for improving the presentation.  ... 
doi:10.1142/s0129054196000191 fatcat:iou2glwgnjecpejuxj3lfk5yre

Page 1323 of Mathematical Reviews Vol. 24, Issue Index [page]

Mathematical Reviews  
automata and LL(1) parsing of breadth-depth grammars.  ...  of breadth-depth grammars.  ... 

Page 253 of Mathematical Reviews Vol. 24, Issue Index [page]

Mathematical Reviews  
Sci. 1 (1990), no. 3, 219-232. (Summary) 92a:68079 68Q50 (68Q70) — (with Breveglieri, Luca; Citrini, Claudio) Deterministic dequeue automata and LL(1) parsing of breadth-depth grammars.  ...  (Summary) 92h:81034 81Q10 Crespi-Reghizzi, Stefano (with Cherubini, Alessandra; Citrini, Claudio; Mandrioli, Dino) Breadth and depth grammars and Deque automata.  ... 

Tight integration of cache, path and task-interference modeling for the analysis of hard real time systems

Jan C. Kleinsorge, Technische Universität Dortmund, Technische Universität Dortmund
2015
and is based only on execution time bounds of whole tasks.  ...  In this thesis, we contribute to traditional techniques that overcome this problem by means of by passing path analysis entirely, and propose a general path analysis and several derivatives to support  ...  The loop depth is the distance from the root in a loop nesting tree. Graph Grammars The construction of a loop nesting forest corresponds to the parsing of a graph with an appropriate grammar.  ... 
doi:10.17877/de290r-16409 fatcat:j4ln2x56trbyjgpyw2bopqfo6q