Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-27T05:38:38.491Z Has data issue: false hasContentIssue false
  • English
  • Français

Distance desert automata and the star height problem

Published online by Cambridge University Press:  15 July 2005

Daniel Kirsten
Daniel Kirsten*
Affiliation:
Dresden University of Technology, Institute of Algebra, 01062 Dresden, Germany; [email protected]
Get access

Abstract

We introduce the notion of nested distance desert automata as a joint generalization of distance automata and desert automata. We show that limitedness of nested distance desert automata is PSPACE-complete. As an application, we show that it is decidable in 22O(n) space whether the language accepted by an n-state non-deterministic automaton is of a star height less than a given integer h (concerning rational expressions with union, concatenation and iteration), which is the first ever complexity bound for the star height problem.

Keywords

Recognizable languagesstar heightdistance automata.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 39 , Issue 3: Foundations of Software Science and Computer Structures (FOSSECAS'04) , July 2005 , pp. 455 - 509
Copyright
© EDP Sciences, 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Regular la, S. Balanguage matching and other decidable cases of the satisfiability problem for constraints between regular open terms, in STACS'04 Proceedings, edited by V. Diekert and M. Habib, Springer-Verlag, Berlin. Lect. Notes Comput. Sci. 2996 (2004) 596–607.
J. Berstel, Transductions and Context-Free Languages. B.G. Teubner, Stuttgart (1979).
Cohen, R.S., Star height of certain families of regular events. J. Comput. Syst. Sci. 4 (1970) 281–297. CrossRef
Culik II, K. and Kari, J., Image compression using weighted finite automata. Computer Graphics 17 (1993) 305–313. CrossRef
Dejean, F. and Schützenberger, M., On a question of Eggan. Inform. Control 9 (1966) 23–25. CrossRef
Eggan, L.C., Transition graphs and the star height of regular events. Michigan Math. J. 10 (1963) 385–397.
S. Eilenberg, Automata, Languages, and Machines, Vol. A. Academic Press, New York (1974).
G. Grahne and A. Thomo, Approximate reasoning in semi-structured databases, in 8th International Workshop on Knowledge Representation meets Databases (KRDB2001), edited by M. Lenzerini et al., CEUR Workshop Proceedings 45 (2001).
P.A. Grillet, Semigroups: An Introduction to the Structure Theory, Marcel Dekker, Inc., New York. Monographs and Textbooks in Pure and Applied Mathematics 193 (1995).
Hashiguchi, K., Limitedness theorem on finite automata with distance functions. J. Comput. Syst. Sci. 24 (1982) 233–244. CrossRef
Hashiguchi, K., Regular languages of star height one. Inform. Control 53 (1982) 199–210. CrossRef
Hashiguchi, K., Representation theorems of regular languages. J. Comput. Syst. Sci. 27 (1983) 101–115. CrossRef
Hashiguchi, K., Algorithms for determining relative star height and star height. Inform. Comput. 78 (1988) 124–169. CrossRef
Hashiguchi, K., Improved limitedness theorems on finite automata with distance functions. Theor. Comput. Sci. 72 (1990) 27–38. CrossRef
Hashiguchi, K., New upper bounds to the limitedness of distance automata, in ICALP'96 Proceedings, edited by F. Meyer auf der Heide and B. Monien, Springer-Verlag, Berlin. Lect. Notes Comput. Sci. 1099 (1996) 324–335. CrossRef
Hashiguchi, K., New upper bounds to the limitedness of distance automata. Theor. Comput. Sci. 233 (2000) 19–32. CrossRef
Hashiguchi, K., Erratum to “New upper bounds to the limitedness of distance automata”. Theor. Comput. Sci. 290 (2003) 2183–2184. CrossRef
Hashiguchi, K. and Honda, N., Homomorphisms that preserve star height. Inform. Control 30 (1976) 247–266. CrossRef
J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory Languages, and Computation. Addison-Wesley, Reading (1979).
F. Katritzke, Refinements of Data Compression using Weighted Finite Automata. Ph.D. Thesis, Universität Siegen (2001).
D. Kirsten, A Burnside approach to the finite substitution problem. Theory Comput. Syst. (to appear).
D. Kirsten, Desert automata and the finite substitution problem, in STACS'04 Proceedings, edited by V. Diekert and M. Habib, Springer-Verlag, Berlin. Lect. Notes Comput. Sci. 2996 (2004). 305–316.
Kirsten, D., Distance desert automata and the star height one problem, in FoSSaCS'04 Proceedings, edited by I. Walukiewicz, Springer-Verlag, Berlin. Lect. Notes Comput. Sci. 2987 (2004) 257–272. CrossRef
Kirsten, D. and Marcinkowski, J., Two techniques in the area of the star problem in trace monoids. Theor. Comput. Sci. 309 (2003) 381–412. CrossRef
Krob, D., The equality problem for rational series with multiplicities in the tropical semiring is undecidable. Internat. J. Algebra Comput. 4 (1994) 405–425. CrossRef
G. Lallement, Semigroups and Combinatorial Applications. John Wiley & Sons, New York (1979).
H. Leung, An Algebraic Method for Solving Decision Problems in Finite Automata Theory. Ph.D. Thesis, Pennsylvania State University, Department of Computer Science (1987).
Leung, H., On the topological structure of a finitely generated semigroup of matrices. Semigroup Forum 37 (1988) 273–287. CrossRef
Leung, H., Limitedness theorem on finite automata with distance functions: An algebraic proof. Theor. Comput. Sci. 81 (1991) 137–145. CrossRef
H. Leung, On some decision problems in finite automata, in Monoids and Semigroups with Applications, edited by J. Rhodes, World Scientific, Singapore (1991) 509–526.
Leung, H., On finite automata with limited nondeterminism. Acta Inform. 35 (1998) 595–624. CrossRef
H. Leung, The topological approach to the limitedness problem on distance automata, in Idempotency, edited by J. Gunawardena, Cambridge University Press (1998) 88–111.
Leung, H. and Podolskiy, V., The limitedness problem on distance automata: Hashiguchi's method revisited. Theor. Comput. Sci. 310 (2004) 147–158. CrossRef
S. Lombardy, Approche structurelle de quelques problèmes de la théorie des automates. Ph.D. Thesis, École nationale supérieure des télécommunications, Paris (2001).
S. Lombardy and J. Sakarovitch, On the star height of rational languages. A new proof for two old results, in Proc. of the 3rd Int. Conf. on Languages, Words and Combinatorics, Kyoto'00 edited by M. Ito, World Scientific (2000).
Lombardy, S. and Sakarovitch, J., Star height of reversible languages and universal automata, in LATIN'02 Proceedings, Springer-Verlag, Berlin. Lect. Notes Comput. Sci. 2286 (2002) 76–89. CrossRef
Y. Métivier and G. Richomme. New results on the star problem in trace monoids. Inform. Comput. 119 (1995) 240–251.
Mohri, M., Finite-state transducers in language and speech processing. Comput. Linguistics 23 (1997) 269–311.
Montalbano, R. and Restivo, A., On the star height of rational languages. Internat. J. Algebra Comput. 4 (1994) 427–441. CrossRef
D. Perrin, Finite automata, in Handbook of Theoretical Computer Science, edited by J. van Leeuwen, Elsevier Science Publishers B (1990) 1–57.
J.-É. Pin, Varieties of Formal Languages. North Oxford Academic Publishers Ltd (1986).
J.-É. Pin, Rational and recognizable langages, in Lect. Appl. Math. Inform. edited by Ricciardi, Manchester University Press (1990) 62–106.
J.-É. Pin, Finite semigroups and recognizable languages: An introduction, in NATO Advanced Study Institute, Semigroups, Formal Languages and Groups, edited by J. Fountain, Kluwer Academic Publishers (1995) 1–32.
J.-É. Pin, Syntactic semigroups, in Handbook of Formal Languages, Vol. 1, Word, Language, Grammar, edited by G. Rozenberg and A. Salomaa, Springer-Verlag, Berlin (1997) 679–746.
J.-É. Pin, Tropical semirings, in Idempotency, edited by J. Gunawardena, Cambridge University Press (1998) 50–69.
I. Simon, Limited subsets of a free monoid, in Proc. of the 19th IEEE Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Long Beach, CA (1978) 143–150.
Simon, I., Recognizable sets with multiplicities in the tropical semiring, in MFCS'88 Proceedings, edited by M.P. Chytil et al., Springer-Verlag, Berlin. Lect. Notes Comput. Sci. 324 (1988) 107–120. CrossRef
I. Simon, The nondeterministic complexity of a finite automaton, in Mots - mélanges offerts à M.P. Schützenberger, edited by M. Lothaire, Hermes (1990) 384–400.
Simon, I., On semigroups of matrices over the tropical semiring. RAIRO-Inf. Theor. Appl. 28 (1994) 277–294. CrossRef
Weber, A., Distance automata having large finite distance or finite ambiguity. Math. Syst. Theor. 26 (1993) 169–185. CrossRef
Weber, A., Finite valued distance automata. Theor. Comput. Sci. 134 (1994) 225–251. CrossRef
S. Yu, Regular Languages, in Handbook of Formal Languages, Vol. 1, Word, Language, Grammar, edited by G. Rozenberg and A. Salomaa, Springer-Verlag, Berlin (1997) 41–110.