{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T09:45:28Z","timestamp":1764841528434},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287025"},{"type":"electronic","value":"9783540318675"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549345_61","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:05:47Z","timestamp":1127829947000},"page":"708-719","source":"Crossref","is-referenced-by-count":7,"title":["Strict Language Inequalities and Their Decision Problems"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"61_CR1","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 logic. Journal of Symbolic Computation\u00a031, 277\u2013305 (2001)","journal-title":"Journal of Symbolic Computation"},{"key":"61_CR2","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)"},{"key":"61_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0304-3975(80)90069-9","volume":"10","author":"J.A. Brzozowski","year":"1980","unstructured":"Brzozowski, J.A., Leiss, E.L.: On equations for regular languages, finite automata, and sequential networks. Theoretical Computer Science\u00a010, 19\u201335 (1980)","journal-title":"Theoretical Computer Science"},{"key":"61_CR4","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, Boca Raton (1971)"},{"key":"61_CR5","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/321127.321132","volume":"9","author":"S. Ginsburg","year":"1962","unstructured":"Ginsburg, S., Rice, H.G.: Two families of languages related to ALGOL. Journal of the ACM\u00a09, 350\u2013371 (1962)","journal-title":"Journal of the ACM"},{"key":"61_CR6","first-page":"42","volume-title":"Proceedings of Symposia in Applied Mathematics","author":"J. Hartmanis","year":"1967","unstructured":"Hartmanis, J.: Context-free languages and Turing machine computations. In: Proceedings of Symposia in Applied Mathematics, vol.\u00a019, pp. 42\u201351. AMS, Providence (1967)"},{"key":"61_CR7","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1142\/9789812562494_0060","volume-title":"Current Trends in Theoretical Computer Science: The Challenge of the New Century","author":"J. Karhum\u00e4ki","year":"2004","unstructured":"Karhum\u00e4ki, J., Petre, I.: Two problems on commutation of languages. In: P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science: The Challenge of the New Century, vol.\u00a02, pp. 477\u2013494. World Scientific, Singapore (2004)"},{"key":"61_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1007\/978-3-540-27836-8_73","volume-title":"Automata, Languages and Programming","author":"M. Kunc","year":"2004","unstructured":"Kunc, M.: Regular solutions of language inequalities and well quasi-orders. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 870\u2013881. Springer, Heidelberg (2004)"},{"key":"61_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-540-31856-9_47","volume-title":"STACS 2005","author":"M. Kunc","year":"2005","unstructured":"Kunc, M.: The power of commuting with finite sets of words. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 569\u2013580. Springer, Heidelberg (2005)"},{"key":"61_CR10","doi-asserted-by":"crossref","unstructured":"Kunc, M.: Largest solutions of left-linear language inequalities. In: AFL 2005 (2005)","DOI":"10.1007\/11505877_29"},{"key":"61_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1023\/A:1020213411126","volume":"28","author":"A. Okhotin","year":"2002","unstructured":"Okhotin, A.: Conjunctive grammars and systems of language equations. Programming and Computer Software\u00a028, 243\u2013249 (2002)","journal-title":"Programming and Computer Software"},{"key":"61_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","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, pp. 239\u2013251. Springer, Heidelberg (2003)"},{"issue":"1","key":"61_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ic.2004.03.006","volume":"194","author":"A. Okhotin","year":"2004","unstructured":"Okhotin, A.: Boolean grammars. Information and Computation\u00a0194(1), 19\u201348 (2004)","journal-title":"Information and Computation"},{"key":"61_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1007\/978-3-540-28629-5_54","volume-title":"Mathematical Foundations of Computer Science 2004","author":"A. Okhotin","year":"2004","unstructured":"Okhotin, A.: The dual of concatenation. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 698\u2013710. Springer, Heidelberg (2004)"},{"key":"61_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-31834-7_24","volume-title":"Machines, Computations, and Universality","author":"A. Okhotin","year":"2005","unstructured":"Okhotin, A.: On computational universality in language equations. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol.\u00a03354, pp. 292\u2013303. Springer, Heidelberg (2005)"},{"key":"61_CR16","unstructured":"Okhotin, A.: A characterization of the arithmetical hierarchy by language equations. In: DCFS 2004, London, Ontario, Canada, pp. 225\u2013237."},{"key":"61_CR17","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1967","unstructured":"Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)"},{"key":"61_CR18","volume-title":"Theory of Automata","author":"A. Salomaa","year":"1969","unstructured":"Salomaa, A.: Theory of Automata. Pergamon Press, Oxford (1969)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549345_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:41:21Z","timestamp":1605642081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549345_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287025","9783540318675"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11549345_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}