PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Lasota, Slawomir"

Author of the publication

copydeleteadd this publication to your clipboard
Simulation Problems Over One-Counter Nets.

, , , and . Logical Methods in Computer Science, (2016)

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.

No persons found for author name Lasota, Slawomir
add a person with the name Lasota, Slawomir
 

Other publications of authors with the same name

Regular Separability of Well Structured Transition Systems., and . CoRR, (2017)Analyzing Stationary States of Gene Regulatory Network Using Petri Nets., , and . In Silico Biology, 6 (1-2): 93-109 (2006)Regular Separability of One Counter Automata., and . Logical Methods in Computer Science, (2019)Non-interleaving bisimulation equivalences on Basic Parallel Processes., , , and . Inf. Comput., 208 (1): 42-62 (2010)Partially-commutative context-free processes: Expressibility and tractability., , and . Inf. Comput., 209 (5): 782-798 (2011)On Subset Seeds for Protein Alignment., , , , , , and . IEEE/ACM Trans. Comput. Biology Bioinform., 6 (3): 483-494 (2009)Regular Separability of Well-Structured Transition Systems., , , , , and . CONCUR, volume 118 of LIPIcs, page 35:1-35:18. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)New Pumping Technique for 2-Dimensional VASS., , , and . MFCS, volume 138 of LIPIcs, page 62:1-62:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes., and . MFCS, volume 4162 of Lecture Notes in Computer Science, page 646-657. Springer, (2006)Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP., and . CONCUR, volume 3653 of Lecture Notes in Computer Science, page 263-277. Springer, (2005)