On the complexity of free monoid morphisms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1533 LNCS, Issue , 1998, Pages 247-255

  Lange, Klaus Jörn ^a   McKenzie, Pierre ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

FINITE SET; FREE MONOIDS; MORPHISMS; SUB-PROBLEMS;

ARTIFICIAL INTELLIGENCE;

EID: 84867453474     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49381-6_27     Document Type: Conference Paper

References (17)

1. E. Allender, V. Arvind, and M. Mahajan, Arithmetic Complexity, Kleene Closure, and Formal Power Series, DIMACS TechṘep. 97-61, September 1997.
2. 2 n/ log log n), Proc. of the 7th ISAAC, Springer LNCS vol. 1178, pp. 193-202, 1996.
3. 1. J. Comput. System Sci., 38:150-164, 1987.
4. 1. Journal of Computer and System Sciences, 41:274-306, 1990.
5. 1, J. of the ACM, 35(4):941-952, 1988.
6. S. Eilenberg, Automata, Languages and Machines, Academic Press, Vol. B, (1976).
7. P. Flajolet and J. Steyaert, Complexity of classes of languages and operators, Rap. de Recherche 92 de l'IRIA Laboria, novembre 1974.
8. B. Jenner, Knapsack problems for NL, Information Processing Letters 54 (1995), pp. 169-174.
9. N. Jones. Space-bounded reducibility among combinatorial problems. Journal of Computer and System Sciences, 11:68-85, 1975.
10. J. Håstad, Computational Limitations for Small-Depth Circuits, PhD Thesis, M.I.T., ACM Doctoral Dissertation Awards, MIT Press (1987).
11. T. Harju and J. Karhumäki, Morphisms, in Handbook of Formal Languages, ed. G. Rozenberg and A. Salomaa, Springer, 1997.
12. K.-J. Lange, An unambiguous class possessing a complete set, Proc. 14th Annual Symp. on Theoret. Aspects of Computer Science, Springer LNCS vol. 1200, pp. 339-350, 1997.
13. 1: The Automata-Theoretic Viewpoint, Computational Complexity 1:330-359, 1991.
14. K. Reinhardt and E. Allender, Making nondeterminism unambiguous, Proc. of the 38th IEEE FOCS, pp. 244-253, 1997.
15. W. Rytter, The space complexity of the unique decipherability problem, Information Processing Letters 23 (1986), pp. 1-3.
16. M. Schützenberger, On finite monoids having only trivial subgroups, Information and Control 8, 190-194, 1965.
17. H. Straubing, Finite automata, formal logic, and circuit complexity, Birkhäuser, Boston, 1994.