1 Literatur

1
Literatur
Aho, Alfred V.; Sethi, Ravi und Jeffrey D. Ullman (1986). Compilers. Principles, Techniques
and Tools. Addison-Wesley Publishing Company.
Allauzen, Cyril und Mehryar Mohri (2004tcs3). An Optimal Pre-Determinization Algorithm for
Weighted Transducers. In: Theoretical Computer Science, 328(1-2), S. 3-18,
November 2004. http://www.cs.nyu.edu/~allauzen/pdf/tcs3.pdf oder
http://www.cs.nyu.edu/~mohri/postscript/tcs3.pdf
Allauzen, Cyril und Mehryar Mohri (2003finite). Finitely subsequential transducers.
International Journal of Foundations of Computer Science, 14(6), S. 983-994, 2003.
http://www.cs.nyu.edu/~allauzen/pdf/finite.pdf oder
http://www.cs.nyu.edu/~mohri/postscript/finite.ps
Allauzen, Cyril und Mehryar Mohri (2003twins). Efficient Algorithms for Testing the Twins
Property. In: Journal of Automata, Languages and Combinatorics 8 (2), S. 117-144.
http://www.cs.nyu.edu/~mohri/postscript/twins.pdf oder
http://www.cs.nyu.edu/~allauzen/pdf/twins.pdf
Bachmann, P. (1992). Mathematische Grundlagen der Informatik. Berlin: Akademie-Verlag.
Barton Jr., G. Edward; Berwick, Robert, C. und Eric Sven Ristad (1987). Computational
Complexity and Natural Language. MIT Press.
Béal, Marie-Pierre; Carton, Olivier; Prieur, Christophe und Jacques Sakarovitch (2003):
Squaring transducers: an efficient procedure for deciding functionality and
sequentiality. In: Theoretical Computer Science, Volume 292, 1: 45 - 63
Beesley, Kenneth R. und Lauri Karttunen (2003). Finite-State Morphology. Distributed for the
Center for the Study of Language and Information. (CSLI-SCL Studies in
Computational Linguistics).
Berk, Elliot (1997ff). JLex - A lexical analyzer generator for Java. Department of Computer
Science, Princeton University. (Dokumentation, Benutzungsanleitung und Quellcode)
Berry, Gérard und Ravi Sethi (1986). From regular expressions to deterministic automata. In:
Theoretical Computer Science 48 (3), S. 117-126.
Berstel, Jean (1979). Transductions and Context-Free Languages. (Teubner Studienbücher
Informatik). Stuttgart: B.G. Teubner.
Haenelt 2008
Endliche Automaten: Literatur
Seite 1 von 7
Berstel, Jean und Dominique Perrin (2004). Algorithms on Words. In: M.Lothaire (ed).
Applied Combinatorics on Words. www-igm.univ-mlv.fr/~berstel/Lothaire/index.html
Brill, Eric (1992). A simple rule-based part of speech tagger. In: Third Conference on Applied
Natural Language Processing, S. 152-155, Trento, Italien.
(http://www.cs.jhu.edu/~brill/)
Brüggemann-Klein, Anne (1992). Regular Expressions into Finite Automata, Proceedings of
Latin '92, 1st Latin American Symposium on Theoretical Informatics, São Paulo,
Brazil, April 6-10, 1992. (Lecture Notes in Computer Science 583) Heidelberg:
Springer Verlag.
Choffrut, Christian (1978). Contributions à l’étude de quelques familles remarquables de
functions rationelles. Ph.D. thesis (these de doctorat d’Etat), Université Paris 7, LITP:
Paris.
Choffrut, Christian (1977). Une characterisation des functions séquentielles et des fonctions
sous-séquentielles en tant que relations rationelles. In: Theoretical Computer
Science, 5, S. 325-338.
Chomsky, Noam (1956). Three models for the description of language, IRE Transactions on
Information Theory, 2 (1956), S. 113-124
Conway, John Horton (1971). Regular Algebra and Finite Machines. London: Chapman and
Hall.
Eberhard, Simone; Katja Niemann und Ineta Sējāne (2004). Determinisierung von
Transduktoren nach Mohri. Seminarreferat 28.06.2004.
kontext.fraunhofer.de/haenelt/kurs/Referate/Eberhard_Niemann_Sejane_S2004/Algor
ithmusMohri.pdf
Eilenberg, Samuel (1974). Automata, Languages and Machines. New York: Academic Press.
Elgot, Calvin C. und Jorge E. Mezei (1965). On relations defined by generalized finite
automata. In: IBM Journal of Research and Development, 9, S. 47-65, Januar.
http://www.research.ibm.com/journal/rd/091/ibmrd0901E.pdf
FLEX http://www.gnu.org/software/flex/
Fox, Christopher J. (1992). Lexical Analysis and Stoplists. In: Frakes, William; Baeza-Yates,
Ricardo (eds.): Information Retrieval. Data Structures and Algorithms. Prentice Hall:
New Jersey, 1992, Kap. 7 (S.102-130) http://wwwlsi.upc.es/~rbaeza/iradsbook/irbook.html
http://www.dcc.uchile.cl/~rbaeza/iradsbook/ (Inhaltsverzeichnis und Programme in C)
Haenelt 2008
Endliche Automaten: Literatur
Seite 2 von 7
Giammarresi, Dora, Jean-Luc Ponty, und Derick Wood (1998). Glushkov and Thompson
Constructions: A Synthesis, Tech. Report 98-17, Universita' Ca' Foscari di Venezia.
Ginsburg, Seymour (1966). The Mathematical Theory of Context-Free Languages. New
York.
Glushkov, Viktor M.(1961). The abstract theory of automata. In: Russian Mathematical
Surveys 16, S. 1-53.
Glushkov, Viktor M.(1960). On Synthesis Algorithm for Abstract Automata, Ukr. Mathem.
Zhurnal, 12(2), S.147-156.
Hopcroft, John E. und Jeffrey D. Ullman (1988). Einführung in die Automatentheorie, formale
Sprachen und Komplexitätstheorie. Bonn u. a.: Addison-Wesley, 1988 (engl. Original
Introduction to automata theory, languages and computation).
Hopcroft, John E., Rajeev Motwani und Jeffrey D. Ullman (2002). Einführung in die
Automatentheorie, Formale Sprachen und Komplexität. Pearson Studium
engl. Original: Introduction to Automata Theory, Languages and Computation.
Addison-Wesley. www-db.stanford.edu/~ullman/ialc.html
Jurafsky, Daniel und James H. Martin (2000). Speech and Language Processing. An
Introduction to Natural Language Processing, Computational Linguistics, and Speech
Recognition Upper Saddle River, N.J.: Prentice Hall.
Karttunen, Lauri (2003): Finite-State Technology. In: Ruslan Mitkov (Hg.): The Oxford
Handbook of Computational Linguistics. Oxford University Press.
Kempe, André (1998) Look-back and look-ahead in the conversion of hidden Markov models
into finite-state transducers. In Proceedings of the 3rd International Conference on
New Methods in Natural Language Processing (NeMLaP'98), S. 29-37, Sydney,
Australia.
Kempe, André (1997). Finite state transducers approximating hidden Markov models. In:
Proceedings of the 35th Annual Meeting of the Association for Computational
Linguistics. S. 460-467. Madrid, Spanien.
Kleene, Stephen Cole (1956). Representations of Events in Nerve Sets and Finite Automata,
In: C. E. Shannon and J. McCarthy, Hrsg., Automata Studies, S. 3-42, Princeton, NJ,
1956. Princeton University Press.
Kornai, András (Ed.) (1999). Extended Finite State Models of Language. (Studies in Natural
Language Processing). Cambridge: Cambridge University Press.
Haenelt 2008
Endliche Automaten: Literatur
Seite 3 von 7
Kozen, Dexter (1994). A Completeness Theorem for Kleene Algebras and the Algebra of
Regular Events. In: Information and Computation 110:2 (Mai 1994), S. 366-390.
Kozen, Dexter (1990). On Kleene algebras and closed semirings. In: Branislav Rovan (Hg.),
Proceedings of Mathematical Foundations of Computer Science, MFCS’90, (Lecture
Notes in Computer Science, Band 452). Berlin, Heidelberg, New York: Springer. S.
26-47. http://www.cs.cornell.edu/kozen/papers/kacs.ps.
Knuth, Donald E.; James H. Morris und Vaughan R. Pratt (1977). Fast Pattern Matching in
Strings. SIAM Journal of Computing 6, 2, 323-350.
Kuich, Werner und Arto Saloma (1986). Semirings, Automata, Languages. Berlin /
Heidelberg / New York / Tokyo: Springer-Verlag.
Kunze, Jürgen (2001). Computerlinguistik. Voraussetzungen, Grundlagen, Werkzeuge.
Vorlesungsskript. Humboldt Universität zu Berlin. http://www2.rz.huberlin.de/compling/Lehrstuhl/Skripte/Computerlinguistik_1/index.html
Lampugnani, Vittorio Magnago (Hrsg.) (1983). Lexikon der Architektur des 20. Jahrhunderts.
Stuttgart: Verlag Gert Hatje,
Laporte, Eric (2004). Symbolic natural language processing. In: M.Lothaire (ed). Applied
Combinatorics on Words. www-igm.univ-mlv.fr/~berstel/Lothaire/index.html
Lawson, Mark V. (2005). Finite automata. In: Hritsu-Varsakelis, D. und W.S.Levine (Hg).:
Handbook of networked and embedded Control Systems.
Lawson, Mark V. (2004). Finite Automata. Boca Raton, London, New York, Washington D.C.:
Chapman&Hall/CRC.
McCulloch, Warren S. und Walter Pitts (1943). A logical calculus of the ideas immanent in
nervous activity. In: Bulletin of Mathematical Biophysics 5, 115 -133.
McNaughton, Robert und Hisao Yamada (1960). Regular expressions and state graphs for
automata. In IEEE Transactions on Electronic Computers 9 (1): S. 39-47.
Mealy, George H. (1955). A method for synthesizing sequential circuits. Bell System
Technical Journal 34:5, 1045-1079.
Mohri, Mehryar (2004). Weighted Finite-State Transducer Algorithms: An Overview.
In :Carlos Martín-Vide, Victor Mitrana, und Gheorghe Paun, Hrsg., Formal Languages
and Applications. Band 148, VIII, 620 S. Berlin: Springer Verlag, 2004.
http://www.cs.nyu.edu/~mohri/postscript/fla.pdf
Haenelt 2008
Endliche Automaten: Literatur
Seite 4 von 7
Mohri, Mehryar (200). Minimization Algorithms for Sequential Transducers. In: Theoretical
Computer Science 234, S. 177-201.
Mohri, Mehryar (1997). Finite State Transducers in Language and Speech Processing. In:
Computational Linguistics, 23, 2, 1997, S. 269-311.
http://citeseer.nj.nec.com/mohri97finitestate.html
Mohri, Mehryar (1996). On some Applications of finite-state automata theory to natural
language processing. In: Journal of Natural Language Egineering, 2, S. 1-20.
Mohri, Mehryar (1994a). Compact representations by finite-state transducers. In: Meeting of
the Association for Computational Linguistics (ACL 94), Proceedings of the
Conference, Las Cruces, New Mexico. ACL.
Mohri, Mehryar (1994b). Minimization of Sequential Transducers. In: Maxime Crochemore
and Dan Gusfield, Hrsg., Proceedings of the 5th Annual Symposium on Combinatorial
Pattern Matching (CPM '94). (Lecture Notes in Computer Science Band 807), S. 151163, Asilomar, California, June 5-8 1994. Berlin-NY: Springer-Verlag.
Mohri, Mehryar und Michael Riley (2002). Weighted Finite-State Transducers in Speech
Recognition (Tutorial). Teil 1: http://www.research.att.com/~mohri/postscript/icslp.ps,
Teil 2: http://www.research.att.com/~mohri/postscript/icslp-tut2.ps
Mohri, Mehryar, Fernando C.N. Pereira und Michael Riley (2000). The Design Principles of a
Weighted Finite-State Transducer Library. In: Theoretical Computer Science, 231, S.
17-32.
Moore, Edward F. (1956). Gedanken experiments on sequential machines. In: Automata
Studies, S. 129-153, Princeton: Princeton University Press.
Myhill, John (1957). Finite automata and representation of events. Wright Air Development
Center Report. Dayton.
Nerode, Anil (1958). Linear automaton transformations. In: Proceedings of the American
Mathematical Society 9 (1958), S. 541-544.
Partee, Barbara H., Alice ter Meulen und Robert E. Wall (1993). Mathematical Methods in
Linguistics. Kluwer Academic Publishers.
Perrin, Dominique (1990). Finite Automata. In: J. van Leeuwen (ed.): Handbook of
Theoretical Computer Science. Elsevier Science Publishers B.V., S. 3-57.
Pin, Jean-Eric (1998). Tropical Semrings. In: Jeremy Gunawardena (éd.), Idempotency,
Cambridge: Cambridge University Press, (1998), S. 50-69.
Haenelt 2008
Endliche Automaten: Literatur
Seite 5 von 7
http://www.liafa.jussieu.fr/~jep/PDF/Tropical.pdf (auch: Laboratoire d'Informatique
Algorithmique, Fondements et Applications, Research Report 1995-109).
Piskorski, Jakub (2002). DFKI Finite-State Machine Toolkit.Research Report RR-02-04.
Deutsches Forschungszentrum für Künstliche Intelligenz GmbH. Saarbrücken.
www.coli.uni-sb.de/publikationen/ softcopies/ Piskorski:2002:FSM.pdf
Roche, Emmanuel und Schabes, Yves (1997). Finite-State Language Processing.
Cambridge, Mass.: MIT Press.
Roche, Emmanuel und Schabes, Yves (1997t). Deterministic Part-of-Speech Tagging with
Finite-State-Transducers. In: Emmanuel Roches und Yves Schabes 1997, S. 205239.
Roche, Emmanuel (1993). Analyse Syntaxique Transformationelle du Français par
Transducteurs et Lexique-Grammaire. Ph.D. thesis, Université Paris 7.
Schulz, Klaus U. (2004). Mathematische Grundlagen der Linguistik und Informatik. Teil 1:
Von Mengen zur Aussagenlogik. Vorlesungsskript 22.04.2004 http://www.cis.unimuenchen.de/people/Schulz/SkriptMatheI_03/MatheI.pdf
Schützenberger, Marcel Paul (1977). Sur une variante des functions séquentielles. In:
Theoretical Computer Science. 4(1), S. 47-57.
Schützenberger, Marcel Paul (1965). A Remark on Incompletely Specified Automata. In:
Information and Control 8 (1965), S. 373-376.
Schützenberger, Marcel Paul (1961). A Remark on Finite Transducers. Information and
Control, 4(2-3), S. 185-196
Sedgewick, Robert (1992). Algorithmen in C++. München; Paris; Reading, Mass. et al.:
Addison-Wesley. http://www.cs.princeton.edu/~rs/
Sourjikova, Eva (2005). Local Extension Algorithmus nach Roche und Schabes (Part-ofSpeech-Tagging mit Transduktoren). Seminarreferat, Folien. 11.06.2005. 60 S.
http://kontext.fraunhofer.de/haenelt/kurs/Referate/Andris_Frick_Sourjikova_S2005/Lo
calExtension_Algorithm.pdf bzw. ppt
Standish, Thomas A.(1998). Data Structures in Java. Addison Wesley Longman.
Starke, Peter H. (2000). Logische Grundlagen der Informatik. Skript zur Vorlesung
Theoretische Informatik I. Humboldt Universität zu Berlin. http://www2.informatik.huberlin.de/lehrstuehle/automaten/logik/skript.pdf
Starke, Peter H. (1969). Abstrakte Automaten. Berlin: VEB Deutscher Verlag der
Wissenschaften.
Haenelt 2008
Endliche Automaten: Literatur
Seite 6 von 7
Thompson, Ken (1968). Regular expression search algorithms. In: CACM 11(6): 419-422.
Turau, Volker (1996). Algorithmische Graphentheorie. Bonn; Paris; Reading, Mass. [u.a.]:
Addison-Wesley.
Turing, Alan M. (1936). On computable numbers with an application to the
Entscheidungsproblem. Proceedings of the London Mathematical Society, 2: 42, S.
230-265 und 43, S. 544-546.
Haenelt 2008
Endliche Automaten: Literatur
Seite 7 von 7