{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:29:46Z","timestamp":1725564586415},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_52","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T15:01:54Z","timestamp":1283958114000},"page":"596-607","source":"Crossref","is-referenced-by-count":10,"title":["Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open Terms"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Bala","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"52_CR1","series-title":"A Problem Requiring Exponential Time and Space","volume-title":"The Design and Analisys of Computer Algorithms, ch. 11.3","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analisys of Computer Algorithms, ch. 11.3. A Problem Requiring Exponential Time and Space. Addison-Wesley Publishing Company, Reading (1974)"},{"key":"52_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0166-218X(02)00193-2","volume":"126","author":"M. Anselmo","year":"2003","unstructured":"Anselmo, M.: A non-ambiguous decomposition of regular languages and facorizing codes. Discrete Applied Mathematics\u00a0126, 129\u2013165 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"52_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-45653-8_15","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"F. Baader","year":"2001","unstructured":"Baader, F., K\u00fcsters, R.: Unification in a Description Logic with Transitive Closure of Roles. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 217\u2013232. Springer, Heidelberg (2001)"},{"issue":"3","key":"52_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1006\/jsco.2000.0426","volume":"31","author":"F. Baader","year":"2001","unstructured":"Baader, F., Narendran, P.: Unification of Concept Terms in Description Logics. J. Symbolic Computation\u00a031(3), 277\u2013305 (2001)","journal-title":"J. Symbolic Computation"},{"key":"52_CR5","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Halpern, J.Y., Meyer, A.R., Parikh, R.: Equations between Regular Terms and an Application to Process Logic. In: Proc. of STOC 1981, vol.\u00a015, pp. 384\u2013390 (1981); also SIAM J. Comput. 14(4), 935\u2013942 (1985)","DOI":"10.1145\/800076.802493"},{"key":"52_CR6","unstructured":"Hunt III., H.B.: The equivalence problem for regular expressions with intersection is not polynomial in tape, ReportTR73-161. Departament of Computer Science, Cornell University (1973)"},{"key":"52_CR7","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/S0022-0000(76)80038-4","volume":"12","author":"H.B. Hunt III","year":"1976","unstructured":"Hunt III, H.B., Rosenkrantz, D.J., Szymanski, T.G.: On the, Containment, and Covering Problems for the Regular and Context-Free Languages. J. Computer and System Science\u00a012, 222\u2013268 (1976)","journal-title":"J. Computer and System Science"},{"issue":"1-2","key":"52_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(94)90230-5","volume":"132","author":"L. Kari","year":"1994","unstructured":"Kari, L.: On language equations with invertible operations. Theoretical Computer Science\u00a0132(1-2), 129\u2013150 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"52_CR9","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(94)90177-5","volume":"131","author":"E.L. Leiss","year":"1994","unstructured":"Leiss, E.L.: Language Equations Over a One-Letter Alphabet with Union, Concatenation and Star: A Complete Solution. Theoretical Computer Science\u00a0131(2), 311\u2013330 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"52_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(94)00176-J","volume":"145","author":"E.L. Leiss","year":"1995","unstructured":"Leiss, E.L.: Implicit Language Equations: Existence and Uniqueness of Solutions. Theoretical Computer Science\u00a0145(1-2), 71\u201393 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"52_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0304-3975(96)00218-6","volume":"186","author":"E.L. Leiss","year":"1997","unstructured":"Leiss, E.L.: Solving Systems of Explicit Language Relations. Theoretical Computer Science\u00a0186(1-2), 83\u2013105 (1997)","journal-title":"Theoretical Computer Science"},{"key":"52_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45061-0_21","volume-title":"Automata, Languages and Programming","author":"A. Okhotin","year":"2003","unstructured":"Okhotin, A.: Decision problems for language equations with Boolean operations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, Springer, Heidelberg (2003)"},{"key":"52_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W.J. Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationship between nondeterministic and deterministic tape comoplexities. J. of Computer and System Science\u00a04, 177\u2013192 (1970)","journal-title":"J. of Computer and System Science"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T01:32:54Z","timestamp":1559611974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}