Ancient Typefaces and Parametric Weighted Finite Automata
Identifieur interne : 000360 ( Istex/Corpus ); précédent : 000359; suivant : 000361Ancient Typefaces and Parametric Weighted Finite Automata
Auteurs : Jürgen Albert ; German TischlerSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
Abstract
Abstract: Generalizations of weighted finite automata where real-valued weights are assigned to all transitions and d-dimensional vectors of real values belong to the states (PWFA) have been studied w.r.t. compact representations of glyphs from ancient fonts, especially from the ubiquitous fraktur-families. It is well-known, that polynomials of arbitrary degree over the unit interval can be generated by simple weighted finite automata in an elegant and compact manner. This result carries over nicely to the representation of typefaces. There it is first applied to the outlines of the glyphs and then to their interiors. Finally, we show that even animated writing, i.e. video-clips of drawing glyphs with a pen as if by a human hand, can be modeled by PWFA.
Url:
DOI: 10.1007/978-3-642-19391-0_4
Links to Exploration step
ISTEX:A5ED7EDB36189658E9EB60732554AFA39CAFDBF7Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Ancient Typefaces and Parametric Weighted Finite Automata</title><author><name sortKey="Albert, Jurgen" sort="Albert, Jurgen" uniqKey="Albert J" first="Jürgen" last="Albert">Jürgen Albert</name><affiliation><mods:affiliation>Dept. of Computer Science, University of Würzburg, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: albert@informatik.uni-wuerzburg.de</mods:affiliation></affiliation></author><author><name sortKey="Tischler, German" sort="Tischler, German" uniqKey="Tischler G" first="German" last="Tischler">German Tischler</name><affiliation><mods:affiliation>Dept. of Informatics, King’s College London, WC2R 2LS, UK</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: german.tischler@kcl.ac.uk</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:A5ED7EDB36189658E9EB60732554AFA39CAFDBF7</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-19391-0_4</idno><idno type="url">https://api.istex.fr/document/A5ED7EDB36189658E9EB60732554AFA39CAFDBF7/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000360</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Ancient Typefaces and Parametric Weighted Finite Automata</title><author><name sortKey="Albert, Jurgen" sort="Albert, Jurgen" uniqKey="Albert J" first="Jürgen" last="Albert">Jürgen Albert</name><affiliation><mods:affiliation>Dept. of Computer Science, University of Würzburg, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: albert@informatik.uni-wuerzburg.de</mods:affiliation></affiliation></author><author><name sortKey="Tischler, German" sort="Tischler, German" uniqKey="Tischler G" first="German" last="Tischler">German Tischler</name><affiliation><mods:affiliation>Dept. of Informatics, King’s College London, WC2R 2LS, UK</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: german.tischler@kcl.ac.uk</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">A5ED7EDB36189658E9EB60732554AFA39CAFDBF7</idno><idno type="DOI">10.1007/978-3-642-19391-0_4</idno><idno type="ChapterID">4</idno><idno type="ChapterID">Chap4</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Generalizations of weighted finite automata where real-valued weights are assigned to all transitions and d-dimensional vectors of real values belong to the states (PWFA) have been studied w.r.t. compact representations of glyphs from ancient fonts, especially from the ubiquitous fraktur-families. It is well-known, that polynomials of arbitrary degree over the unit interval can be generated by simple weighted finite automata in an elegant and compact manner. This result carries over nicely to the representation of typefaces. There it is first applied to the outlines of the glyphs and then to their interiors. Finally, we show that even animated writing, i.e. video-clips of drawing glyphs with a pen as if by a human hand, can be modeled by PWFA.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Jürgen Albert</name><affiliations><json:string>Dept. of Computer Science, University of Würzburg, Germany</json:string><json:string>E-mail: albert@informatik.uni-wuerzburg.de</json:string></affiliations></json:item><json:item><name>German Tischler</name><affiliations><json:string>Dept. of Informatics, King’s College London, WC2R 2LS, UK</json:string><json:string>E-mail: german.tischler@kcl.ac.uk</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: Generalizations of weighted finite automata where real-valued weights are assigned to all transitions and d-dimensional vectors of real values belong to the states (PWFA) have been studied w.r.t. compact representations of glyphs from ancient fonts, especially from the ubiquitous fraktur-families. It is well-known, that polynomials of arbitrary degree over the unit interval can be generated by simple weighted finite automata in an elegant and compact manner. This result carries over nicely to the representation of typefaces. There it is first applied to the outlines of the glyphs and then to their interiors. Finally, we show that even animated writing, i.e. video-clips of drawing glyphs with a pen as if by a human hand, can be modeled by PWFA.</abstract><qualityIndicators><score>7.928</score><pdfVersion>1.6</pdfVersion><pdfPageSize>429.442 x 659.895 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>763</abstractCharCount><pdfWordCount>5448</pdfWordCount><pdfCharCount>26500</pdfCharCount><pdfPageCount>14</pdfPageCount><abstractWordCount>119</abstractWordCount></qualityIndicators><title>Ancient Typefaces and Parametric Weighted Finite Automata</title><chapterId><json:string>4</json:string><json:string>Chap4</json:string></chapterId><genre><json:string>research-article</json:string></genre><serie><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, Lancaster, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, Stanford, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>University of California, Los Angeles, CA, USA</json:string></affiliations></json:item><json:item><name>Doug Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbrücken, Germany</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2011</copyrightDate></serie><host><editor><json:item><name>Cristian S. Calude</name><affiliations><json:string>Department of Computer Science, Science Centre, The University of Auckland, 38 Princes Street, 1142, Auckland, New Zealand</json:string><json:string>E-mail: cristian@cs.auckland.ac.nz</json:string></affiliations></json:item><json:item><name>Grzegorz Rozenberg</name><affiliations><json:string>Leiden Institute of Center Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands</json:string><json:string>E-mail: rozenber@liacs.nl</json:string></affiliations></json:item><json:item><name>Arto Salomaa</name><affiliations><json:string>Turku Centre for Computer Science (TUCS), University of Turku, Leminkäisenkatu 14, 20014, Turku, Finland</json:string><json:string>E-mail: asalomaa@utu.fi</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Theory of Computation</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>User Interfaces and Human Computer Interaction</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Computers and Society</value></json:item></subject><isbn><json:string>978-3-642-19390-3</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Rainbow of Computer Science</title><bookId><json:string>978-3-642-19391-0</json:string></bookId><volume>6570</volume><pages><last>62</last><first>49</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-642-19391-0</json:string></eisbn><copyrightDate>2011</copyrightDate><doi><json:string>10.1007/978-3-642-19391-0</json:string></doi></host><publicationDate>2011</publicationDate><copyrightDate>2011</copyrightDate><doi><json:string>10.1007/978-3-642-19391-0_4</json:string></doi><id>A5ED7EDB36189658E9EB60732554AFA39CAFDBF7</id><score>0.15731342</score><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/A5ED7EDB36189658E9EB60732554AFA39CAFDBF7/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/A5ED7EDB36189658E9EB60732554AFA39CAFDBF7/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/A5ED7EDB36189658E9EB60732554AFA39CAFDBF7/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Ancient Typefaces and Parametric Weighted Finite Automata</title><respStmt xml:id="ISTEX-API" resp="Références bibliographiques récupérées via GROBID" name="ISTEX-API (INIST-CNRS)"></respStmt><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>SPRINGER</p></availability><date>2011</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Ancient Typefaces and Parametric Weighted Finite Automata</title><author><persName><forename type="first">Jürgen</forename><surname>Albert</surname></persName><email>albert@informatik.uni-wuerzburg.de</email><affiliation>Dept. of Computer Science, University of Würzburg, Germany</affiliation></author><author><persName><forename type="first">German</forename><surname>Tischler</surname></persName><email>german.tischler@kcl.ac.uk</email><affiliation>Dept. of Informatics, King’s College London, WC2R 2LS, UK</affiliation></author></analytic><monogr><title level="m">Rainbow of Computer Science</title><title level="m" type="sub">Dedicated to Hermann Maurer on the Occasion of His 70th Birthday</title><idno type="pISBN">978-3-642-19390-3</idno><idno type="eISBN">978-3-642-19391-0</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/978-3-642-19391-0</idno><idno type="BookID">978-3-642-19391-0</idno><idno type="BookTitleID">217198</idno><idno type="BookSequenceNumber">6570</idno><idno type="BookVolumeNumber">6570</idno><idno type="BookChapterCount">20</idno><editor><persName><forename type="first">Cristian</forename><forename type="first">S.</forename><surname>Calude</surname></persName><email>cristian@cs.auckland.ac.nz</email><affiliation>Department of Computer Science, Science Centre, The University of Auckland, 38 Princes Street, 1142, Auckland, New Zealand</affiliation></editor><editor><persName><forename type="first">Grzegorz</forename><surname>Rozenberg</surname></persName><email>rozenber@liacs.nl</email><affiliation>Leiden Institute of Center Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands</affiliation></editor><editor><persName><forename type="first">Arto</forename><surname>Salomaa</surname></persName><email>asalomaa@utu.fi</email><affiliation>Turku Centre for Computer Science (TUCS), University of Turku, Leminkäisenkatu 14, 20014, Turku, Finland</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2011"></date><biblScope unit="volume">6570</biblScope><biblScope unit="page" from="49">49</biblScope><biblScope unit="page" to="62">62</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><biblScope><date>2011</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesId">558</idno></series><idno type="istex">A5ED7EDB36189658E9EB60732554AFA39CAFDBF7</idno><idno type="DOI">10.1007/978-3-642-19391-0_4</idno><idno type="ChapterID">4</idno><idno type="ChapterID">Chap4</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2011</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: Generalizations of weighted finite automata where real-valued weights are assigned to all transitions and d-dimensional vectors of real values belong to the states (PWFA) have been studied w.r.t. compact representations of glyphs from ancient fonts, especially from the ubiquitous fraktur-families. It is well-known, that polynomials of arbitrary degree over the unit interval can be generated by simple weighted finite automata in an elegant and compact manner. This result carries over nicely to the representation of typefaces. There it is first applied to the outlines of the glyphs and then to their interiors. Finally, we show that even animated writing, i.e. video-clips of drawing glyphs with a pen as if by a human hand, can be modeled by PWFA.</p></abstract><textClass><keywords scheme="Book Subject Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book Subject Group"><list><label>I</label><label>I16005</label><label>I1603X</label><label>I16048</label><label>I18067</label><label>I21017</label><label>I24040</label><item><term>Computer Science</term></item><item><term>Theory of Computation</term></item><item><term>Logics and Meanings of Programs</term></item><item><term>Mathematical Logic and Formal Languages</term></item><item><term>User Interfaces and Human Computer Interaction</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item><item><term>Computers and Society</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2011">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-3-20">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-07-26">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/A5ED7EDB36189658E9EB60732554AFA39CAFDBF7/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><City>Lancaster</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><City>Zurich</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>Stanford</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><City>Bern</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><City>Dortmund</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><State>MA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>University of California</OrgName><OrgAddress><City>Los Angeles</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Collected works" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-642-19391-0</BookID><BookTitle>Rainbow of Computer Science</BookTitle><BookSubTitle>Dedicated to Hermann Maurer on the Occasion of His 70th Birthday</BookSubTitle><BookVolumeNumber>6570</BookVolumeNumber><BookSequenceNumber>6570</BookSequenceNumber><BookDOI>10.1007/978-3-642-19391-0</BookDOI><BookTitleID>217198</BookTitleID><BookPrintISBN>978-3-642-19390-3</BookPrintISBN><BookElectronicISBN>978-3-642-19391-0</BookElectronicISBN><BookChapterCount>20</BookChapterCount><BookCopyright><CopyrightHolderName>Springer Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2011</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16005" Priority="1" Type="Secondary">Theory of Computation</BookSubject><BookSubject Code="I1603X" Priority="2" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="I16048" Priority="3" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I18067" Priority="4" Type="Secondary">User Interfaces and Human Computer Interaction</BookSubject><BookSubject Code="I21017" Priority="5" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I24040" Priority="6" Type="Secondary">Computers and Society</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Cristian</GivenName><GivenName>S.</GivenName><FamilyName>Calude</FamilyName></EditorName><Contact><Email>cristian@cs.auckland.ac.nz</Email></Contact></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Grzegorz</GivenName><FamilyName>Rozenberg</FamilyName></EditorName><Contact><Email>rozenber@liacs.nl</Email></Contact></Editor><Editor AffiliationIDS="Aff18"><EditorName DisplayOrder="Western"><GivenName>Arto</GivenName><FamilyName>Salomaa</FamilyName></EditorName><Contact><Email>asalomaa@utu.fi</Email></Contact></Editor><Affiliation ID="Aff16"><OrgDivision>Department of Computer Science, Science Centre</OrgDivision><OrgName>The University of Auckland</OrgName><OrgAddress><Street>38 Princes Street</Street><Postcode>1142</Postcode><City>Auckland</City><Country>New Zealand</Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgDivision>Leiden Institute of Center Advanced Computer Science (LIACS)</OrgDivision><OrgName>Leiden University</OrgName><OrgAddress><Street>Niels Bohrweg 1</Street><Postcode>2333</Postcode><City>Leiden</City><State>CA</State><Country>The Netherlands</Country></OrgAddress></Affiliation><Affiliation ID="Aff18"><OrgDivision>Turku Centre for Computer Science (TUCS)</OrgDivision><OrgName>University of Turku</OrgName><OrgAddress><Street>Leminkäisenkatu 14</Street><Postcode>20014</Postcode><City>Turku</City><Country>Finland</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part2"><PartInfo TocLevels="0"><PartID>2</PartID><PartSequenceNumber>2</PartSequenceNumber><PartTitle>Formal Languages and Automata</PartTitle><PartChapterCount>6</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Rainbow of Computer Science</BookTitle></PartContext></PartInfo><Chapter ID="Chap4" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>4</ChapterID><ChapterDOI>10.1007/978-3-642-19391-0_4</ChapterDOI><ChapterSequenceNumber>4</ChapterSequenceNumber><ChapterTitle Language="En">Ancient Typefaces and Parametric Weighted Finite Automata</ChapterTitle><ChapterFirstPage>49</ChapterFirstPage><ChapterLastPage>62</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2011</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>2</PartID><BookID>978-3-642-19391-0</BookID><BookTitle>Rainbow of Computer Science</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff19"><AuthorName DisplayOrder="Western"><GivenName>Jürgen</GivenName><FamilyName>Albert</FamilyName></AuthorName><Contact><Email>albert@informatik.uni-wuerzburg.de</Email></Contact></Author><Author AffiliationIDS="Aff20"><AuthorName DisplayOrder="Western"><GivenName>German</GivenName><FamilyName>Tischler</FamilyName></AuthorName><Contact><Email>german.tischler@kcl.ac.uk</Email></Contact></Author><Affiliation ID="Aff19"><OrgDivision>Dept. of Computer Science</OrgDivision><OrgName>University of Würzburg</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff20"><OrgDivision>Dept. of Informatics</OrgDivision><OrgName>King’s College London</OrgName><OrgAddress><Postcode>WC2R 2LS</Postcode><Country>UK</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>Generalizations of weighted finite automata where real-valued weights are assigned to all transitions and <Emphasis Type="Italic">d</Emphasis>-dimensional vectors of real values belong to the states (PWFA) have been studied w.r.t. compact representations of glyphs from ancient fonts, especially from the ubiquitous fraktur-families. It is well-known, that polynomials of arbitrary degree over the unit interval can be generated by simple weighted finite automata in an elegant and compact manner. This result carries over nicely to the representation of typefaces. There it is first applied to the outlines of the glyphs and then to their interiors. Finally, we show that even animated writing, i.e. video-clips of drawing glyphs with a pen as if by a human hand, can be modeled by PWFA.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Ancient Typefaces and Parametric Weighted Finite Automata</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Ancient Typefaces and Parametric Weighted Finite Automata</title></titleInfo><name type="personal"><namePart type="given">Jürgen</namePart><namePart type="family">Albert</namePart><affiliation>Dept. of Computer Science, University of Würzburg, Germany</affiliation><affiliation>E-mail: albert@informatik.uni-wuerzburg.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">German</namePart><namePart type="family">Tischler</namePart><affiliation>Dept. of Informatics, King’s College London, WC2R 2LS, UK</affiliation><affiliation>E-mail: german.tischler@kcl.ac.uk</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2011</dateIssued><copyrightDate encoding="w3cdtf">2011</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: Generalizations of weighted finite automata where real-valued weights are assigned to all transitions and d-dimensional vectors of real values belong to the states (PWFA) have been studied w.r.t. compact representations of glyphs from ancient fonts, especially from the ubiquitous fraktur-families. It is well-known, that polynomials of arbitrary degree over the unit interval can be generated by simple weighted finite automata in an elegant and compact manner. This result carries over nicely to the representation of typefaces. There it is first applied to the outlines of the glyphs and then to their interiors. Finally, we show that even animated writing, i.e. video-clips of drawing glyphs with a pen as if by a human hand, can be modeled by PWFA.</abstract><relatedItem type="host"><titleInfo><title>Rainbow of Computer Science</title><subTitle>Dedicated to Hermann Maurer on the Occasion of His 70th Birthday</subTitle></titleInfo><name type="personal"><namePart type="given">Cristian</namePart><namePart type="given">S.</namePart><namePart type="family">Calude</namePart><affiliation>Department of Computer Science, Science Centre, The University of Auckland, 38 Princes Street, 1142, Auckland, New Zealand</affiliation><affiliation>E-mail: cristian@cs.auckland.ac.nz</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Grzegorz</namePart><namePart type="family">Rozenberg</namePart><affiliation>Leiden Institute of Center Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands</affiliation><affiliation>E-mail: rozenber@liacs.nl</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Arto</namePart><namePart type="family">Salomaa</namePart><affiliation>Turku Centre for Computer Science (TUCS), University of Turku, Leminkäisenkatu 14, 20014, Turku, Finland</affiliation><affiliation>E-mail: asalomaa@utu.fi</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Collected works"></genre><originInfo><copyrightDate encoding="w3cdtf">2011</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16005">Theory of Computation</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I18067">User Interfaces and Human Computer Interaction</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I24040">Computers and Society</topic></subject><identifier type="DOI">10.1007/978-3-642-19391-0</identifier><identifier type="ISBN">978-3-642-19390-3</identifier><identifier type="eISBN">978-3-642-19391-0</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">217198</identifier><identifier type="BookID">978-3-642-19391-0</identifier><identifier type="BookChapterCount">20</identifier><identifier type="BookVolumeNumber">6570</identifier><identifier type="BookSequenceNumber">6570</identifier><identifier type="PartChapterCount">6</identifier><part><date>2011</date><detail type="part"><title>Formal Languages and Automata</title></detail><detail type="volume"><number>6570</number><caption>vol.</caption></detail><extent unit="pages"><start>49</start><end>62</end></extent></part><recordInfo><recordOrigin>Springer Berlin Heidelberg, 2011</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2011</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer Berlin Heidelberg, 2011</recordOrigin></recordInfo></relatedItem><identifier type="istex">A5ED7EDB36189658E9EB60732554AFA39CAFDBF7</identifier><identifier type="DOI">10.1007/978-3-642-19391-0_4</identifier><identifier type="ChapterID">4</identifier><identifier type="ChapterID">Chap4</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer Berlin Heidelberg, 2011</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2011</recordOrigin></recordInfo></mods></metadata><enrichments><istex:refBibTEI uri="https://api.istex.fr/document/A5ED7EDB36189658E9EB60732554AFA39CAFDBF7/enrichments/refBib"><teiHeader></teiHeader><text><front></front><body></body><back><listBibl><biblStruct xml:id="b0"><monogr><title level="m" type="main">Adobe Systems Inc: Adobe Type 1 Font Format</title><imprint><date type="published" when="1990"></date><publisher>Addison Wesley</publisher><pubPlace>Reading</pubPlace></imprint></monogr><note>2nd. edn</note></biblStruct><biblStruct xml:id="b1"><monogr><title level="m" type="main">Adobe Systems Inc: PostScript Language Reference</title><imprint><date type="published" when="1999"></date><publisher>Addison-Wesley</publisher><pubPlace>Reading</pubPlace></imprint></monogr><note>3rd. edn</note></biblStruct><biblStruct xml:id="b2"><monogr><title level="m" type="main">Adobe Systems Inc: PDF Reference Version 1.6, 5th edn</title><imprint><date type="published" when="2004"></date><publisher>Adobe Press</publisher></imprint></monogr></biblStruct><biblStruct xml:id="b3"><analytic><title level="a" type="main">Parametric weighted finite automata and iterated function systems</title><author><persName><forename type="first">J</forename><surname>Albert</surname></persName></author><author><persName><forename type="first">J</forename><surname>Kari</surname></persName></author></analytic><monogr><title level="m">Proceedings of the Conference Fractals in Engineering</title><meeting>the Conference Fractals in Engineering<address><addrLine>Delft</addrLine></address></meeting><imprint><date type="published" when="1999"></date><biblScope unit="page" from="248" to="255"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b4"><analytic><title level="a" type="main">Finite automata computing real functions</title><author><persName><forename type="first">Ii</forename><surname>Culik</surname></persName></author><author><persName><forename type="first">K</forename><surname>Karhumäki</surname></persName></author><author><persName><forename type="first">J</forename></persName></author></analytic><monogr><title level="j">SIAM Journal on Computing</title><imprint><biblScope unit="volume">23</biblScope><biblScope unit="issue">4</biblScope><biblScope unit="page" from="789" to="814"></biblScope><date type="published" when="1994"></date></imprint></monogr></biblStruct><biblStruct xml:id="b5"><analytic><title level="a" type="main">Image compression using weighted finite automata</title><author><persName><forename type="first">Ii</forename><surname>Culik</surname></persName></author><author><persName><forename type="first">K</forename><surname>Kari</surname></persName></author><author><persName><forename type="first">J</forename></persName></author></analytic><monogr><title level="j">Computers & Graphics</title><imprint><biblScope unit="volume">17</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="305" to="314"></biblScope><date type="published" when="1993"></date></imprint></monogr></biblStruct><biblStruct xml:id="b6"><analytic><title level="a" type="main">Image-data compression using edge-optimizing algorithm for WFA inference</title><author><persName><forename type="first">Ii</forename><surname>Culik</surname></persName></author><author><persName><forename type="first">K</forename><surname>Kari</surname></persName></author><author><persName><forename type="first">J</forename></persName></author></analytic><monogr><title level="j">Information Processing and Management</title><imprint><biblScope unit="volume">30</biblScope><biblScope unit="issue">6</biblScope><biblScope unit="page" from="829" to="838"></biblScope><date type="published" when="1994"></date></imprint></monogr></biblStruct><biblStruct xml:id="b7"><monogr><title level="m" type="main">Handbook of Weighted Automata</title><author><persName><forename type="first">M</forename><surname>Droste</surname></persName></author><author><persName><forename type="first">W</forename><surname>Kuich</surname></persName></author><author><persName><forename type="first">H</forename><surname>Vogler</surname></persName></author><imprint><date type="published" when="2009"></date><publisher>Springer</publisher><pubPlace>Heidelberg</pubPlace></imprint></monogr></biblStruct><biblStruct xml:id="b8"><monogr><title level="m" type="main">Curves and Surfaces for Computer Aided Geometric Design</title><author><persName><forename type="first">G</forename><surname>Farin</surname></persName></author><imprint><date type="published" when="1990"></date><publisher>Academic Press</publisher><pubPlace>London</pubPlace></imprint></monogr></biblStruct><biblStruct xml:id="b9"><monogr><title level="m" type="main">Scalable vector graphics (SVG) 1.1 specification . World Wide Web Consortium</title><author><persName><forename type="first">J</forename><surname>Ferraiolo</surname></persName></author><author><persName><forename type="first">J</forename><surname>Fujisawa</surname></persName></author><author><persName><forename type="first">D</forename><surname>Jackson</surname></persName></author><imprint><date type="published" when="2003"></date></imprint></monogr></biblStruct><biblStruct xml:id="b10"><analytic><title level="a" type="main">Weighted finite automata for video compression</title><author><persName><forename type="first">U</forename><surname>Hafner</surname></persName></author><author><persName><forename type="first">J</forename><surname>Albert</surname></persName></author><author><persName><forename type="first">S</forename><surname>Frank</surname></persName></author><author><persName><forename type="first">M</forename><surname>Unger</surname></persName></author></analytic><monogr><title level="j">IEEE Journal on selected</title><imprint><biblScope unit="volume">16</biblScope><biblScope unit="page" from="108" to="119"></biblScope><date type="published" when="1998"></date></imprint></monogr></biblStruct><biblStruct xml:id="b11"><monogr><title level="m" type="main">Drawing an elliptical arc using polylines, quadratic or cubic Bézier curves</title><author><persName><forename type="first">L</forename><surname>Maisonobe</surname></persName></author><imprint><date type="published" when="2010"></date></imprint></monogr></biblStruct><biblStruct xml:id="b12"><monogr><title level="m" type="main">Truetype specifications</title><author><persName><forename type="first">Microsoft</forename><surname>Corporation</surname></persName></author><imprint><date type="published" when="2003"></date></imprint></monogr></biblStruct><biblStruct xml:id="b13"><monogr><title level="m" type="main">Algorithms for Graphics and Image Processing</title><author><persName><forename type="first">T</forename><surname>Pavlidis</surname></persName></author><imprint><date type="published" when="1982"></date><publisher>Computer Science Press</publisher></imprint></monogr></biblStruct><biblStruct xml:id="b14"><analytic><title level="a" type="main">On the definition of a family of automata</title><author><persName><forename type="first">M</forename><forename type="middle">P</forename><surname>Schützenberger</surname></persName></author></analytic><monogr><title level="j">Information and Control</title><imprint><biblScope unit="volume">4</biblScope><biblScope unit="issue">2-3</biblScope><biblScope unit="page" from="245" to="270"></biblScope><date type="published" when="1961"></date></imprint></monogr></biblStruct><biblStruct xml:id="b15"><monogr><title level="m" type="main">Drawing a circle with Bézier curves</title><author><persName><forename type="first">G</forename><forename type="middle">A</forename><surname>Stanislav</surname></persName></author><imprint><date type="published" when="2010"></date></imprint></monogr></biblStruct><biblStruct xml:id="b16"><analytic><title level="a" type="main">Parametric weighted finite automata for figure drawing</title><author><persName><forename type="first">G</forename><surname>Tischler</surname></persName></author></analytic><monogr><title level="m">CIAA 2004</title><editor>Domaratzki , M., Okhotin, A., Salomaa, K., Yu, S.</editor><meeting><address><addrLine>Heidelberg</addrLine></address></meeting><imprint><publisher>Springer</publisher><date type="published" when="2005"></date><biblScope unit="page" from="259" to="268"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b17"><analytic><title level="a" type="main">Properties and applications of parametric weighted finite automata</title><author><persName><forename type="first">G</forename><surname>Tischler</surname></persName></author></analytic><monogr><title level="j">Journal of Automata, Languages and Combinatorics</title><imprint><biblScope unit="volume">10</biblScope><biblScope unit="issue">23</biblScope><biblScope unit="page" from="347" to="365"></biblScope><date type="published" when="2005"></date></imprint></monogr></biblStruct><biblStruct xml:id="b18"><analytic><title></title></analytic><monogr><title level="j">Topographia Franconiae</title><imprint><date type="published" when="2010"></date></imprint></monogr></biblStruct><biblStruct xml:id="b19"><monogr><title></title><author><persName><forename type="first">G</forename><surname>Williams</surname></persName></author><imprint><date type="published" when="2010"></date><publisher>FontForge</publisher></imprint></monogr></biblStruct></listBibl></back></text></istex:refBibTEI><json:item><type>refBibs</type><uri>https://api.istex.fr/document/A5ED7EDB36189658E9EB60732554AFA39CAFDBF7/enrichments/refBibs</uri></json:item></enrichments></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Ticri/explor/TeiVM2/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000360 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000360 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Ticri
|area= TeiVM2
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:A5ED7EDB36189658E9EB60732554AFA39CAFDBF7
|texte= Ancient Typefaces and Parametric Weighted Finite Automata
}}
| This area was generated with Dilib version V0.6.31. |  |