{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:26:05Z","timestamp":1780068365697,"version":"3.54.0"},"reference-count":35,"publisher":"Oxford University Press (OUP)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Logic Computation"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1093\/logcom\/ext037","type":"journal-article","created":{"date-parts":[[2013,7,31]],"date-time":"2013-07-31T20:30:05Z","timestamp":1375302605000},"page":"1203-1229","source":"Crossref","is-referenced-by-count":11,"title":["The syntactic concept lattice: Another algebraic theory of the context-free languages?"],"prefix":"10.1093","volume":"25","author":[{"given":"Alexander","family":"Clark","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2013,7,30]]},"reference":[{"key":"2015092802073454000_25.5.1203.1","doi-asserted-by":"publisher","DOI":"10.1145\/322326.322334"},{"key":"2015092802073454000_25.5.1203.2","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90052-6"},{"key":"2015092802073454000_25.5.1203.3","unstructured":"Bollig B. Habermehl P. Kern C. Leucker M. Angluin-style learning of NFA. Proceedings of IJCAI 21 2009."},{"key":"2015092802073454000_25.5.1203.4","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)72023-8"},{"key":"2015092802073454000_25.5.1203.5","doi-asserted-by":"crossref","unstructured":"Clark A. Distributional learning of some context-free languages with a minimally adequate teacher. In: Sempere J. Garcia P. , editors. Grammatical Inference: Theoretical Results and Applications. Proceedings of the International Colloquium on Grammatical Inference. Springer; 2010. p. 24-37.","DOI":"10.1007\/978-3-642-15488-1_4"},{"key":"2015092802073454000_25.5.1203.6","unstructured":"Clark A. Proceedings of the Fourteenth Conference on Computational Natural Language Learning. Uppsala, Sweden: Association for Computational Linguistics; 2010. Efficient, correct, unsupervised learning of context-sensitive languages; p. 28-37."},{"key":"2015092802073454000_25.5.1203.7","doi-asserted-by":"crossref","unstructured":"Clark A. Learning context free grammars with the syntactic concept lattice. In: Sempere J. Garcia P. , editors. Grammatical Inference: Theoretical Results and Applications. Proceedings of the International Colloquium on Grammatical Inference. Springer; 2010. p. 38-51.","DOI":"10.1007\/978-3-642-15488-1_5"},{"key":"2015092802073454000_25.5.1203.8","doi-asserted-by":"crossref","unstructured":"Clark A. Three learnable models for the description of language. In: Mart\u00edn-Vide C. Dediu A.-H. Fernau H. , editors. Language and Automata Theory and Applications, Fourth International Conference, LATA 2010, LNCS. Springer; 2010. p. 16-31.","DOI":"10.1007\/978-3-642-13089-2_2"},{"key":"2015092802073454000_25.5.1203.9","doi-asserted-by":"crossref","unstructured":"Clark A. A learnable representation for syntax using residuated lattices. In: Groote P. Egg M. Kallmeyer L. , editors. Formal Grammar, vol. 5591 of Lecture Notes in Computer Science. Springer; 2011. p. 183-198.","DOI":"10.1007\/978-3-642-20169-1_12"},{"key":"2015092802073454000_25.5.1203.10","doi-asserted-by":"crossref","unstructured":"Clark A. Logical grammars, logical theories. In: Bechet D. Dikovsky A. , editors. Logical Aspects of Computational Linguistics. Springer; 2012. p. 1-20.","DOI":"10.1007\/978-3-642-31262-5_1"},{"key":"2015092802073454000_25.5.1203.11","unstructured":"Clark A. Eyraud R. Polynomial identification in the limit of substitutable context-free languages. Journal of Machine Learning Research 2007;8:1725-1745."},{"key":"2015092802073454000_25.5.1203.12","unstructured":"Conway J. H. Regular Algebra and Finite Machines. Chapman and Hall; 1971."},{"key":"2015092802073454000_25.5.1203.13","doi-asserted-by":"crossref","unstructured":"Davey B. A. Priestley H. A. Introduction to Lattices and Order. Cambridge University Press; 2002.","DOI":"10.1017\/CBO9780511809088"},{"key":"2015092802073454000_25.5.1203.14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.11.008"},{"key":"2015092802073454000_25.5.1203.15","unstructured":"Eilenberg S. Automata, Languages, and Machines. Academic Press; 1974."},{"key":"2015092802073454000_25.5.1203.16","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2004.10.008"},{"key":"2015092802073454000_25.5.1203.17","unstructured":"Galatos N. Jipsen P. Kowalski T. Ono H. Residuated Lattices: An Algebraic Glimpse at Substructural Logics. Elsevier; 2007."},{"key":"2015092802073454000_25.5.1203.18","unstructured":"Ganter B. Wille R. Formal Concept Analysis: Mathematical Foundations. Springer; 1997."},{"key":"2015092802073454000_25.5.1203.19","doi-asserted-by":"publisher","DOI":"10.1145\/321127.321132"},{"key":"2015092802073454000_25.5.1203.20","doi-asserted-by":"crossref","unstructured":"Golan J. S. Semirings and their Applications. Springer; 1999.","DOI":"10.1007\/978-94-015-9333-5"},{"key":"2015092802073454000_25.5.1203.21","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(86)90061-9"},{"key":"2015092802073454000_25.5.1203.22","doi-asserted-by":"publisher","DOI":"10.1137\/0222067"},{"key":"2015092802073454000_25.5.1203.23","doi-asserted-by":"crossref","unstructured":"Jipsen P. From semirings to residuated Kleene lattices. Studia Logica: An International Journal for Symbolic Logic 2004;76:291-303.","DOI":"10.1023\/B:STUD.0000032089.54776.63"},{"key":"2015092802073454000_25.5.1203.24","doi-asserted-by":"publisher","DOI":"10.2307\/2310058"},{"key":"2015092802073454000_25.5.1203.25","unstructured":"Leiss H. 2012. Learning CFGs with the finite context property: a note on A. Clark's algorithm. Manuscript."},{"key":"2015092802073454000_25.5.1203.26","doi-asserted-by":"crossref","unstructured":"Lombardy S. On the size of the universal automaton of a regular language. In: Thomas W. Weil P. , editors. STACS 2007, vol. 4393 of Lecture Notes in Computer Science. Springer; 2007. p. 85-96.","DOI":"10.1007\/978-3-540-70918-3_8"},{"key":"2015092802073454000_25.5.1203.27","unstructured":"Lombardy S. Sakarovitch J. The universal automaton. In: Flum J. Gr\u00e4del E. Wilke T. , editors. Logic and Automata: History and Perspectives. Vol. 2. Amsterdam University Press; 2008. p. 457-504."},{"key":"2015092802073454000_25.5.1203.28","doi-asserted-by":"crossref","unstructured":"Pereira F. C. N. Shieber S. M. Proceedings of the 10th International Conference on Computational Linguistics and 22nd Annual Meeting on Association for Computational Linguistics. Association for Computational Linguistics; 1984. The semantics of grammar formalisms seen as computer languages; p. 123-129.","DOI":"10.3115\/980431.980518"},{"key":"2015092802073454000_25.5.1203.29","doi-asserted-by":"crossref","unstructured":"Pol\u00e1k L. Syntactic semiring of a language. In: Sgall J. Pultr A. Kolman P. , editors. Mathematical Foundations of Computer Science 2001. Springer; 2001. p. 611-620.","DOI":"10.1007\/3-540-44683-4_53"},{"key":"2015092802073454000_25.5.1203.30","doi-asserted-by":"crossref","unstructured":"Pol\u00e1k L. Syntactic semiring and universal automaton. In: \u00c9sik Z. F\u00fcl\u00f6p Z. , editors. Developments in Language Theory. Springer; 2003. p. 411-422.","DOI":"10.1007\/3-540-45007-6_33"},{"key":"2015092802073454000_25.5.1203.31","doi-asserted-by":"publisher","DOI":"10.1147\/rd.32.0114"},{"key":"2015092802073454000_25.5.1203.32","doi-asserted-by":"crossref","unstructured":"Sakarovitch J. Elements of Automata Theory. Cambridge University Press; 2009.","DOI":"10.1017\/CBO9781139195218"},{"key":"2015092802073454000_25.5.1203.33","doi-asserted-by":"crossref","unstructured":"Wurm C. Completeness of full Lambek calculus for syntactic concept lattices. Proceedings of the 17th conference on Formal Grammar 2012 (FG) 2012.","DOI":"10.1007\/978-3-642-39998-5_8"},{"key":"2015092802073454000_25.5.1203.34","doi-asserted-by":"crossref","unstructured":"Yoshinaka R. Towards dual approaches for learning context-free grammars based on syntactic concept lattices. In: Mauri G. Leporati A. , editors. Developments in Language Theory, vol. 6795 of Lecture Notes in Computer Science. Springer; 2011. p. 429-440.","DOI":"10.1007\/978-3-642-22321-1_37"},{"key":"2015092802073454000_25.5.1203.35","doi-asserted-by":"crossref","unstructured":"Yoshinaka R. Integration of the dual approaches in the distributional learning of context-free grammars. In: Dediu A.-H. Carlos M.-V. , editors. LATA. Springer; 2012. p. 538-550.","DOI":"10.1007\/978-3-642-28332-1_46"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/25\/5\/1203\/5277259\/ext037.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,20]],"date-time":"2019-07-20T00:51:22Z","timestamp":1563583882000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article-lookup\/doi\/10.1093\/logcom\/ext037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,30]]},"references-count":35,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2015,9,28]]},"published-print":{"date-parts":[[2015,10]]}},"alternative-id":["10.1093\/logcom\/ext037"],"URL":"https:\/\/doi.org\/10.1093\/logcom\/ext037","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,30]]}}}