Compressed word problems for inverse monoids

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

Volumn 6907 LNCS, Issue , 2011, Pages 448-459

  Lohrey, Markus ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE SET; IDEMPOTENTS; INVERSE MONOIDS; LOGSPACE; POLYNOMIAL-TIME HIERARCHY; RATIONAL SUBSETS; STRAIGHT LINE PROGRAM; STRING COMPRESSION; WORD PROBLEM;

ALGEBRA; COMPUTER SCIENCE; POLYNOMIAL APPROXIMATION;

INVERSE PROBLEMS;

EID: 80052113609     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22993-0_41     Document Type: Conference Paper

References (22)

1. Berman, P., Karpinski, M., Larmore, L.L., Plandowski, W., Rytter, W.: On the complexity Of pattern matching for highly compressed two-dimensional texts. J. Comput. Syst. Sci. 65(2), 332-350 (2002)
2. Diekert, V., Lohrey, M., Miller, A.: Partially commutative inverse monoids. Semigroup Forum 77(2), 196-226 (2008)
3. Lawson, M.V.: Inverse Semigroups: The Theory of Partial Symmetries. World Scientific, Singapore (1999)
4. Lifshits, Y.: Processing compressed texts: A tractability border. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 228-240. Springer, Heidelberg (2007)
5. Lipton, R.J., Zalcstein, Y.: Word problems solvable in logspace. J. Assoc. Comput. Mach. 24(3), 522-526 (1977)
6. Lohrey, M.: On the parallel complexity of tree automata. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol. 2051, pp. 201-215. Springer, Heidelberg (2001)
7. Lohrey,M.:Word problems and membership problems on compressed words. SIAMJ. Comput. 35(5), 1210-1240 (2006)
8. Lohrey, M.: Leaf languages and string compression. Inf. Comput. 209(6), 951-965 (2011)
9. Lohrey, M.: Compressed word problems for inverse monoids., http://arxiv.org/abs/1106.1000
10. Lohrey, M., Ondrusch, N.: Inverse monoids: Decidability and complexity of algebraic questions. Inf. Comput. 205(8), 1212-1234 (2007)
11. Lohrey, M., Schleimer, S.: Efficient computation in groups via compression. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds.) CSR 2007. LNCS, vol. 4649, pp. 249-258. Springer, Heidelberg (2007) (Pubitemid 350271274)
12. Lohrey, M., Steinberg, B.: Tilings and submonoids of metabelian groups. Theory Comput. Syst. 48(2), 411-427 (2011)
13. Macdonald, J.: Compressed words and automorphisms in fully residually free groups. Internat. J. Algebra Comput. 20(3), 343-355 (2010)
14. Margolis, S., Meakin, J.: Inverse monoids, trees, and context-free languages. Trans. Amer. Math. Soc. 335(1), 259-276 (1993)
15. Margolis, S., Meakin, J., Sapir, M.: Algorithmic problems in groups, semigroups and inverse semigroups. In: Fountain, J. (ed.) Semigroups, Formal Languages and Groups, pp. 147-214. Kluwer Academic Publishers, Dordrecht (1995)
16. Munn, W.: Free inverse semigroups. Proc.London Math. Soc. 30, 385-404 (1974)
17. Plandowski, W.: Testing equivalence of morphisms on context-free languages. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 460-470. Springer, Heidelberg (1994)
18. Plandowski, W., Rytter, W.: Complexity of language recognition problems for compressed words. In: Karhumäki, J., Maurer, H.A., Paun, G., Rozenberg, G. (eds.) Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pp. 262-272. Springer, Heidelberg (1999)
19. Rozenblat, B.V.: Diophantine theories of free inverse semigroups. Sib. Math. J. 26, 860-865 (1985); English translation
20. Schleimer, S.: Polynomial-time word problems. Comment. Math. Helv. 83, 741-765 (2008)
21. Silva, P.V.: Rational languages and inverse monoid presentations. Internat. J. Algebra Comput. 2, 187-207 (1992)
22. Stephen, J.: Presentations of inverse monoids. J. Pure Appl. Algebra 63, 81-112 (1990)