Author:
Holzer Markus,Jakobi Sebastian,McQuillan Ian
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Aho, A.V.: Indexed grammars—an extension of context-free grammars. J. ACM 15(4), 647–671 (1968)
2. Bordihn, H., Holzer, M.: On the computational complexity of synchronized context-free languages. J. Univ. Comput. Sci. 8(2), 119–140 (2002)
3. Gilman, R.H.: A shrinking lemma for indexed languages. Theoret. Comput. Sci. 163(1-2), 277–281 (1996)
4. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)
5. Hromkovič, J., Karhumäki, J., Rovan, B., Slobodová, A.: On the power of synchronization in parallel computations. Discrete Appl. Math. 32, 155–182 (1991)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The complexity of verbal languages over groups;Journal of Computer and System Sciences;2019-05