Abstract
Geometrical languages generalize languages introduced to model temporal validation of real-time softwares. We prove that it is decidable whether a regular language is geometrical. This result was previously known for binary languages.
This work is supported by the French National Agency (ANR) through ”Programme d’Investissements d’Avenir” (Project ACRONYME n°ANR-10-LABX-58).
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
Benois, M., Sakarovitch, J.: On the complexity of some extended word problems defined by cancellation rules. Inform. Process. Lett. 23, 281–287 (1986)
Blanpain, B., Champarnaud, J.-M., Dubernard, J.-P.: Geometrical languages. In: LATA (Languages and Automata Theoretical Aspects), vol. Pre-proceedings, Report 35/07 of GRLMC Universitat Rovira I Virgili, pp. 127–138 (2007)
Champarnaud, J.-M., Dubernard, J.-P., Guingne, F., Jeanne, H.: Geometrical Regular Languages and Linear Diophantine Equations. In: Holzer, M. (ed.) DCFS 2011. LNCS, vol. 6808, pp. 107–120. Springer, Heidelberg (2011)
Champarnaud, J.-M., Dubernard, J.-P., Jeanne, H.: An efficient algorithm to test whether a binary and prolongeable regular language is geometrical. Int. J. Found. Comput. Sci. 20, 763–774 (2009)
Champarnaud, J.-M., Dubernard, J.-P., Jeanne, H.: Geometricity of Binary Regular Languages. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 178–189. Springer, Heidelberg (2010)
Eilenberg, S., Schützenberger, M.P.: Rational sets in commutative monoids. J. Algebra 13, 173–191 (1969)
Fischer, M.J., Rabin, M.O.: Super-exponential complexity of Presburger arithmetic. In: Complexity of computation (Proc. SIAM-AMS Sympos., New York, 1973). SIAM–AMS Proc., vol. VII, pp. 27–41. Amer. Math. Soc., Providence (1974)
Geniet, D., Largeteau, G.: WCET free time analysis of hard real-time systems on multiprocessors: a regular language-based model. Theoret. Comput. Sci. 388, 26–52 (2007)
Ginsburg, S., Spanier, E.H.: Bounded ALGOL-like languages. Trans. Amer. Math. Soc. 113, 333–368 (1964)
Golomb, S.W.: Polyominoes, 2nd edn. Princeton University Press, Princeton (1994); Puzzles, patterns, problems, and packings, With diagrams by Warren Lushbaugh, With an appendix by Andy Liu
Huynh, T.-D.: The Complexity of Semilinear Sets. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 324–337. Springer, Heidelberg (1980)
Reutenauer, C.: Aspects mathématiques des réseaux de Petri, Collection Études et Recherches en Informatique, Masson, Paris, ch. 3 (1989)
Sakarovitch, J.: Éléments de théorie des automates, Vuibert (2003)
Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)
von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, Cambridge (2003); 1st edn. (1999)
von zur Gathen, J., Sieveking, M.: A bound on solutions of linear integer equalities and inequalities. In: Proceedings of the American Mathematical Society, vol. 72, pp. 155–158 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Béal, MP., Champarnaud, JM., Dubernard, JP., Jeanne, H., Lombardy, S. (2012). Decidability of Geometricity of Regular Languages. In: Yen, HC., Ibarra, O.H. (eds) Developments in Language Theory. DLT 2012. Lecture Notes in Computer Science, vol 7410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31653-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-31653-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31652-4
Online ISBN: 978-3-642-31653-1
eBook Packages: Computer ScienceComputer Science (R0)