License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2017.7
URN: urn:nbn:de:0030-drops-76872
Go to the corresponding LIPIcs Volume Portal

Veanes, Margus

Symbolic Automata Theory with Applications (Invited Talk)

LIPIcs-CSL-2017-7.pdf (0.2 MB)


Symbolic automata extend classic finite state automata by allowing
transitions to carry predicates over rich alphabet theories. The
key algorithmic difference to classic automata is the ability to
efficiently operate over very large or infinite alphabets. In this
talk we give an overview of what is currently known about symbolic
automata, what their main applications are, and what challenges
arise when reasoning about them. We also discuss some of the open
problems and research directions in symbolic automata theory.

BibTeX - Entry

  author =	{Margus Veanes},
  title =	{{Symbolic Automata Theory with Applications (Invited Talk)}},
  booktitle =	{26th EACSL Annual Conference on Computer Science Logic (CSL 2017)},
  pages =	{7:1--7:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-045-3},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{82},
  editor =	{Valentin Goranko and Mads Dam},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-76872},
  doi =		{10.4230/LIPIcs.CSL.2017.7},
  annote =	{Keywords: automaton, transducer, symbolic}

Keywords: automaton, transducer, symbolic
Collection: 26th EACSL Annual Conference on Computer Science Logic (CSL 2017)
Issue Date: 2017
Date of publication: 16.08.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI