An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages-Reference-Cited by-同舟云学术

An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages

Published:1981 Issue: Volume: Page:205-215
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bertoni A.,Brambilla M.,Mauri G.,Sabadini N.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-10856-4_86.pdf

Reference13 articles.

1. Berstel, J., Sur la densité asymptotique de languages formels, in "Automata, Languages and Programming" (M. Nivat ed.), North Holland, Amsterdam, 1973, pp. 345–358

2. Bertoni, A., Mathematical methods of the theory of stochastic automata, Lect. Not. in Comp. Sci. 28, Springer, Berlin, 1974, pp.9–23

3. Chomsky, N., Schuetzenberger, P., The algebraic theory of context-free languages, in "Computer Programming and Formal Systems", North Holland, Amsterdam, 1963

4. Furtek, F., A new approach to Petri nets, MIT Computation Structures Group Memo 123, 1975

5. Lect. Not. in Comp. Sci.;E. Knuth,1978

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

1. Trace monoids with idempotent generators and measure-only quantum automata;Natural Computing;2009-10-04

2. Characterizations of the decidability of some problems for regular trace languages;Mathematical Systems Theory;1989-12

3. Basic notions of trace theory;Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency;1989

4. Some applications and techniques for generating functions;TAPSOFT '89;1989

5. Theory of traces;Theoretical Computer Science;1988-03