Pusdown space complexity and related full-A.F.L.s.-Reference-Cited by-同舟云学术

Pusdown space complexity and related full-A.F.L.s.

Published:1984 Issue: Volume: Page:250-259
ISSN:0302-9743
Container-title:STACS 84
language:
Short-container-title:

Author:

Gabarro J.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-12920-0_23.pdf

Reference11 articles.

1. Autebert, J;Beauquier,J;Boasson,L;Latteux,M. [1980] "Very small families of algebraic non rational languages" in Formal Language Theory, editor Book,R,Academic Press.

2. Boasson, L.;Courcelle, B.;Nivat, M. [1981]. "The rational index a complexity measure for languages". SIAM Journal on Computing 10,2,284–296.

3. Culik,K;Maurer,H. "On the derivation of trees". Internal repport.

4. Gabarro,J. [1983]. "Funciones de complejidad y su relacion con las familias abstractas de lenguages". Thesis.Universidad Politécnica de Barcelona.Spain.

5. Gabarro,J. [1983]. "Initial index:a new complexity function for languages". ICALP-83.Lec.not.comp.sci.154,pag 226–236.

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

1. On the Degree of Extension of Some Models Defining Non-Regular Languages;Electronic Proceedings in Theoretical Computer Science;2023-09-03

2. Pushdown and One-Counter Automata: Constant and Non-constant Memory Usage;Descriptional Complexity of Formal Systems;2023

3. New Results on the Minimum Amount of Useful Space;International Journal of Foundations of Computer Science;2016-02

4. The Minimum Amount of Useful Space: New Results and New Directions;Developments in Language Theory;2014

5. A parallel context-free derivation hierarchy;Fundamentals of Computation Theory;1999