Abstract
A survey of applications of factorization forests.
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
Abdulla, P.A., Krcal, P., Yi, W.: R-automata. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 67–81. Springer, Heidelberg (2008)
Bojańczyk, M.: The common fragment of ACTL and LTL. In: Foundations of Software Science and Computation Structures, pp. 172–185 (2008)
Bojańczyk, M., Colcombet, T.: Omega-regular expressions with bounds. In: Logic in Computer Science, pp. 285–296 (2006)
Bojanczyk, M., Parys, P.: XPath evaluation in linear time. In: PODS, pp. 241–250 (2008)
Colcombet, T.: A combinatorial theorem for trees. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 901–912. Springer, Heidelberg (2007)
Colcombet, T.: Factorisation forests for infinite words. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 226–237. Springer, Heidelberg (2007)
Eggan, L.C.: Transition graphs and the star height of regular events. Michigan Math. J. 10, 385–397 (1963)
Hashiguchi, K.: Limitedness theorem on finite automata with distance functions. Journal of Computer and System Sciences 24, 233–244 (1982)
Hashiguchi, K.: Algorithms for determining relative star height and star height. Inf. Comput. 78(2), 124–169 (1988)
Kirsten, D.: Distance desert automata and the star height problem. Theoretical Informatics and Applications 39(3), 455–511 (2005)
Kirsten, D., Lombardy, S.: Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata. In: STACS 2009 Proceedings, pp. 589–600 (2009)
Kufleitner, M.: The height of factorization forests. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 443–454. Springer, Heidelberg (2008)
Leung, H.: The topological approach to the limitedness problem on distance automata. In: Idempotency, pp. 88–111 (1998)
McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)
Pin, J.-É., Weil, P.: Polynomial closure and unambiguous product. Theory Comput. Systems 30, 1–30 (1997)
Schützenberger, M.P.: On finite monoids having only trivial subgroups. Information and Control 8, 190–194 (1965)
Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33. Springer, Heidelberg (1975)
Simon, I.: Factorization forests of finite height. Theoretical Computer Science 72, 65–94 (1990)
Simon, I.: On semigroups of matrices over the tropical semiring. ITA 28(3-4), 277–294 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bojańczyk, M. (2009). Factorization Forests. In: Diekert, V., Nowotka, D. (eds) Developments in Language Theory. DLT 2009. Lecture Notes in Computer Science, vol 5583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02737-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-02737-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02736-9
Online ISBN: 978-3-642-02737-6
eBook Packages: Computer ScienceComputer Science (R0)