{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:31:51Z","timestamp":1762507911157,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030336356"},{"type":"electronic","value":"9783030336363"}],"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-33636-3_5","type":"book-chapter","created":{"date-parts":[[2019,10,19]],"date-time":"2019-10-19T10:02:20Z","timestamp":1571479340000},"page":"103-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Self-certifying Railroad Diagrams"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5678-0286","authenticated-orcid":false,"given":"Ralf","family":"Hinze","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,20]]},"reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S0960129500000189","volume":"3","author":"S Abramsky","year":"1993","unstructured":"Abramsky, S., Vickers, S.: Quantales, observational logic and process semantics. Math. Struct. Comput. Sci. 3(2), 161\u2013227 (1993). \n                    https:\/\/doi.org\/10.1017\/S0960129500000189","journal-title":"Math. Struct. Comput. Sci."},{"key":"5_CR2","volume-title":"Compilers: Principles, Techniques, & Tools","author":"AV Aho","year":"2007","unstructured":"Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, & Tools, 2nd edn. Pearson Addison-Wesley, Boston (2007)","edition":"2"},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"V Antimirov","year":"1996","unstructured":"Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155(2), 291\u2013319 (1996). \n                    https:\/\/doi.org\/10.1016\/0304-3975(95)00182-4\n                    \n                  . \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/0304397595001824","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.jlap.2005.04.008","volume":"66","author":"R Backhouse","year":"2006","unstructured":"Backhouse, R.: Regular algebra applied to language problems. J. Logic Algebraic Program. 66(2), 71\u2013111 (2006). \n                    https:\/\/doi.org\/10.1016\/j.jlap.2005.04.008\n                    \n                  . \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1567832605000329","journal-title":"J. Logic Algebraic Program."},{"issue":"07","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1142\/S0129054111008908","volume":"22","author":"S Broda","year":"2011","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the average state complexity of partial derivative automata: an analytic combinatorics approach. Int. J. Found. Comput. Sci. 22(07), 1593\u20131606 (2011). \n                    https:\/\/doi.org\/10.1142\/S0129054111008908","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"5_CR6","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"JA Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964). \n                    https:\/\/doi.org\/10.1145\/321239.321249\n                    \n                  . \n                    http:\/\/doi.acm.org\/10.1145\/321239.321249","journal-title":"J. ACM"},{"issue":"3","key":"5_CR7","first-page":"195","volume":"45","author":"JM Champarnaud","year":"2001","unstructured":"Champarnaud, J.M., Ziadi, D.: From Mirkin\u2019s prebases to Antimirov\u2019s word partial derivatives. Fundam. Inf. 45(3), 195\u2013205 (2001)","journal-title":"Fundam. Inf."},{"key":"5_CR8","volume-title":"Regular Algebra and Finite Machines","author":"JH Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)"},{"key":"5_CR9","volume-title":"Pascal: User Manual and Report","author":"K Jensen","year":"1978","unstructured":"Jensen, K., Wirth, N.: Pascal: User Manual and Report, 2nd edn. Springer, Heidelberg (1978)","edition":"2"},{"key":"5_CR10","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. Technical report, RM-704, U.S. Air Force, Project RAND, Research Memorandum, December 1951"},{"key":"5_CR11","series-title":"Graduate Texts in Mathematics","volume-title":"Categories for the Working Mathematician","author":"S Mac Lane","year":"1998","unstructured":"Mac Lane, S.: Categories for the Working Mathematician. Graduate Texts in Mathematics, 2nd edn. Springer, Heidelberg (1998)","edition":"2"},{"key":"5_CR12","volume-title":"Introduction to Mathematical Theory of Computation","author":"Z Manna","year":"1974","unstructured":"Manna, Z.: Introduction to Mathematical Theory of Computation. McGraw-Hill Book Company, New York (1974)"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"EC-9","author":"R. McNaughton","year":"1960","unstructured":"McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IRE Trans. Electron. Comput. EC-9(1), 39\u201347 (1960). \n                    https:\/\/doi.org\/10.1109\/TEC.1960.5221603","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"5_CR14","first-page":"110","volume":"5","author":"BG Mirkin","year":"1966","unstructured":"Mirkin, B.G.: An algorithm for constructing a base in a language of regular expressions. Eng. Cybern. 5, 110\u2013116 (1966)","journal-title":"Eng. Cybern."},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114\u2013125 (1959). \n                    https:\/\/doi.org\/10.1147\/rd.32.0114","journal-title":"IBM J. Res. Dev."},{"issue":"6","key":"5_CR16","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K Thompson","year":"1968","unstructured":"Thompson, K.: Programming techniques: Regular expression search algorithm. Commun. ACM 11(6), 419\u2013422 (1968). \n                    https:\/\/doi.org\/10.1145\/363347.363387\n                    \n                  . \n                    http:\/\/doi.acm.org\/10.1145\/363347.363387","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33636-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,19]],"date-time":"2019-10-19T10:10:34Z","timestamp":1571479834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33636-3_5"}},"subtitle":["Or: How to Teach Nondeterministic Finite Automata"],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030336356","9783030336363"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33636-3_5","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":"20 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematics of Program Construction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mpc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.nott.ac.uk\/~pszgmh\/mpc19.html","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":"22","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":"15","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":"68% - 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":"4","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)"}}]}}