Difference between revisions of "Publications/demaille.17.sacs"
From LRDE
| (8 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{Publication |
{{Publication |
||
| published = true |
| published = true |
||
| − | | date = 2017- |
+ | | date = 2017-12-29 |
| title = Derived-Term Automata of Multitape Expressions with Composition |
| title = Derived-Term Automata of Multitape Expressions with Composition |
||
| authors = Akim Demaille |
| authors = Akim Demaille |
||
| Line 11: | Line 11: | ||
| publisher = “A.I. Cuza” University Press, Iac si |
| publisher = “A.I. Cuza” University Press, Iac si |
||
| lrdeprojects = Vcsn |
| lrdeprojects = Vcsn |
||
| + | | lrdenewsdate = 2017-12-29 |
||
| ⚫ | | 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 (a^+mathbin |
||
| + | | lrdepaper = http://www.lrde.epita.fr/dload/papers/demaille.17.sacs.pdf |
||
| ⚫ | | 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 <math>(a^+\mathbin{\vert} x + b^+\mathbin{\vert} y)^*</math>. 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. |
||
| type = article |
| type = article |
||
| id = demaille.17.sacs |
| id = demaille.17.sacs |
||
| Line 25: | Line 27: | ||
organization = <nowiki>{</nowiki>``A.I. Cuza'' University, Ia\c si, Rom\^ania<nowiki>}</nowiki>, |
organization = <nowiki>{</nowiki>``A.I. Cuza'' University, Ia\c si, Rom\^ania<nowiki>}</nowiki>, |
||
year = <nowiki>{</nowiki>2017<nowiki>}</nowiki>, |
year = <nowiki>{</nowiki>2017<nowiki>}</nowiki>, |
||
| + | month = jan, |
||
pages = <nowiki>{</nowiki>137--176<nowiki>}</nowiki>, |
pages = <nowiki>{</nowiki>137--176<nowiki>}</nowiki>, |
||
doi = <nowiki>{</nowiki>10.7561/SACS.2017.2.137<nowiki>}</nowiki>, |
doi = <nowiki>{</nowiki>10.7561/SACS.2017.2.137<nowiki>}</nowiki>, |
||
Latest revision as of 10:39, 22 April 2023
- Authors
- Akim Demaille
- Journal
- Scientific Annals of Computer Science
- Type
- article
- Publisher
- “A.I. Cuza” University Press, Iac si
- Projects
- Vcsn
- Date
- 2017-12-29
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.
Documents
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},
month = jan,
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.}
}