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

  • Complexity of weak acceptance conditions in tree automata Jakub Neumann Andrzej Szepietowski Igor Walukiewicz Fri 07 February 2020
  • Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings Arnaud Carayol Christof Løding Olivier Serre Fri 13 October 2017
  • The pseudovariety J is hyperdecidable J. Almeida M. Zeitoun Thu 08 June 2017
  • A note on the emptiness problem for alternating finite-memory automata Daniel Genkin Michael Kaminski Liat Peterfreund Wed 17 September 2014

Library Size: 13G (4 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A badge
[show logs] [hide logs]