Characterizations of the decidability of some problems for regular trace languages-Reference-Cited by-同舟云学术

Characterizations of the decidability of some problems for regular trace languages

Published:1989-12 Issue:1 Volume:22 Page:1-19
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Aalbersberg IJ. J.,Hoogeboom H. J.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF02088289.pdf

Reference33 articles.

1. Technical Report;IJ. J. Aalbersberg,1986

2. Lecture Notes in Computer Science;IJ. J. Aalbersberg,1987

3. Aalbersberg, IJ. J., and Rozenberg, G., Traces, dependency graphs and DNLC grammars,Discrete Appl. Math.,11 (1985), 299–306.

4. Aalbersberg, IJ. J., and Rozenberg, G., Theory of traces,Theoret. Comput. Sci.,60 (1988), 1–82.

5. Aalbersberg, IJ. J., and Welzl, E., Trace languages defined by regular string languages,RAIRO Inform. Théor.,20 (1986), 103–119.

Cited by 35 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Subsets of groups in public-key cryptography;Advances in Mathematics of Communications;2024

2. Membership Problems in Infinite Groups;Lecture Notes in Computer Science;2024

3. The word problem for one-relation monoids: a survey;Semigroup Forum;2021-08-10

4. The emptiness problem for valence automata over graph monoids;Information and Computation;2021-04

5. Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices;Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation;2020-07-20