Abstract
We consider the decidability of existence of solutions to language equations involving the operations of shuffle and deletion along trajectories. These operations generalize the operations of catenation, insertion, shuffle, quotient, sequential and scattered deletion, as well as many others. Our results are constructive in the sense that if a solution exists, it can be effectively represented. We show both positive and negative decidability results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Câmpeanu, C., Salomaa, K., Vágvölgyi, S.: Shuffle decompositions of regular languages. Int. J. Found. Comp. Sci. 13, 799–816 (2002)
Daley, M., Ibarra, O., Kari, L.: Closure and decidability properties of some language classes with respect to ciliate bio-operations. Theor. Comp. Sci. 306, 19–38 (2003)
Domaratzki, M.: Deletion along trajectories. Theor. Comp. Sci. 320, 293–313 (2004)
Ginsburg, S., Spanier, E.: Bounded regular sets. Proc. Amer. Math. Soc. 17, 1043–1049 (1966)
Hunt, H., Rosenkrantz, D.: Computational parallels between the regular and context-free languages. SIAM J. Comput. 7, 99–114 (1978)
Ito, M.: Shuffle decomposition of regular languages. J. Univ. Comp. Sci. 8, 257–259 (2002)
Kari, L.: On language equations with invertible operations. Theor. Comp. Sci. 132, 129–150 (1994)
Kari, L.: Deletion operations: Closure properties. Intl. J. Comp. Math. 52, 23–42 (1994)
Kari, L., Sosík, P.: Language deletions on trajectories. Technical Report 606, Computer Science Department, University of Western Ontario (2003) (Submitted for publication)
Kari, L., Thierrin, G.: k-catenation and applications: k-prefix codes. J. Inf. Opt. Sci. 16, 263–276 (1995)
Kari, L., Thierrin, G.: Maximal and minimal solutions to language equations. J. Comp. Sys. Sci. 53, 487–496 (1996)
Leiss, E.: Language Equations. Monographs in Computer Science. Springer, Heidelberg (1999)
Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: Syntactic constraints. Theor. Comp. Sci. 197, 1–56 (1998)
Meduna, A.: Middle quotients of linear languages. Intl. J. Comp. Math. 71, 319–335 (1999)
Salomaa, A., Yu, S.: On the decomposition of finite languages. In: Rozenberg, G., Thomas, W. (eds.) Developments in Language Theory, pp. 22–31 (1999)
Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. I, pp. 41–110. Springer, Heidelberg (1997)
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
Domaratzki, M., Salomaa, K. (2004). Decidability of Trajectory-Based Equations. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds) Mathematical Foundations of Computer Science 2004. MFCS 2004. Lecture Notes in Computer Science, vol 3153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28629-5_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-28629-5_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22823-3
Online ISBN: 978-3-540-28629-5
eBook Packages: Springer Book Archive