Abstract:[1] W. Plandowski. The Complexity of the Morphism Equivalence Problem for Context-Free Languages. Ph.D. Thesis Warsaw, 1995 [2] M. Lohrey. Algorithmics on SLP-compressed Strings: a Survey. Groups Comp...[1] W. Plandowski. The Complexity of the Morphism Equivalence Problem for Context-Free Languages. Ph.D. Thesis Warsaw, 1995 [2] M. Lohrey. Algorithmics on SLP-compressed Strings: a Survey. Groups Complexity Cryptology, Vol. 4(2); pp. 241–299; 2012. [3] M. Lohrey, S. Maneth, M. Schmidt-Schauss. Parameter Reduction and Automata Evaluation for Grammar-compressed Trees. J. Comput. Syst. Sci., Vol. 78(5); pp. 1651–1669; 2012.Read More
Publication Year: 2016
Publication Date: 2016-01-01
Language: ca
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot