{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:08:05Z","timestamp":1743120485264,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030232467"},{"type":"electronic","value":"9783030232474"}],"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-23247-4_8","type":"book-chapter","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T23:02:38Z","timestamp":1562540558000},"page":"111-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Descriptional Complexity of Matrix Simple Semi-conditional Grammars"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4444-3220","authenticated-orcid":false,"given":"Henning","family":"Fernau","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2358-905X","authenticated-orcid":false,"given":"Lakshmanan","family":"Kuppusamy","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0981-9165","authenticated-orcid":false,"given":"Indhumathi","family":"Raman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"8_CR1","first-page":"61","volume":"4","author":"S \u00c1brah\u00e1m","year":"1965","unstructured":"\u00c1brah\u00e1m, S.: Some questions of phrase-structure grammars. I. Comput. Linguist. 4, 61\u201370 (1965)","journal-title":"I. Comput. Linguist."},{"key":"8_CR2","series-title":"EATCS Monographs in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1515\/9783112737873","volume-title":"Regulated Rewriting in Formal Language Theory","author":"J Dassow","year":"1989","unstructured":"Dassow, J., P\u0103un, G.: Regulated Rewriting in Formal Language Theory. EATCS Monographs in Theoretical Computer Science, vol. 18. Springer, Heidelberg (1989)"},{"issue":"1\/2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.25596\/jalc-2007-117","volume":"12","author":"H Fernau","year":"2007","unstructured":"Fernau, H., Freund, R., Oswald, M., Reinhardt, K.: Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars. J. Autom. Lang. Comb. 12(1\/2), 117\u2013138 (2007). https:\/\/doi.org\/10.25596\/jalc-2007-117","journal-title":"J. Autom. Lang. Comb."},{"doi-asserted-by":"crossref","unstructured":"Fernau, H., Kuppusamy, L., Oladele, R., Raman, I.: Improved descriptional complexity results for simple semi-conditional grammars (2019). Submitted to Fund. Inform","key":"8_CR4","DOI":"10.1007\/978-3-030-23247-4_8"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-319-94418-0_18","volume-title":"Sailing Routes in the World of Computation","author":"H Fernau","year":"2018","unstructured":"Fernau, H., Kuppusamy, L., Oladele, R.O.: New nonterminal complexity results for semi-conditional grammars. In: Manea, F., Miller, R.G., Nowotka, D. (eds.) CiE 2018. LNCS, vol. 10936, pp. 172\u2013182. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94418-0_18"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-319-62809-7_12","volume-title":"Developments in Language Theory","author":"Z Gazdag","year":"2017","unstructured":"Gazdag, Z., Tichler, K.: On the power of permitting semi-conditional grammars. In: Charlier, \u00c9., Leroy, J., Rigo, M. (eds.) DLT 2017. LNCS, vol. 10396, pp. 173\u2013184. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62809-7_12"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1051\/ita\/1991250504731","volume":"25","author":"V Geffert","year":"1991","unstructured":"Geffert, V.: Normal forms for phrase-structure grammars. RAIRO Theor. Inform. Appl. 25, 473\u2013498 (1991)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/BF01178731","volume":"31","author":"D Hauschildt","year":"1994","unstructured":"Hauschildt, D., Jantzen, M.: Petri net algorithms in the theory of matrix grammars. Acta Inform. 31, 719\u2013728 (1994). https:\/\/doi.org\/10.1007\/BF01178731","journal-title":"Acta Inform."},{"unstructured":"Masopust, T.: Formal models: regulation and reduction. Ph.D. thesis, Faculty of Information Technology, Brno University of Technology, Brno, Czech Republic (2007)","key":"8_CR9"},{"issue":"4","key":"8_CR10","first-page":"307","volume":"11","author":"A Meduna","year":"1994","unstructured":"Meduna, A., Gopalaratnam, M.: On semi-conditional grammars with productions having either forbidding or permitting conditions. Acta Cybern. 11(4), 307\u2013323 (1994). http:\/\/www.inf.u-szeged.hu\/actacybernetica\/edb\/vol11n4\/Meduna1994ActaCybernetica.xml","journal-title":"Acta Cybern."},{"key":"8_CR11","first-page":"287","volume":"23","author":"A Meduna","year":"2004","unstructured":"Meduna, A., Kope\u010dek, T.: Simple semi-conditional versions of matrix grammars with a reduced regulating mechanism. Comput. Inform. 23, 287\u2013302 (2004). http:\/\/www.cai.sk\/ojs\/index.php\/cai\/article\/view\/430","journal-title":"Comput. Inform."},{"issue":"3","key":"8_CR12","first-page":"353","volume":"15","author":"A Meduna","year":"2002","unstructured":"Meduna, A., \u0160vec, M.: Reduction of simple semi-conditional grammars with respect to the number of conditional productions. Acta Cybern. 15(3), 353\u2013360 (2002). http:\/\/www.inf.u-szeged.hu\/actacybernetica\/edb\/vol15n3\/Meduna2002ActaCybernetica.xml","journal-title":"Acta Cybern."},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ipl.2009.10.002","volume":"110","author":"F Okubo","year":"2009","unstructured":"Okubo, F.: A note on the descriptional complexity of semi-conditional grammars. Inform. Process. Lett. 110(1), 36\u201340 (2009). https:\/\/doi.org\/10.1016\/j.ipl.2009.10.002","journal-title":"Inform. Process. Lett."},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(85)90056-8","volume-title":"Theoret. Comput. Sci.","author":"G P\u0103un","year":"1985","unstructured":"P\u0103un, G.: A variant of random context grammars: semi-conditional grammars. Theoret. Comput. Sci., pp. 1\u201317. (1985). https:\/\/doi.org\/10.1016\/0304-3975(85)90056-8"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.tcs.2004.06.032","volume":"330","author":"G Vaszil","year":"2005","unstructured":"Vaszil, G.: On the descriptional complexity of some rewriting mechanisms regulated by context conditions. Theoret. Comput. Sci. 330, 361\u2013373 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.06.032","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23247-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T06:51:04Z","timestamp":1739343064000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23247-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030232467","9783030232474"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23247-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"25 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ko\u0161ice","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":"17 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/im.saske.sk\/dcfs2019\/","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":"25","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":"18","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":"0","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":"72% - 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,1","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":"2,9","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)"}},{"value":"there are also 4 invited talks","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}