Author:
Jeż Artur,Okhotin Alexander
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Huynh, D.T.: Commutative grammars: the complexity of uniform word problems. Information and Control 57(1), 21–39 (1983)
2. Jeż, A.: Conjunctive grammars can generate non-regular unary languages. International Journal of Foundations of Computer Science 19(3), 597–615 (2008)
3. Jeż, A., Okhotin, A.: Conjunctive grammars over a unary alphabet: undecidability and unbounded growth. Theory of Computing Systems (to appear)
4. Jeż, A., Okhotin, A.: Complexity of equations over sets of natural numbers. In: 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2008), Bordeaux, France, February 21-23, pp. 373–383 (2008)
5. Jeż, A., Okhotin, A.: On the computational completeness of equations over sets of natural numbers. In: 35th International Colloquium on Automata, Languages and Programming (ICALP 2008), Reykjavik, Iceland, July 7-11, pp. 63–74 (2008)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献