{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:57:42Z","timestamp":1769975862192,"version":"3.49.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030108007","type":"print"},{"value":"9783030108014","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10801-4_25","type":"book-chapter","created":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T09:38:37Z","timestamp":1547113117000},"page":"310-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the Expressive Power of GF(2)-Grammars"],"prefix":"10.1007","author":[{"given":"Vladislav","family":"Makarov","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,11]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences: Theory, Applications, Generalizations","author":"J-P Allouche","year":"2003","unstructured":"Allouche, J.-P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-319-77313-1_5","volume-title":"Language and Automata Theory and Applications","author":"E Bakinova","year":"2018","unstructured":"Bakinova, E., Basharin, A., Batmanov, I., Lyubort, K., Okhotin, A., Sazhneva, E.: Formal languages over GF(2). In: Klein, S.T., Mart\u00edn-Vide, C., Shapira, D. (eds.) LATA 2018. LNCS, vol. 10792, pp. 68\u201379. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77313-1_5"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.ic.2014.03.003","volume":"237","author":"M Barash","year":"2014","unstructured":"Barash, M., Okhotin, A.: An extension of context-free grammars with one-sided context specifications. Inf. Comput. 237, 268\u2013293 (2014). https:\/\/doi.org\/10.1016\/j.ic.2014.03.003","journal-title":"Inf. Comput."},{"issue":"4","key":"25_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s002360050123","volume":"35","author":"T Buchholz","year":"1998","unstructured":"Buchholz, T., Kutrib, M.: On time computability of functions in one-way cellular automata. Acta Informatica 35(4), 329\u2013352 (1998). https:\/\/doi.org\/10.1007\/s002360050123","journal-title":"Acta Informatica"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0304-3975(79)90011-2","volume":"9","author":"G Christol","year":"1979","unstructured":"Christol, G.: Ensembles presque periodiques $$k$$-reconnaissables. Theor. Comput. Sci. 9, 141\u2013145 (1979). https:\/\/doi.org\/10.1016\/0304-3975(79)90011-2","journal-title":"Theor. Comput. Sci."},{"key":"25_CR6","volume-title":"Automata, Languages and Machines","author":"S Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol. 1. Academic Press, Cambridge (1974)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2014.04.003","volume":"237","author":"V Forejt","year":"2014","unstructured":"Forejt, V., Jan\u010dar, P., Kiefer, S., Worrell, J.: Language equivalence of probabilistic pushdown automata. Inf. Comput. 237, 1\u201311 (2014). https:\/\/doi.org\/10.1016\/j.ic.2014.04.003","journal-title":"Inf. Comput."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/321127.321132","volume":"9","author":"S Ginsburg","year":"1962","unstructured":"Ginsburg, S., Rice, H.G.: Two families of languages related to ALGOL. J. ACM 9, 350\u2013371 (1962). https:\/\/doi.org\/10.1145\/321127.321132","journal-title":"J. ACM"},{"issue":"4","key":"25_CR9","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1145\/321186.321191","volume":"10","author":"S Ginsburg","year":"1963","unstructured":"Ginsburg, S., Spanier, E.H.: Quotients of context-free languages. J. ACM 10(4), 487\u2013492 (1963). https:\/\/doi.org\/10.1145\/321186.321191","journal-title":"J. ACM"},{"issue":"4","key":"25_CR10","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1137\/0202025","volume":"2","author":"SA Greibach","year":"1973","unstructured":"Greibach, S.A.: The hardest context-free language. SIAM J. Comput. 2(4), 304\u2013310 (1973). https:\/\/doi.org\/10.1137\/0202025","journal-title":"SIAM J. Comput."},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0304-3975(84)90015-X","volume":"29","author":"OH Ibarra","year":"1984","unstructured":"Ibarra, O.H., Kim, S.M.: Characterizations and computational complexity of systolic trellis automata. Theor. Comput. Sci. 29, 123\u2013153 (1984). https:\/\/doi.org\/10.1016\/0304-3975(84)90015-X","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"25_CR12","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1142\/S012905410800584X","volume":"19","author":"A Je\u017c","year":"2008","unstructured":"Je\u017c, A.: Conjunctive grammars can generate non-regular unary languages. Int. J. Found. Comput. Sci. 19(3), 597\u2013615 (2008). https:\/\/doi.org\/10.1142\/S012905410800584X","journal-title":"Int. J. Found. Comput. Sci."},{"key":"25_CR13","first-page":"1","volume-title":"Theoretical Studies in Computer Science","author":"Donald E. Knuth","year":"1992","unstructured":"Knuth, D.E.: Context-free multilanguages. In: Theoretical Studies in Computer Science, pp. 1\u201313. Academic Press, Cambridge (1992)"},{"issue":"1","key":"25_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1051\/ita:2004004","volume":"38","author":"A Okhotin","year":"2004","unstructured":"Okhotin, A.: On the equivalence of linear conjunctive grammars to trellis automata. RAIRO Informatique Th\u00e9orique et Applications 38(1), 69\u201388 (2004). https:\/\/doi.org\/10.1051\/ita:2004004","journal-title":"RAIRO Informatique Th\u00e9orique et Applications"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2013.06.001","volume":"9","author":"A Okhotin","year":"2013","unstructured":"Okhotin, A.: Conjunctive and Boolean grammars: the true general case of the context-free grammars. Comput. Sci. Rev. 9, 27\u201359 (2013). https:\/\/doi.org\/10.1016\/j.cosrev.2013.06.001","journal-title":"Comput. Sci. Rev."},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.tcs.2016.01.007","volume":"618","author":"A Okhotin","year":"2016","unstructured":"Okhotin, A.: Input-driven languages are linear conjunctive. Theor. Comput. Sci. 618, 52\u201371 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.01.007","journal-title":"Theor. Comput. Sci."},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-319-77313-1_3","volume-title":"Language and Automata Theory and Applications","author":"A Okhotin","year":"2018","unstructured":"Okhotin, A.: Underlying principles and recurring ideas of formal grammars. In: Klein, S.T., Mart\u00edn-Vide, C., Shapira, D. (eds.) LATA 2018. LNCS, vol. 10792, pp. 36\u201359. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77313-1_3"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-01492-5_7","volume-title":"Handbook of Weighted Automata","author":"I Petre","year":"2009","unstructured":"Petre, I., Salomaa, A.: Algebraic systems and pushdown automata. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, pp. 257\u2013289. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5_7"},{"issue":"2","key":"25_CR19","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(91)90374-B","volume":"88","author":"H Seki","year":"1991","unstructured":"Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theor. Comput. Sci. 88(2), 191\u2013229 (1991). https:\/\/doi.org\/10.1016\/0304-3975(91)90374-B","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"25_CR20","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0304-3975(94)00212-2","volume":"141","author":"V Terrier","year":"1995","unstructured":"Terrier, V.: On real-time one-way cellular array. Theor. Comput. Sci. 141(1\u20132), 331\u2013335 (1995). https:\/\/doi.org\/10.1016\/0304-3975(94)00212-2","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2019: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10801-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:17:39Z","timestamp":1709810259000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10801-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030108007","9783030108014"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10801-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/beda.dcs.fmph.uniba.sk\/sofsem2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}