bibliographer - Tomáš Masopust

bibliographer a curated TCS bibliography

obsidian
tags
authors
no doi
no pdf
bad author
add item
librarian

On the Complexity of Initial-and-Final-State Opacity for Discrete Event Systems Tomáš Masopust Petr Osička [github]

Partially Ordered Automata and Piecewise Testability Tomáš Masopust Markus Krøtzsch [github]

Separability by Piecewise Testable Languages is PTime-Complete Tomáš Masopust [github]

On Upper and Lower Bounds on the Length of Alternating Towers Stepan Holub Galina Jirásková Tomás Masopust [github]

Efficient Separability of Regular Languages by Subsequences and Suffixes Wojciech Czerwiński Wim Martens Tomáš Masopust [github]

Separability by piecewise testable languages is PTime-complete Tomáš Masopust [github]

Library Size: 13G (6 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]