Difference between revisions of "Publications/demaille.17.ictac"
From LRDE
| (2 intermediate revisions by the same user not shown) | |||
| Line 16: | Line 16: | ||
| type = inproceedings |
| type = inproceedings |
||
| id = demaille.17.ictac |
| id = demaille.17.ictac |
||
| + | | identifier = doi:10.1007/978-3-319-67729-3_10 |
||
| bibtex = |
| bibtex = |
||
@InProceedings<nowiki>{</nowiki> demaille.17.ictac, |
@InProceedings<nowiki>{</nowiki> demaille.17.ictac, |
||
| Line 24: | Line 25: | ||
Theoretical Aspects of Computing (ICTAC)<nowiki>}</nowiki>, |
Theoretical Aspects of Computing (ICTAC)<nowiki>}</nowiki>, |
||
year = 2017, |
year = 2017, |
||
| + | doi = <nowiki>{</nowiki>10.1007/978-3-319-67729-3_10<nowiki>}</nowiki>, |
||
publisher = <nowiki>{</nowiki>Springer<nowiki>}</nowiki>, |
publisher = <nowiki>{</nowiki>Springer<nowiki>}</nowiki>, |
||
series = <nowiki>{</nowiki>Lecture Notes in Computer Science<nowiki>}</nowiki>, |
series = <nowiki>{</nowiki>Lecture Notes in Computer Science<nowiki>}</nowiki>, |
||
Latest revision as of 16:56, 12 July 2023
- Authors
- Akim Demaille, Thibaud Michaud
- Where
- Proceedings of the Thirteenth International Colloquium on Theoretical Aspects of Computing (ICTAC)
- Place
- Hanoi, Vietnam
- Type
- inproceedings
- Publisher
- Springer
- Projects
- Vcsn
- Date
- 2017-07-05
Abstract
Quotient operators have been rarely studied in the context of weighted rational expressions and automaton generation—in spite of the key role played by the quotient of words in formal language theory. To handle both left- and right-quotients we generalize an expansion-based construction of the derived-term (or Antimirov, or equation) automaton and rely on support for a transposition (or reversal) operator. The resulting automata may have spontaneous transitions, which requires different techniques from the usual derived-term constructions.
Documents
Bibtex (lrde.bib)
@InProceedings{ demaille.17.ictac,
author = {Akim Demaille and Thibaud Michaud},
title = {Derived-Term Automata of Weighted Rational Expressions
with Quotient Operators},
booktitle = {Proceedings of the Thirteenth International Colloquium on
Theoretical Aspects of Computing (ICTAC)},
year = 2017,
doi = {10.1007/978-3-319-67729-3_10},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {10580},
pages = {155--173},
address = {Hanoi, Vietnam},
month = oct,
abstract = {Quotient operators have been rarely studied in the context
of weighted rational expressions and automaton
generation---in spite of the key role played by the
quotient of words in formal language theory. To handle both
left- and right-quotients we generalize an expansion-based
construction of the derived-term (or Antimirov, or
equation) automaton and rely on support for a transposition
(or reversal) operator. The resulting automata may have
spontaneous transitions, which requires different
techniques from the usual derived-term constructions. }
}