Recognizing Two-Sided Contexts in Cubic Time
Barash and Okhotin (“Grammars with two-sided contexts”, Tech. Rep. 1090, Turku Centre for Computer Science, 2013) recently introduced conjunctive grammars with two-sided contexts, and gave a variant of Valiant’s algorithm which recognizes the languages they generate in O(|G|2·n 3.3727) time and O(|G|·n 2) space. We use a new normal form and techniques from logic programming to improve this to O(|G|·n 3), without increasing the space usage.
Unable to display preview. Download preview PDF.
- Barash, M., Okhotin, A.: Grammars with two-sided contexts. Tech. Rep. 1090, Turku Centre for Computer Science (2013), http://tucs.fi/publications/view/?pub_id=tBaOk13b
- Kowalski, R.: Logic for problem-solving. North-Holland Publishing Co. (1979), http://www.doc.ic.ac.uk/~rak/
- Williams, V.V.: Multiplying matrices faster than Coppersmith-Winograd. In: Proceedings of the 44th Symposium on Theory of Computing, STOC 2012, pp. 887–898. ACM (2012)Google Scholar