Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference34 articles.
1. H. Alt et K. Mehlhorn, Lower bounds for the space complexity of context-free recognition, in3 rd International Colloquium on Automata, Languages and Programming (S. Michaelson and R. Milner, Eds.) Edinburgh University Press, 338–354, 1976.
2. L. Boasson, Two iteration theorems for some families of languages,J. of Comput. and System Sci. 7, 583–596, 1973.
3. L. Boasson, Langages algébriques, paires itérantes et transductions rationnelles,Theoretical Computer Sci. 2, 209–223, 1976.
4. J. A. Brzozowski et I. Simon, Characterizations of locally testable events,Discrete Mathematics 4, 243–271, 1973.
5. A. H. Clifford et G. B. Preston,The Algebraic Theory of Semigroups, American Math. Soc. Vol. 1, 1961, Vol. 2, 1967.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On a subclass of context-free groups;RAIRO - Theoretical Informatics and Applications;1991