Publisher
Springer International Publishing
Reference13 articles.
1. Berglund, M., Björklund, H., Björklund, J.: Shuffled languages - representation and recognition. Theor. Comput. Sci. 489–490, 1–20 (2013)
2. Czerwinski, W., Lasota, S.: Partially-commutative context-free languages. EXPRESS/SOS, pp. 35–48 (2012)
3. Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer, London (2013)
4. Esparza, J.: Petri nets, commutative context-free languages, and basic parallel processes. Fundam. Inform. 30, 23–41 (1997)
5. Garg, V., Ragunath, M.: Concurrent regular expressions and their relationship to petri nets. Theor. Comput. Sci. 96(2), 285–304 (1992)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Membership Problem of Permutation Grammars — A Direct Proof of NP-Completeness;International Journal of Foundations of Computer Science;2020-06
2. Regular and linear permutation languages;RAIRO - Theoretical Informatics and Applications;2018-04