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...")
 
Line 3: Line 3:
 
| date = 2017-07-05
  
| date = 2017-07-05
 
| authors = Akim Demaille, Thibaud Michaud
  
| authors = Akim Demaille, Thibaud Michaud
−
| title = Quotient Operators for Weighted Rational Expressions
 +
| 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
 
| address = Hanoi, Vietnam
  
| address = Hanoi, Vietnam
−
| abstract = Quotients of words play a key role in formal language theory, however they have been rarely studied in the context of weighted rational expressions. We define the left and right quotients of rational series, and introduce corresponding operators for weighted expressions. We generalize an alternative construction of the derived-term (or Antimirov, or equation) automaton, based on expansions, to handle these operators.
 +
| 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
 
| lrdenewsdate = 2017-07-05
  
| lrdenewsdate = 2017-07-05
Line 17: Line 17:
 
@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>Quotient Operators for Weighted Rational Expressions<nowiki>}</nowiki>,
 +
title = <nowiki>{</nowiki>Derived-Term Automata of Weighted Rational Expressions
  ⚫
with Quotient Operators<nowiki>}</nowiki>,
 
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>,
Line 25: Line 26:
 
address = <nowiki>{</nowiki>Hanoi, Vietnam<nowiki>}</nowiki>,
  
address = <nowiki>{</nowiki>Hanoi, Vietnam<nowiki>}</nowiki>,
 
month = oct,
  
month = oct,
−
abstract = <nowiki>{</nowiki>Quotients of words play a key role in formal language
 +
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
  
−
context of weighted rational expressions. We define the
 +
generation---in spite of the key role played by the
  +
quotient of words in formal language theory. To handle both
−
left and right quotients of rational series, and introduce
 +
left- and right-quotients we generalize an expansion-based
−
corresponding operators for weighted expressions. We
  
−
generalize an alternative construction of the derived-term
 +
construction of the derived-term (or Antimirov, or
−
(or Antimirov, or equation) automaton, based on expansions,
 +
equation) automaton and rely on support for a transposition
  +
(or reversal) operator. The resulting automata may have
⚫
to handle these operators.<nowiki>}</nowiki>,
  
  +
spontaneous transitions, which requires different
  +
techniques from the usual derived-term constructions. <nowiki>}</nowiki>,
 
note = <nowiki>{</nowiki>accepted<nowiki>}</nowiki>
  
note = <nowiki>{</nowiki>accepted<nowiki>}</nowiki>
 
<nowiki>}</nowiki>
  
<nowiki>}</nowiki>

Revision as of 08:47, 12 July 2017

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.


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,
  publisher	= {Springer},
  series	= {Lecture Notes in Computer Science},
  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. },
  note		= {accepted}
}





Retrieved from "https://www.lrde.epita.fr/index.php?title=Publications/demaille.17.ictac&oldid=118746"