- Prefix-Recognisable Graphs and Monadic Second-Order Logic Achim Blumensath Sat 19 May 2012
- Language Theory and Infinite Graphs Colin Stirling Fri 18 May 2012
- Monadic second-order logic, graph coverings and unfoldings of transition systems Bruno Courcelle Igor Walukiewicz Fri 18 May 2012
- A String-Rewriting Characterization of Muller and Schupp's Context-Free Graphs Hugues Calbrix Teodor Knapik Fri 18 May 2012
- A Chomsky-Like Hierarchy of Infinite Graphs Didier Caucal Teodor Knapik Fri 18 May 2012
- The Reachability Problem over Infinite Graphs Wolfgang Thomas Fri 18 May 2012
- Timed Branching Processes A. Trivedi D. Wojtczak Wed 16 May 2012
- Recursive timed automata Ashutosh Trivedi Dominik Wojtczak Wed 16 May 2012
- Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata Thomas Wilke Wed 16 May 2012
- The Monadic Theory of Order Saharon Shelah Mon 14 May 2012
- On logics, tilings, and automata Wolfgang Thomas Mon 14 May 2012
- On the regular structure of prefix rewriting Didier Caucal Mon 14 May 2012
- On the regular structure of prefix rewriting Didier Caucal Mon 14 May 2012
- Automata for Branching and Layered Temporal Structures G. Puppis Mon 14 May 2012
- Termination of rewriting Nachum Dershowitz Mon 14 May 2012
- Guarded commands, nondeterminacy and formal derivation of programs Edsger W. Dijkstra Mon 14 May 2012
- Experience report: OCaml for an industrial-strength static analysis framework Pascal Cuoq Julien Signoles Patrick Baudin Richard Bonichon Géraud Canet Loic Correnson Benjamin Monate Virgile Prevosto Armand Puccetti Sat 12 May 2012
- On decidability of monadic logic of order over the naturals extended by monadic predicates Alexander Rabinovich Sat 12 May 2012
- The Monadic Theory of Morphic Infinite Words and Generalizations Olivier Carton Wolfgang Thomas Sat 12 May 2012
- Timed automata with periodic clock constraints Christian Choffrut Massimiliano Goldwurm Wed 09 May 2012
Library Size: 13G (12972 entries),
Last Updated: Apr 16, 2026, 22:09:35,
Build Time: N/A
