{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:02:49Z","timestamp":1746331369920,"version":"3.40.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080185"},{"type":"electronic","value":"9783319080192"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08019-2_8","type":"book-chapter","created":{"date-parts":[[2014,6,5]],"date-time":"2014-06-05T01:09:47Z","timestamp":1401930587000},"page":"73-83","source":"Crossref","is-referenced-by-count":1,"title":["On the Equivalence of Automata for KAT-expressions"],"prefix":"10.1007","author":[{"given":"Sabine","family":"Broda","sequence":"first","affiliation":[]},{"given":"Ant\u00f3nio","family":"Machiavelo","sequence":"additional","affiliation":[]},{"given":"Nelma","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"8_CR1","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1142\/S0129054109006802","volume":"20","author":"M. Almeida","year":"2009","unstructured":"Almeida, M., Moreira, N., Reis, R.: Antimirov and Mosses\u2019s rewrite system revisited. International Journal of Foundations of Computer Science\u00a020(4), 669\u2013684 (2009)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"1\/2","key":"8_CR2","first-page":"7","volume":"15","author":"M. Almeida","year":"2010","unstructured":"Almeida, M., Moreira, N., Reis, R.: Testing regular languages equivalence. Journal of Automata, Languages and Combinatorics\u00a015(1\/2), 7\u201325 (2010)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Almeida, R., Broda, S., Moreira, N.: Deciding KAT and Hoare logic with derivatives (96). In: Faella, M., Murano, A. (eds.) Proc. 3rd GANDALF. EPTCS, vol.\u00a096, pp. 127\u2013140 (2012)","DOI":"10.4204\/EPTCS.96.10"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-39634-2_16","volume-title":"Interactive Theorem Proving","author":"A. Armstrong","year":"2013","unstructured":"Armstrong, A., Struth, G., Weber, T.: Program analysis and verification based on Kleene algebra in Isabelle\/HOL. In: Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds.) ITP 2013. LNCS, vol.\u00a07998, pp. 197\u2013212. Springer, Heidelberg (2013)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Pous, D.: Checking NFA equivalence with bisimulations up to congruence. In: Giacobazzi, R., Cousot, R. (eds.) The 40th Annual ACM SIGPLAN-SIGACT Symposium POPL 2013, pp. 457\u2013468. ACM (2013)","DOI":"10.1145\/2480359.2429124"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-40164-0_10","volume-title":"Fundamentals of Computation Theory","author":"S. Broda","year":"2013","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the Average Size of Glushkov and Equation Automata for KAT Expressions. In: G\u0105sieniec, L., Wolter, F. (eds.) FCT 2013. LNCS, vol.\u00a08070, pp. 72\u201383. Springer, Heidelberg (2013)"},{"key":"8_CR7","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: Automata for KAT expressions. Tech. Rep. DCC-2014-01, FCUP & CMUP, Universidade do Porto (January 2014), http:\/\/www.dcc.fc.up.pt\/dcc\/Pubs\/TReports\/"},{"issue":"3","key":"8_CR8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/FUN-2001-45303","volume":"45","author":"J.M. Champarnaud","year":"2001","unstructured":"Champarnaud, J.M., Ziadi, D.: From Mirkin\u2019s prebases to Antimirov\u2019s word partial derivatives. Fundam. Inform.\u00a045(3), 195\u2013205 (2001)","journal-title":"Fundam. Inform."},{"key":"8_CR9","unstructured":"Cohen, E., Kozen, D., Smith, F.: The complexity of Kleene algebra with tests. Tech. Rep. TR96-1598, Computer Science Department, Cornell University (July 1996)"},{"key":"8_CR10","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press (2003)"},{"key":"8_CR11","unstructured":"Hopcroft, J., Karp, R.M.: A linear algorithm for testing equivalence of finite automata. Tech. Rep. TR 71 -114, University of California, Berkeley, California (1971)"},{"issue":"3","key":"8_CR12","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D. Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebra with tests. Trans. on Prog. Lang. and Systems\u00a019(3), 427\u2013443 (1997)","journal-title":"Trans. on Prog. Lang. and Systems"},{"key":"8_CR13","first-page":"117","volume":"24","author":"D. Kozen","year":"2003","unstructured":"Kozen, D.: Automata on guarded strings and applications. Mat\u00e9matica Contempor\u00e2nea\u00a024, 117\u2013139 (2003)","journal-title":"Mat\u00e9matica Contempor\u00e2nea"},{"key":"8_CR14","unstructured":"Kozen, D.: On the coalgebraic theory of Kleene algebra with tests. Tech. Rep.\u00a0 Cornell University (May 2008), http:\/\/hdl.handle.net\/1813\/10173"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-63172-0_43","volume-title":"Computer Science Logic","author":"D. Kozen","year":"1997","unstructured":"Kozen, D., Smith, F.: Kleene algebra with tests: Completeness and decidability. In: van Dalen, D., Bezem, M. (eds.) CSL 1996. LNCS, vol.\u00a01258, pp. 244\u2013259. Springer, Heidelberg (1997)"},{"key":"8_CR16","first-page":"51","volume":"5","author":"B.G. Mirkin","year":"1966","unstructured":"Mirkin, B.G.: An algorithm for constructing a base in a language of regular expressions. Engineering Cybernetics\u00a05, 51\u201357 (1966)","journal-title":"Engineering Cybernetics"},{"key":"8_CR17","unstructured":"Pereira, D.: Towards Certified Program Logics for the Verification of Imperative Programs. Ph.D. thesis, University of Porto (2013)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Pous, D.: Kleene algebra with tests and Coq tools for While programs. CoRR abs\/1302.1737 (2013)","DOI":"10.1007\/978-3-642-39634-2_15"},{"issue":"2","key":"8_CR19","first-page":"367","volume":"22","author":"A. Silva","year":"2012","unstructured":"Silva, A.: Position automata for Kleene algebra with tests. Sci. Ann. Comp. Sci.\u00a022(2), 367\u2013394 (2012)","journal-title":"Sci. Ann. Comp. Sci."},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Veanes, M., de Halleux, P., Tillmann, N.: Rex: Symbolic regular expression explorer. In: 3rd Inter. Conference on Software Testing, Verification and Validation, ICST 2010, Paris, France, April 7-9, pp. 498\u2013507. IEEE Computer Society (2010)","DOI":"10.1109\/ICST.2010.15"}],"container-title":["Lecture Notes in Computer Science","Language, Life, Limits"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08019-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T07:05:08Z","timestamp":1746255908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08019-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080185","9783319080192"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08019-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}