On Language Equations XXK = XXL and XM = N over a Unary Alphabet-Reference-Cited by-同舟云学术

On Language Equations XXK = XXL and XM = N over a Unary Alphabet

Published:2010 Issue: Volume: Page:291-302
ISSN:0302-9743
Container-title:Developments in Language Theory
language:
Short-container-title:

Author:

Lehtinen Tommi,Okhotin Alexander

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-14455-4_27.pdf

Reference16 articles.

1. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, Boca Raton (1971)

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 46(1), 27–58 (2010)

4. Lecture Notes in Computer Science;A. Jeż,2008

5. Jeż, A., Okhotin, A.: Equations over sets of natural numbers with addition only. In: STACS 2009, Freiburg, Germany, February 26-28, pp. 577–588 (2009)

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

1. A Tale of Conjunctive Grammars;Developments in Language Theory;2018

2. Least and greatest solutions of equations over sets of integers;Theoretical Computer Science;2016-03

3. On language equations with concatenation and various sets of Boolean operations;RAIRO - Theoretical Informatics and Applications;2015-07

4. Conjunctive and Boolean grammars: The true general case of the context-free grammars;Computer Science Review;2013-08

5. On Language Equations with One-sided Concatenation;Fundamenta Informaticae;2013