- Complete lattices and up-to techniques Damien Pous Fri 05 October 2012
- On the bisimulation proof method Davide Sangiorgi Fri 05 October 2012
- On-the-fly verification of finite transition systems Jean-Claude Fernandez Laurent Mounier Claude Jard Thierry Jéron Fri 05 October 2012
- Abstract regular (tree) model checking Ahmed Bouajjani Peter Habermehl Adam Rogalewicz Tomáš Vojnar Fri 05 October 2012
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata Ondřej Lengál Jiří Šimáček Tomáš Vojnar Fri 05 October 2012
- Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs P. Madhusudan Wed 03 October 2012
- Complexity results for 1-safe nets Allan Cheng Javier Esparza Jens Palsberg Wed 03 October 2012
- Reachability Analysis of Communicating Pushdown Systems Alexander Heußner Jérôme Leroux Anca Muscholl Grégoire Sutre Wed 03 October 2012
- Deterministic tree pushdown automata and monadic tree rewriting systems Kai Salomaa Wed 03 October 2012
- Formal Languages and Word-Rewriting Géraud Sénizergues Wed 03 October 2012
- On relationship between term rewriting systems and regular tree languages G.A. Kucherov Wed 03 October 2012
- Linear context-free rewriting systems and deterministic tree-walking transducers David J. Weir Wed 03 October 2012
- On Regularity-Preservation by String-Rewriting Systems Peter Leupold Wed 03 October 2012
- A Linear Algorithm for Testing Equivalence of Finite Automata John Hopcroft Richard Karp Tue 02 October 2012
- Checking NFA equivalence with bisimulations up to congruence Filippo Bonchi Damien Pous Tue 02 October 2012
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability Pál Gyenizse Sándor Vágvølgyi Tue 02 October 2012
- Some undecidability results concerning the property of preserving regularity Friedrich Otto Tue 02 October 2012
- Bottom-up tree pushdown automata: classification and connection with rewrite systems Jean-Luc Coquidé Max Dauchet Rémi Gilleron Sandor Vagvolgyi Tue 02 October 2012
- Decidable approximations of term rewriting systems Florent Jacquemard Mon 01 October 2012
- Tree Automata Techniques and Applications H. Comon M. Dauchet R. Gilleron C. Løding F. Jacquemard D. Lugiez S. Tison M. Tommasi Mon 01 October 2012
Library Size: 13G (12979 entries),
Last Updated: Apr 21, 2026, 11:39:05,
Build Time: N/A
