Abstract
We introduce the notion of surminimisation of a finite deterministic automaton; it consists in performing a transition relabelling before executing the minimisation and it produces an automaton smaller than a sole minimisation would. While the classical minimisation process preserves the accepted language, the surminimisation process preserves its underlying ordered tree only. Surminimisation induces on languages and on Abstract Rational Numeration Systems (ARNS) a transformation that we call label reduction. We prove that all positional numeration systems are label-irreducible and that an ARNS and its label reduction are very close, in the sense that converting the integer representations from one system into the other is done by a simple Mealy machine.
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
Berthé, V., Rigo, M.: Odometers on regular languages. Theory Comput. Syst. 40(1), 1–31 (2007)
Cobham, A.: Uniform tag sequences. Math. Systems Theory 6, 164–192 (1972)
Dumont, J.-M., Thomas, A.: Digital sum problems and substitutions on a finite alphabet. Journal of Number Theory 39(3), 351–366 (1991)
Frougny, C., Klouda, K.: Rational base number systems for p-adic numbers. RAIRO - Theor. Inf. and Applic. 46(1), 87–106 (2012)
Frougny, C., Sakarovitch, J.: Number representation and finite automata. In: Berthé, V., Rigo, M. (eds) Combinatorics, Automata and Number Theory. Encyclopedia of Mathematics and its Applications 135, pp. 34–107. Cambridge Univ. Press (2010)
Mealy, G.H.: A method for synthesizing sequential circuits. Bell Syst. Tech. J. 34, 1045–1079 (1955)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)
Lecomte, P., Rigo, M.: Abstract numeration systems. In: Berthé, V., Rigo, M. (eds.) Combinatorics, Automata and Number Theory. Encyclopedia of Mathematics and its Applications 135, pp. 108–162. Cambridge Univ. Press (2010)
Lecomte, P., Rigo, M.: Numeration systems on a regular language. Theory Comput. Syst. 34, 27–44 (2001)
Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press (2002)
Rigo, M., Maes, A.: More on generalized automatic sequences. Journal of Automata, Languages and Combinatorics 7(3), 351–376 (2002)
Sakarovitch, J.: Eléments de théorie des automates. Vuibert, 2003. Corrected English translation: Elements of Automata Theory. Cambridge University Press (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Marsault, V. (2015). Surminimisation of Automata. In: Potapov, I. (eds) Developments in Language Theory. DLT 2015. Lecture Notes in Computer Science(), vol 9168. Springer, Cham. https://doi.org/10.1007/978-3-319-21500-6_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-21500-6_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21499-3
Online ISBN: 978-3-319-21500-6
eBook Packages: Computer ScienceComputer Science (R0)