Difference between revisions of "Publications/demaille.17.ictac"
From LRDE
(Created page with "{{Publication | published = true | date = 2017-07-05 | authors = Akim Demaille, Thibaud Michaud | title = Quotient Operators for Weighted Rational Expressions | booktitle = Pr...") |
|||
(9 intermediate revisions by the same user not shown) | |||
Line 3: | Line 3: | ||
| date = 2017-07-05 |
| date = 2017-07-05 |
||
| authors = Akim Demaille, Thibaud Michaud |
| authors = Akim Demaille, Thibaud Michaud |
||
− | | title = |
+ | | title = Derived-Term Automata of Weighted Rational Expressions with Quotient Operators |
| booktitle = Proceedings of the Thirteenth International Colloquium on Theoretical Aspects of Computing (ICTAC) |
| booktitle = Proceedings of the Thirteenth International Colloquium on Theoretical Aspects of Computing (ICTAC) |
||
| publisher = Springer |
| publisher = Springer |
||
| series = Lecture Notes in Computer Science |
| series = Lecture Notes in Computer Science |
||
+ | | volume = 10580 |
||
+ | | pages = 155 to 173 |
||
| address = Hanoi, Vietnam |
| address = Hanoi, Vietnam |
||
− | | abstract = |
+ | | 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. |
| lrdeprojects = Vcsn |
| lrdeprojects = Vcsn |
||
+ | | lrdepaper = http://www.lrde.epita.fr/dload/papers/demaille.17.ictac.pdf |
||
| lrdenewsdate = 2017-07-05 |
| lrdenewsdate = 2017-07-05 |
||
− | | note = accepted |
||
| 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, |
||
author = <nowiki>{</nowiki>Akim Demaille and Thibaud Michaud<nowiki>}</nowiki>, |
author = <nowiki>{</nowiki>Akim Demaille and Thibaud Michaud<nowiki>}</nowiki>, |
||
− | title = <nowiki>{</nowiki> |
+ | title = <nowiki>{</nowiki>Derived-Term Automata of Weighted Rational Expressions |
⚫ | |||
booktitle = <nowiki>{</nowiki>Proceedings of the Thirteenth International Colloquium on |
booktitle = <nowiki>{</nowiki>Proceedings of the Thirteenth International Colloquium on |
||
Theoretical Aspects of Computing (ICTAC)<nowiki>}</nowiki>, |
Theoretical Aspects of Computing (ICTAC)<nowiki>}</nowiki>, |
||
year = 2017, |
year = 2017, |
||
⚫ | |||
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>, |
||
+ | volume = <nowiki>{</nowiki>10580<nowiki>}</nowiki>, |
||
+ | pages = <nowiki>{</nowiki>155--173<nowiki>}</nowiki>, |
||
address = <nowiki>{</nowiki>Hanoi, Vietnam<nowiki>}</nowiki>, |
address = <nowiki>{</nowiki>Hanoi, Vietnam<nowiki>}</nowiki>, |
||
month = oct, |
month = oct, |
||
− | abstract = <nowiki>{</nowiki> |
+ | abstract = <nowiki>{</nowiki>Quotient operators have been rarely studied in the context |
+ | of weighted rational expressions and automaton |
||
− | theory, however they have been rarely studied in the |
||
− | + | generation---in spite of the key role played by the |
|
+ | quotient of words in formal language theory. To handle both |
||
− | left and right |
+ | left- and right-quotients we generalize an expansion-based |
− | corresponding operators for weighted expressions. We |
||
− | + | 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. <nowiki>}</nowiki> |
||
<nowiki>}</nowiki> |
<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. } }