Posted: 12th June 2014

Four Oxford papers have been accepted to MFCS 2014 - The 39th International Symposium on Mathematical Foundations of Computer Science.

The papers are:

• Ines Marusic and James Worrell: Complexity of Equivalence and Learning for Multiplicity Tree Automata
• Daniel Bundala and Joel Ouaknine: Advances in Parametric Real-Time Reasoning
• Andrzej Murawski, Steven Ramsay and Nikos Tzevelekos: Reachability in pushdown register automata
• Pierre Bourhis, Michael Morak and Andreas Pieris: Towards Efficient Reasoning under Guarded-based Disjunctive Existential Rules

The MFCS conferences encompass research in all branches of theoretical computer science. Their broad scope provides an opportunity to bring together researchers who do not usually meet at specialized conferences. The conference will be held in Budapest, in August 2014.

Further information here: http://www.inf.u-szeged.hu/mfcs2014/?page_id=522.