Merging the final RCS state of a file.
[algebraic-prog-equiv.git] / multiautomata.bib
blobeaec615510dca500c6c969cdca4b4707cbc302d7
1 @Misc{perrin:automata-formallangs,
2 title = "Automata and Formal Languages",
3 author = "Dominique Perrin",
4 year = "2003",
5 month = may # "~02",
6 abstract = "This article provides an introduction to the theory of
7 automata and formal languages. The elements are
8 presented in a historical perspective and the links
9 with other areas are underlined. In particular,
10 applications of the field to linguistics, software
11 design, text processing, computational algebra or
12 computational biology are given.",
13 annote = "The Pennsylvania State University CiteSeer Archives",
14 language = "en",
15 oai = "oai:CiteSeerPSU:593784",
16 rights = "unrestricted",
17 subject = "Dominique Perrin Automata and Formal Languages",
18 URL = "http://citeseer.ist.psu.edu/593784.html;
19 http://www-igm.univ-mlv.fr/~perrin/Recherche/Enciclopedia/article.pdf",
22 @InProceedings{DroZha01,
23 author = "Droste and Zhang",
24 title = "Rational Transformations of Formal Power Series",
25 booktitle = "ICALP: Annual International Colloquium on Automata,
26 Languages and Programming",
27 year = "2001",
30 @Article{DroZha03,
31 author = "Droste and Zhang",
32 title = "On Transformations of Formal Power Series",
33 journal = "INFCTRL: Information and Computation (formerly
34 Information and Control)",
35 volume = "184",
36 year = "2003",
37 note = {\toRead},
40 @Article{Droste:1994:KTR,
41 author = "M. Droste",
42 title = "A {Kleene} Theorem for Recognizable Languages over
43 Concurrency Monoids",
44 journal = "Lecture Notes in Computer Science",
45 volume = "820",
46 pages = "388--??",
47 year = "1994",
48 CODEN = "LNCSD9",
49 ISSN = "0302-9743",
50 bibdate = "Sun Oct 25 10:56:15 1998",
51 acknowledgement = ack-nhfb,
52 note = {\toRead},
55 @InProceedings{DroKus03,
56 author = "Droste and Kuske",
57 title = "Skew and Infinitary Formal Power Series",
58 booktitle = "ICALP: Annual International Colloquium on Automata,
59 Languages and Programming",
60 year = "2003",
61 note = {\toRead},
64 @Article{DroKus99,
65 author = "Droste and Kuske",
66 title = "On Recognizable Languages in Divisibility Monoids",
67 journal = "FCT: Fundamentals (or Foundations) of Computation
68 Theory",
69 volume = "12",
70 year = "1999",
71 note = {\toRead},
74 @Article{DroGas99,
75 author = "Droste and Gastin",
76 title = "The {Kleene}-{Schutzenberger} Theorem for Formal Power
77 Series in Partially Commuting Variables",
78 journal = "INFCTRL: Information and Computation (formerly
79 Information and Control)",
80 volume = "153",
81 year = "1999",
82 note = {\toRead},
85 @Book{BerstelR-rational,
86 author = "Jean Berstel and Christophe Reutenauer",
87 address = "Berlin-Heidelberg-New York",
88 number = "12",
89 publisher = "Springer",
90 series = "EATCS Monographs on Theoretical Computer Science",
91 title = "Rational series and their languages",
92 year = "1988",
93 annote = "Rational formal power series in several
94 non-commutative variables are considered in an
95 algebraic framework. The relationship to formal
96 language and code theory, as well as arithmetic
97 properties for rational series in one variable and
98 series over semiring extensions are studied.",
99 note = {\toRead},