Abstract
In this work, we investigate computational complexity of the solution existence problem for language equations and language constraints. More accurately, we study constraints between regular terms over alphabet consisting of constants and variables and based on regular operators such as concatenation (·), sum (+), Kleene-star (*). We obtain complexity results concerning three restricted cases of the constraints: for system of language equations in which one side does not contain any occurrences of variables in case arbitrary solutions and with restriction to finite languages; for constraint in form L ⊆ R, where R has no occurrences of variables.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Anselmo, M.: A non-ambiguous decomposition of regular languages and facorizing codes. Discrete Applied Mathematics 126, 129–165 (2003)
Baader, F., Küsters, R.: Unification in a Description Logic with Transitive Closure of Roles. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 217–232. Springer, Heidelberg (2001)
Baader, F., Narendran, P.: Unification of Concept Terms in Description Logics. J. Symbolic Computation 31(3), 277–305 (2001)
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. 15, pp. 384–390 (1981); also SIAM J. Comput. 14(4), 935–942 (1985)
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)
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 12, 222–268 (1976)
Kari, L.: On language equations with invertible operations. Theoretical Computer Science 132(1-2), 129–150 (1994)
Leiss, E.L.: Language Equations Over a One-Letter Alphabet with Union, Concatenation and Star: A Complete Solution. Theoretical Computer Science 131(2), 311–330 (1994)
Leiss, E.L.: Implicit Language Equations: Existence and Uniqueness of Solutions. Theoretical Computer Science 145(1-2), 71–93 (1995)
Leiss, E.L.: Solving Systems of Explicit Language Relations. Theoretical Computer Science 186(1-2), 83–105 (1997)
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. 2719, Springer, Heidelberg (2003)
Savitch, W.J.: Relationship between nondeterministic and deterministic tape comoplexities. J. of Computer and System Science 4, 177–192 (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bala, S. (2004). Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open Terms. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_52
Download citation
DOI: https://doi.org/10.1007/978-3-540-24749-4_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21236-2
Online ISBN: 978-3-540-24749-4
eBook Packages: Springer Book Archive