Author of the publication

Efficient Computation of Throughput Values of Context-Free Languages.

, , , and . CIAA, volume 4783 of Lecture Notes in Computer Science, page 203-213. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Linear-Time Prime Decomposition Of Regular Prefix Codes., , , and . Int. J. Found. Comput. Sci., 14 (6): 1019-1032 (2003)Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice., , , and . CIAA, volume 4094 of Lecture Notes in Computer Science, page 90-101. Springer, (2006)Finding dominators via disjoint set union., , , and . J. Discrete Algorithms, (2013)Prime Decompositions of Regular Prefix Codes., , , and . CIAA, volume 2608 of Lecture Notes in Computer Science, page 85-94. Springer, (2002)Efficient Computation of Throughput Values of Context-Free Languages., , , and . CIAA, volume 4783 of Lecture Notes in Computer Science, page 203-213. Springer, (2007)A Non-SOS Operational Semantics for a Process Algebra., and . Inf. Process. Lett., 68 (1): 47-54 (1998)Dynamic Task Communication for Concurrent Processing in Distributed Systems., and . Concurrent Engineering: R&A, 9 (2): 155-165 (2001)Equivalence of simple functions., , , and . Theor. Comput. Sci., 376 (1-2): 42-51 (2007)Prime Normal Form and Equivalence of Simple Grammars., , , and . CIAA, volume 3845 of Lecture Notes in Computer Science, page 78-89. Springer, (2005)An M-net Semantics of B(PN)2., , , , , and . STRICT, page 85-100. Springer, (1995)