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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adobe Systems Inc: Adobe Type 1 Font Format, 2nd edn. Addison Wesley, Reading (1990)
Adobe Systems Inc: PostScript Language Reference, 3rd edn. Addison-Wesley, Reading (1999)
Adobe Systems Inc: PDF Reference Version 1.6, 5th edn. Adobe Press (2004)
Albert, J., Kari, J.: Parametric weighted finite automata and iterated function systems. In: Proceedings of the Conference Fractals in Engineering, Delft, pp. 248–255 (1999)
Anonymous. English Wikipedia article ”Typeface” (2010), http://en.wikipedia.org/wiki/Typeface
Culik II, K., Karhumäki, J.: Finite automata computing real functions. SIAM Journal on Computing 23(4), 789–814 (1994)
Culik II, K., Kari, J.: Image compression using weighted finite automata. Computers & Graphics 17(3), 305–314 (1993)
Culik II, K., Kari, J.: Image-data compression using edge-optimizing algorithm for WFA inference. Information Processing and Management 30(6), 829–838 (1994)
Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata. Springer, Heidelberg (2009)
Farin, G.: Curves and Surfaces for Computer Aided Geometric Design. Academic Press, London (1990)
Ferraiolo, J., Fujisawa, J., Jackson, D.: Scalable vector graphics (SVG) 1.1 specification. World Wide Web Consortium, Recommendation REC-SVG11-20030114 (2003)
Hafner, U., Albert, J., Frank, S., Unger, M.: Weighted finite automata for video compression. IEEE Journal on selected areas in communication 16, 108–119 (1998)
Maisonobe, L.: Drawing an elliptical arc using polylines, quadratic or cubic Bézier curves (2010), http://www.spaceroots.org/documents/ellipse/index.html
Microsoft Corporation. Truetype specifications (2003), http://www.microsoft.com/typography/specs/default.htm
Pavlidis, T.: Algorithms for Graphics and Image Processing. Computer Science Press (1982)
Schützenberger, M.P.: On the definition of a family of automata. Information and Control 4(2-3), 245–270 (1961)
Stanislav, G.A.: Drawing a circle with Bézier curves (2010), http://www.whizkidtech.redprince.net/bezier/circle/
Text Encoding Initiative (TEI) Consortium. TEI: P5 Guidelines (2010), http://www.tei-c.org/Guidelines/P5/
Tischler, G.: Parametric weighted finite automata for figure drawing. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 259–268. Springer, Heidelberg (2005)
Tischler, G.: Properties and applications of parametric weighted finite automata. Journal of Automata, Languages and Combinatorics 10(2/3), 347–365 (2005)
University Library of Würzburg. Topographia Franconiae (2010), http://franconica.uni-wuerzburg.de/Franconica/ortsregister.html
Williams, G.: FontForge (2010), http://fontforge.sourceforge.net/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Albert, J., Tischler, G. (2011). Ancient Typefaces and Parametric Weighted Finite Automata. In: Calude, C.S., Rozenberg, G., Salomaa, A. (eds) Rainbow of Computer Science. Lecture Notes in Computer Science, vol 6570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19391-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-19391-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19390-3
Online ISBN: 978-3-642-19391-0
eBook Packages: Computer ScienceComputer Science (R0)