bibliographer a curated TCS bibliography
  • obsidian
  • tags
  • authors
  • no doi
  • no pdf
  • bad author
  • add item
  • librarian

Scoped MSO, Register Automata, and Expressions: Equivalence over Data Words Radosław Piórkowski [github]
Universal quantification makes automatic structures hard to decide Christoph Haase Radosław Piórkowski [github]
Determinisability of register and timed automata Lorenzo Clemente Sławomir Lasota Radosław Piórkowski [github]
Tame the infinite - simplification problems for infinite-state systems Radosław Piórkowski [github]
Determinisability of register and timed automata Lorenzo Clemente Sławomir Lasota Radosław Piórkowski [github]
WQO dichotomy for 3-graphs Sławomir Lasota Radosław Piórkowski [github]
Reducing Transducer Equivalence to Register Automata Problems Solved by ``Hilbert Method'' Adrien Boiret Radoslaw Piórkowski Janusz Schmude [github]
Determinisability of One-Clock Timed Automata Lorenzo Clemente Sławomir Lasota Radosław Piórkowski [github]
Determinisability of one-clock timed automata Lorenzo Clemente Sławomir Lasota Radosław Piórkowski [github]
Timed Games and Deterministic Separability Lorenzo Clemente Sławomir Lasota Radosław Piórkowski [github]
Timed games and deterministic separability Lorenzo Clemente Sławomir Lasota Radosław Piórkowski [github]
WQO dichotomy for 3-graphs Sławomir Lasota Radosław Piórkowski [github]

Library Size: 13G (12 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A badge
[show logs] [hide logs]