Difference between revisions of "Publications/demaille.17.ictac"

From LRDE

Line 7: Line 7:
 
| 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 = 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.
 
| 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.
Line 12: Line 14:
 
| lrdepaper = http://www.lrde.epita.fr/dload/papers/demaille.17.ictac.pdf
 
| 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
Line 25: Line 26:
 
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,
Line 36: Line 39:
 
(or reversal) operator. The resulting automata may have
 
(or reversal) operator. The resulting automata may have
 
spontaneous transitions, which requires different
 
spontaneous transitions, which requires different
techniques from the usual derived-term constructions. <nowiki>}</nowiki>,
+
techniques from the usual derived-term constructions. <nowiki>}</nowiki>
note = <nowiki>{</nowiki>accepted<nowiki>}</nowiki>
 
 
<nowiki>}</nowiki>
 
<nowiki>}</nowiki>
   

Revision as of 14:17, 29 October 2018

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,
  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. }
}