{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:52:50Z","timestamp":1743058370999,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319948119"},{"type":"electronic","value":"9783319948126"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94812-6_15","type":"book-chapter","created":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T22:12:26Z","timestamp":1530223946000},"page":"173-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalised Twinning Property"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Gerdjikov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0304-3975(01)00214-6","volume":"292","author":"MP B\u00e9al","year":"2003","unstructured":"B\u00e9al, M.P., Carton, O., Prieur, C., Sakarovitch, J.: Squaring transducers: an efficient procedure for deciding functionality and sequentiality. TCS 292(1), 45\u201363 (2003)","journal-title":"TCS"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(77)90049-4","volume":"5","author":"C Choffrut","year":"1977","unstructured":"Choffrut, C.: Une caract\u00e9risation des fonctions s\u00e9quentielles et des fonctions sous-s\u00e9quentielles en tant que relations rationelles. TCS 5, 325\u2013338 (1977)","journal-title":"TCS"},{"doi-asserted-by":"crossref","unstructured":"Daviaud, L., Reynier, P.A., Talbot, J.M.: A generalised twinning property for minimisation of cost register automata. In: Symposium on Logic in Computer Science, pp. 857\u2013866 (2016)","key":"15_CR3","DOI":"10.1145\/2933575.2934549"},{"key":"15_CR4","volume-title":"Automata, Languages and Machines","author":"S Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines. Academic Press, New York and London (1974)"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-32940-1_11","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"E Filiot","year":"2012","unstructured":"Filiot, E., Gentilini, R., Raskin, J.-F.: Quantitative languages defined by functional automata. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 132\u2013146. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32940-1_11"},{"unstructured":"Gerdjikov, S.: Characterisation of (sub)sequential rational functions over a general class monoids. CoRR abs\/1801.10063 (2018)","key":"15_CR6"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-77313-1_11","volume-title":"Language and Automata Theory and Applications","author":"S Gerdjikov","year":"2018","unstructured":"Gerdjikov, S.: A general class of monoids supporting canonisation and minimisation of (Sub)sequential transducers. In: Klein, S.T., Mart\u00edn-Vide, C., Shapira, D. (eds.) LATA 2018. LNCS, vol. 10792, pp. 143\u2013155. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77313-1_11"},{"unstructured":"Gerdjikov, S., Mihov, S.: Myhill-Nerode Relation for Sequentiable Structures. ArXiv e-prints, June 2017. https:\/\/arxiv.org\/abs\/1706.02910","key":"15_CR8"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-319-53733-7_28","volume-title":"Language and Automata Theory and Applications","author":"S Gerdjikov","year":"2017","unstructured":"Gerdjikov, S., Mihov, S.: Over which monoids is the transducer determinization procedure applicable? In: Drewes, F., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2017. LNCS, vol. 10168, pp. 380\u2013392. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53733-7_28"},{"doi-asserted-by":"crossref","unstructured":"Gerdjikov, S., Mihov, S., Schulz, K.U.: Space-efficient bimachine construction based on the equalizer accumulation principle. CoRR abs\/1803.04312 (2018)","key":"15_CR10","DOI":"10.1016\/j.tcs.2019.04.027"},{"doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (2001)","key":"15_CR11","DOI":"10.1145\/568438.568455"},{"doi-asserted-by":"crossref","unstructured":"Kempe, A.: Part of speech tagging with two sequential transducers. CoRR cs.CL\/0110027 (2001). http:\/\/arxiv.org\/abs\/cs.CL\/0110027","key":"15_CR12","DOI":"10.1007\/3-540-44674-5_34"},{"issue":"1\u20132","key":"15_CR13","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.tcs.2006.01.028","volume":"356","author":"S Lombardy","year":"2006","unstructured":"Lombardy, S., Sakarovitch, J.: Sequential? TCS 356(1\u20132), 224\u2013244 (2006)","journal-title":"TCS"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S1351324996001234","volume":"2","author":"M Mohri","year":"1996","unstructured":"Mohri, M.: On some applications of finite-state automata theory to natural language processing. J. Nat. Lang. Eng. 2, 1\u201320 (1996)","journal-title":"J. Nat. Lang. Eng."},{"issue":"2","key":"15_CR15","first-page":"269","volume":"23","author":"M Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Comput. Linguist. 23(2), 269\u2013311 (1997)","journal-title":"Comput. Linguist."},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(98)00115-7","volume":"234","author":"M Mohri","year":"2000","unstructured":"Mohri, M.: Minimization algorithms for sequential transducers. TCS 234, 177\u2013201 (2000)","journal-title":"TCS"},{"doi-asserted-by":"crossref","unstructured":"Roche, E., Schabes, Y.: Introduction. In: Roche, E., Schabes, Y. (eds.) Finite-State Language Processing, pp. 1\u201366. MIT Press (1997)","key":"15_CR17","DOI":"10.7551\/mitpress\/3007.003.0003"},{"key":"15_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)"},{"unstructured":"Souza, R.N.P.d.: Properties of some classes of rational relations (short version in English). Master\u2019s thesis, University of Sao Paulo (2004)","key":"15_CR19"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94812-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:53:55Z","timestamp":1709826835000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94812-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319948119","9783319948126"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94812-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Charlottetown, PE","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.smcs.upei.ca\/ciaa2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}