1 Search Results for "Ramsay, Steven J."

Document
DOI: 10.4230/LIPIcs.MFCS.2018.72
Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata

Authors: Andrzej S. Murawski, Steven J. Ramsay, and Nikos Tzevelekos

Published in: LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)

Abstract
Register automata are one of the most studied automata models over infinite alphabets. The complexity of language equivalence for register automata is quite subtle. In general, the problem is undecidable but, in the deterministic case, it is known to be decidable and in NP. Here we propose a polynomial-time algorithm building upon automata- and group-theoretic techniques. The algorithm is applicable to standard register automata with a fixed number of registers as well as their variants with a variable number of registers and ability to generate fresh data values (fresh-register automata). To complement our findings, we also investigate the associated inclusion problem and show that it is PSPACE-complete.
Cite as

Andrzej S. Murawski, Steven J. Ramsay, and Nikos Tzevelekos. Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 72:1-72:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{murawski_et_al:LIPIcs.MFCS.2018.72,
  author =	{Murawski, Andrzej S. and Ramsay, Steven J. and Tzevelekos, Nikos},
  title =	{{Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata}},
  booktitle =	{43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)},
  pages =	{72:1--72:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-086-6},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{117},
  editor =	{Potapov, Igor and Spirakis, Paul and Worrell, James},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.72},
  URN =		{urn:nbn:de:0030-drops-96544},
  doi =		{10.4230/LIPIcs.MFCS.2018.72},
  annote =	{Keywords: automata over infinite alphabets, language equivalence, bisimilarity, computational group theory}
}
  • Refine by Author
  • 1 Murawski, Andrzej S.
  • 1 Ramsay, Steven J.
  • 1 Tzevelekos, Nikos

  • Refine by Classification
  • 1 Theory of computation → Formal languages and automata theory

  • Refine by Keyword
  • 1 automata over infinite alphabets
  • 1 bisimilarity
  • 1 computational group theory
  • 1 language equivalence

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2018

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact