Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barash, M., Okhotin, A.: Defining contexts in context-free grammars. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 106–118. Springer, Heidelberg (2012)
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
Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae. The Journal of Logic Programming 1(3), 267–284 (1984)
Kowalski, R.: Logic for problem-solving. North-Holland Publishing Co. (1979), http://www.doc.ic.ac.uk/~rak/
Okhotin, A.: Conjunctive and boolean grammars: the true general case of the context-free grammars. Computer Science Review 9, 27–59 (2013)
Shieber, S.M., Schabes, Y., Pereira, F.C.N.: Principles and implementation of deductive parsing. The Journal of Logic Programming 24(1-2), 3–36 (1995)
Valiant, L.G.: General context-free recognition in less than cubic time. Journal of Computer and System Sciences 10(2), 308–315 (1975)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Rabkin, M. (2014). Recognizing Two-Sided Contexts in Cubic Time. In: Hirsch, E.A., Kuznetsov, S.O., Pin, JÉ., Vereshchagin, N.K. (eds) Computer Science - Theory and Applications. CSR 2014. Lecture Notes in Computer Science, vol 8476. Springer, Cham. https://doi.org/10.1007/978-3-319-06686-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-06686-8_24
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06685-1
Online ISBN: 978-3-319-06686-8
eBook Packages: Computer ScienceComputer Science (R0)