{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T11:04:45Z","timestamp":1768907085991,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642333859","type":"print"},{"value":"9783642333866","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33386-6_4","type":"book-chapter","created":{"date-parts":[[2012,9,28]],"date-time":"2012-09-28T10:58:20Z","timestamp":1348829900000},"page":"27-41","source":"Crossref","is-referenced-by-count":3,"title":["Approximating Deterministic Lattice Automata"],"prefix":"10.1007","author":[{"given":"Shulamit","family":"Halamish","sequence":"first","affiliation":[]},{"given":"Orna","family":"Kupferman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-540-70545-1_23","volume-title":"Computer Aided Verification","author":"R. Alur","year":"2008","unstructured":"Alur, R., Kanade, A., Weiss, G.: Ranking Automata and Games for Prioritized Requirements. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 240\u2013253. Springer, Heidelberg (2008)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-24372-1_16","volume-title":"Automated Technology for Verification and Analysis","author":"B. Aminof","year":"2011","unstructured":"Aminof, B., Kupferman, O., Lampert, R.: Formal Analysis of Online Algorithms. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol.\u00a06996, pp. 213\u2013227. Springer, Heidelberg (2011)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-48683-6_25","volume-title":"Computer Aided Verification","author":"G. Bruns","year":"1999","unstructured":"Bruns, G., Godefroid, P.: Model Checking Partial State Spaces with 3-Valued Temporal Logics. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 274\u2013287. Springer, Heidelberg (1999)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Bruns, G., Godefroid, P.: Temporal logic query checking. In: Proc.16th LICS, pp. 409\u2013420 (2001)","DOI":"10.1109\/LICS.2001.932516"},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s00453-001-0026-6","volume":"30","author":"A.L. Buchsbaum","year":"2001","unstructured":"Buchsbaum, A.L., Giancarlo, R., Westbrook, J.: An approximate determinization algorithm for weighted finite-state automata. Algorithmica\u00a030(4), 503\u2013526 (2001)","journal-title":"Algorithmica"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/10722167_34","volume-title":"Computer Aided Verification","author":"W. Chan","year":"2000","unstructured":"Chan, W.: Temporal-logic Queries. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 450\u2013463. Springer, Heidelberg (2000)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-45139-0_3","volume-title":"Model Checking Software","author":"M. Chechik","year":"2001","unstructured":"Chechik, M., Devereux, B., Gurfinkel, A.: Model-Checking Infinite State-Space Systems with Fine-Grained Abstractions Using SPIN. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol.\u00a02057, pp. 16\u201336. Springer, Heidelberg (2001)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Easterbrook, S., Chechik, M.: A framework for multi-valued reasoning over inconsistent viewpoints. In: Proc. 23rd CSE, pp. 411\u2013420 (2001)","DOI":"10.1109\/ICSE.2001.919114"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","first-page":"219","volume-title":"Algorithms, Concurrency and Knowledge","author":"G. Eisman","year":"1995","unstructured":"Eisman, G., Ravikumar, B.: Approximate Recognition of Non-regular Languages by Finite Automata. In: Kanchanasut, K., Levy, J.-J. (eds.) ACSC 1995. LNCS, vol.\u00a01023, pp. 219\u2013228. Springer, Heidelberg (1995)"},{"key":"4_CR11","unstructured":"Feige, U., Karpinski, M., Langberg, M.: A note on approximating max-bisection on regular graphs. ECCC\u00a07(43) (2000)"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E. Mark Gold","year":"1978","unstructured":"Mark Gold, E.: Complexity of automaton identification from given data. Information and Control\u00a037(3), 302\u2013320 (1978)","journal-title":"Information and Control"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-19805-2_14","volume-title":"Foundations of Software Science and Computational Structures","author":"S. Halamish","year":"2011","unstructured":"Halamish, S., Kupferman, O.: Minimizing Deterministic Lattice Automata. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 199\u2013213. Springer, Heidelberg (2011)"},{"key":"4_CR14","unstructured":"Hussain, A., Huth, M.: On model checking multiple hybrid views. Technical Report TR-2004-6, University of Cyprus (2004)"},{"key":"4_CR15","first-page":"935","volume":"17","author":"N. Immerman","year":"1988","unstructured":"Immerman, N.: Nondeterministic space is closed under complement. Information and Computation\u00a017, 935\u2013938 (1988)","journal-title":"Information and Computation"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-69738-1_14","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"O. Kupferman","year":"2007","unstructured":"Kupferman, O., Lustig, Y.: Lattice Automata. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol.\u00a04349, pp. 199\u2013213. Springer, Heidelberg (2007)"},{"key":"4_CR17","unstructured":"Larsen, K.G., Thomsen, G.B.: A modal process logic. In: Proc. 3rd LICS (1988)"},{"issue":"2","key":"4_CR18","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics\u00a023(2), 269\u2013311 (1997)","journal-title":"Computational Linguistics"},{"key":"4_CR19","unstructured":"Myhill, J.: Finite automata and the representation of events. Technical Report WADD TR-57-624, pp. 112\u2013137. Wright Patterson AFB, Ohio (1957)"},{"issue":"4","key":"4_CR20","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A. Nerode","year":"1958","unstructured":"Nerode, A.: Linear automaton transformations. Proceedings of the American Mathematical Society\u00a09(4), 541\u2013544 (1958)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/138027.138042","volume":"40","author":"L. Pitt","year":"1993","unstructured":"Pitt, L., Warmuth, M.K.: The minimum consistent DFA problem cannot be approximated within any polynomial. Journal of the ACM\u00a040, 95\u2013142 (1993)","journal-title":"Journal of the ACM"},{"key":"4_CR22","unstructured":"ESF\u00a0Network programme. Automata: from mathematics to applications (AutoMathA) (2010), http:\/\/www.esf.org\/index.php?id=1789"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-63166-6_10","volume-title":"Computer Aided Verification","author":"S. Graf","year":"1997","unstructured":"Graf, S., Saidi, H.: Construction of Abstract State Graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 72\u201383. Springer, Heidelberg (1997)"},{"issue":"1","key":"4_CR24","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1142\/S0129054108005619","volume":"19","author":"B.W. Watson","year":"2008","unstructured":"Watson, B.W., Kourie, D.G., Strauss, T., Ngassam, E.K., Cleophas, L.G.: Efficient automata constructions and approximate automata. Int. J. Found. Comput. Sci.\u00a019(1), 185\u2013193 (2008)","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33386-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T18:10:48Z","timestamp":1744222248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33386-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642333859","9783642333866"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33386-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}