On the Generative Capacity of Contextual Grammars with Strictly Locally Testable Selection Languages-Reference-Cited by-同舟云学术

On the Generative Capacity of Contextual Grammars with Strictly Locally Testable Selection Languages

Published:2022-08-27 Issue: Volume:367 Page:65-80
ISSN:2075-2180
Container-title:Electronic Proceedings in Theoretical Computer Science
language:en
Short-container-title:Electron. Proc. Theor. Comput. Sci.

Author:

Dassow Jürgen¹,Truthe Bianca²

Affiliation:

1. Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg

2. Institut für Informatik, Universität Giessen

Publisher

Open Publishing Association

Subject

Psychiatry and Mental health

Reference28 articles.

1. Quotient complexity of closed languages;Brzozowski;Theory of Computing Systems,2014

2. On the Circular Closure of Languages;Dassow;Elektronische Informationsverarbeitung und Kybernetik/Journal of Information Processing and Cybernetics,1979

3. Contextual grammars with subregular choice;Dassow;Fundamenta Informaticae,2005

4. Contextual languages with strictly locally testable and star free selection languages;Dassow;Analele Universitătii Bucuresti,2015

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

1. Merging two Hierarchies of Internal Contextual Grammars with Subregular Selection;Electronic Proceedings in Theoretical Computer Science;2023-09-15

2. Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars;Electronic Proceedings in Theoretical Computer Science;2023-09-03

3. Relations of contextual grammars with strictly locally testable selection languages;RAIRO - Theoretical Informatics and Applications;2023

4. Merging Two Hierarchies of External Contextual Grammars with Subregular Selection;Descriptional Complexity of Formal Systems;2023