Derived-Term Automata of Multitape Expressions with Composition

From LRDE

Revision as of 19:35, 26 February 2018 by Bot (talk | contribs)
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Abstract

Rational expressions are powerful tools to define automata, but often restricted to single-tape automata. Our goal is to unleash their expressive power for transducersand more generally, any multitape automaton; for instance . We generalize the construction of the derived-term automaton by using expansions. This approach generates small automata, and even allows us to support a composition operator.


Bibtex (lrde.bib)

@Article{	  demaille.17.sacs,
  title		= {Derived-Term Automata of Multitape Expressions with
		  Composition},
  author	= {Akim Demaille},
  journal	= {Scientific Annals of Computer Science},
  volume	= {27},
  number	= {2},
  organization	= {``A.I. Cuza'' University, Ia\c si, Rom\^ania},
  year		= {2017},
  pages		= {137--176},
  doi		= {10.7561/SACS.2017.2.137},
  publisher	= {``A.I. Cuza'' University Press, Ia\c si},
  abstract	= {Rational expressions are powerful tools to define
		  automata, but often restricted to single-tape automata. Our
		  goal is to unleash their expressive power for transducers,
		  and more generally, any multitape automaton; for instance
		  $(a^+\mathbin{\vert} x + b^+\mathbin{\vert} y)^*$. We
		  generalize the construction of the derived-term automaton
		  by using \emph{expansions}. This approach generates small
		  automata, and even allows us to support a composition
		  operator.}
}