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

  • L(A)=L(B) A simplified decidability proof Géraud Sénizergues Thu 04 October 2018
  • L(A)=L(B) decidability results from complete formal systems Géraud Sénizergues Thu 04 October 2018
  • Complete formal systems for equivalence problems Géraud Sénizergues Thu 04 October 2018
  • LALBLC a Program Testing the Equivalence of Dpda's Patrick Henry Géraud Sénizergues Sat 29 March 2014
  • Idealized Algol with Ground Recursion, and DPDA Equivalence A.S. Murawski C.-H.L. Ong I. Walukiewicz Wed 01 May 2013
  • From security protocols to pushdown automata Rémy Chrétien Véronique Cortier Stéphanie Delaune Thu 25 April 2013
  • An intersection type system for deterministic pushdown automata Takeshi Tsukada Naoki Kobayashi Mon 18 February 2013
  • Recursive schemes, algebraic trees and deterministic languages Bruno Courcelle Tue 16 October 2012

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