Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity-Reference-Cited by-同舟云学术

Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity

Published:2015 Issue: Volume: Page:473-485
ISSN:0302-9743
Container-title:Language and Automata Theory and Applications
language:
Short-container-title:

Author:

Bachmeier Georg,Luttenberger Michael,Schlund Maximilian

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-15579-1_37

Reference20 articles.

1. Lecture Notes in Computer Science;MF Atig,2008

2. Lecture Notes in Computer Science;R Axelsson,2008

3. Bachmeier, G., Luttenberger, M., Schlund, M.: Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity. CoRR abs/1410.2737 (2014). http://arxiv.org/abs/1410.2737

4. Bar-Hillel, Y., Perles, M., Shamir, E.: On Formal Properties of Simple Phrase Structure Grammars. Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationsforschung 14, 143–172 (1961)

5. Brabrand, C., Giegerich, R., Møller, A.: Analyzing Ambiguity of Context-Free Grammars. Sci. Comput. Program. 75(3), 176–191 (2010)

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

1. Verifying Unboundedness via Amalgamation;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Cost Automata, Safe Schemes, and Downward Closures;Fundamenta Informaticae;2023-04-07

3. Context-bounded verification of thread pools;Proceedings of the ACM on Programming Languages;2022-01-12

4. Context-bounded verification of liveness properties for multithreaded shared-memory programs;Proceedings of the ACM on Programming Languages;2021-01-04

5. General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond;Tools and Algorithms for the Construction and Analysis of Systems;2021