On the expressive power of univariate equations over sets of natural numbers-Reference-Cited by-同舟云学术

On the expressive power of univariate equations over sets of natural numbers

Published: Issue: Volume: Page:215-227
ISSN:1571-5736
Container-title:Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008
language:
Short-container-title:

Author:

Okhotin Alexander,Rondogiannis Panos

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-0-387-09680-3_15.pdf

Reference8 articles.

1. A. Alhazov, personal communication, September 2007.

2. F. Baader, A. Okhotin, “Complexity of language equations with one-sided concatenation and all Boolean operations”, 20th International Workshop on Unification (UNIF 2006, Seattle, USA, August 11, 2006), 59–73.

3. A. Jeż, “Conjunctive grammars can generate non-regular unary languages”, Developments in Language Theory (DLT 2007, Turku, Finland, July 3–6, 2007), LNCS 4588, 242–253.

4. A. Jeż, A. Okhotin, “Conjunctive grammars over a unary alphabet: undecidability and unbounded growth”, Computer Science in Russia (CSR 2007, Ekaterinburg, Russia, September 3–7, 2007), LNCS 4649, 168–181.

5. M. Kunc, “What do we know about language equations?”, Developments in Language Theory (DLT 2007, Turku, Finland, July 3–6, 2007), LNCS 4588, 23–27.

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

1. Representing Hyper-arithmetical Sets by Equations over Sets of Integers;Theory of Computing Systems;2011-08-04

2. One-Nonterminal Conjunctive Grammars over a Unary Alphabet;Theory of Computing Systems;2011-03-10

3. One-Nonterminal Conjunctive Grammars over a Unary Alphabet;Computer Science - Theory and Applications;2009

4. On Equations over Sets of Numbers and Their Limitations;Developments in Language Theory;2009