Merging the final RCS state of a file.
[algebraic-prog-equiv.git] / automata.bib
blob3ef88b6eff8c0378ecd399b7220c8860215fd4eb
1 @Article{RS,
2 author = "M. O. Rabin and D. Scott",
3 title = "Finite automata and their decision problems",
4 journal = "IBM Journal of Research and Development",
5 volume = "3",
6 number = "??",
7 pages = "114--125",
8 year = "1959",
9 CODEN = "IBMJAE",
10 ISSN = "0018-8646",
11 MRclass = "93.00 (02.00)",
12 MRnumber = "21 \#2559",
13 acknowledgement = ack-nhfb,
14 reviewer = "J. McCarthy",
15 mrnumber-url = "http://www.ams.org/mathscinet-getitem?mr=21%232559",
16 note = {\url!http://www.research.ibm.com/journal/rd/032/ibmrd0302C.pdf!},
19 @Article{Let-equiv-cancellable,
20 author = "ìÅÔÉÞÅ×ÓËÉÊ, á.á.",
21 title = "üË×É×ÁÌÅÎÔÎÏÓÔØ Á×ÔÏÍÁÔÏ× ÏÔÎÏÓÉÔÅÌØÎÏ ÐÏÌÕÇÒÕÐÐ Ó ÓÏËÒÁÝÅÎÉÅÍ",
22 journal = "ðÒÏÂÌÅÍÙ ËÉÂÅÒÎÅÔÉËÉ",
23 volume = "27",
24 pages = "195--212",
25 year = "1973",
28 @Book{Berstel-transductions,
29 author = "Jean Berstel",
30 title = "Transductions and Context-Free-Languages",
31 publisher = "B.G. Teubner",
32 address = "Stuttgart",
33 year = "1979",
34 ISBN = "3-519-02340-7",
35 descriptor = "AFL, Dyck Sprachen, Iterative Paare, Kegel,
36 Kontextfreie Erzeuger, Kontextfreie Sprache, Lineare
37 Sprache, Rationale Uebersetzungen, Syntaktisches Lemma,
38 Unterfamilien der kontextfreien Sprachen,
39 Zaehlersprachen",
40 annote = "Gegenstand des Buchs ist die algebraische (AFLl)
41 Theorie der kontextfreien Sprachen und ihrer
42 Unterfamilien, insbesondere der linearen Sprachen, Lin,
43 und der Zaehlersprachen Rocl. Statt der
44 Charakterisierung von Sprachen durch Grammatiken und
45 Automaten stehen hier algebraische (d.h.
46 Abschlusseigenschaften) und kombinatorische
47 Eigenschaften im Vordergrund des Interesses. Das Buch
48 beschreibt den derzeitigen (1. 1. 80) Stand der
49 Kenntnisse ueber die Struktur der kontextfreien
50 Unterfamilien. Es ist als Lehrbuch fuer eine
51 Spezialvorlesung ueber formale Sprachen geeignet.",
52 note = {\toRead},
55 @Book{KotSab,
56 author = {ëÏÔÏ×, ÷.å. and óÁÂÅÌØÆÅÌØÄ, ÷.ë.},
57 title = {ôÅÏÒÉÑ ÓÈÅÍ ÐÒÏÇÒÁÍÍ},
58 publisher = {îÁÕËÁ},
59 year = {1991},
60 address = {í.},
63 @Article{Ibarra-decision,
64 author = "O. H. Ibarra",
65 title = "Reversal-Bounded Multicounter Machines and Their
66 Decision Problems",
67 journal = "Journal of the ACM",
68 volume = "25",
69 number = "1",
70 pages = "116--133",
71 month = jan,
72 year = "1978",
73 CODEN = "JACOAH",
74 ISSN = "0004-5411",
75 bibdate = "Thu Oct 27 00:02:57 1994",
76 acknowledgement = ack-nhfb,
77 annote = "For some variants of two-way multicounter machines the
78 paper investigates the decidability of the emptiness,
79 infiniteness, disjointness, containment, universe, and
80 equivalence problems. In particular, it shows
81 decidability of these problems for deterministic
82 two-way multicounter machines whose input and counters
83 are reversal-bounded.",
84 note = {\toRead},