Entry Kaminski:1994:FMA from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Kaminski:1994:FMA,
author = "Michael Kaminski and Nissim Francez",
title = "Finite-memory automata",
journal = j-THEOR-COMP-SCI,
volume = "134",
number = "2",
pages = "329--363",
day = "21",
month = nov,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:34 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=134&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=134&issue=2&aid=1631",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Hong Kong Univ. of Sci. and
Technol., Kowloon, Hong Kong",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "classical Rabin-Scott finite-state automata; closure;
computation model; decidability; decision properties;
equality test; finite alphabets; finite automata;
finite-memory automata; finite-state automata;
generalization; infinite alphabets; substitution",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- alphabet,
71(3)381,
73(1)81,
73(3)279,
73(3)335,
76(2)261,
79(1)195,
81(1)147,
81(2)289,
83(2)287,
88(1)117,
92(1)33,
92(1)77,
92(1)87,
92(1)145,
95(2)187,
108(2)311,
108(2)345,
108(2)365,
113(1)35,
115(2)243,
115(2)359,
118(1)49,
123(1)61,
127(1)53,
131(2)311,
132(1)71,
132(1)415,
134(1)87,
134(1)209,
134(1)225
- classical,
73(2)155,
92(1)3,
94(2)295,
94(2)373,
99(2)177,
102(1)207,
105(1)141,
113(2)349,
114(2)317,
115(1)63,
123(1)61,
123(2)291,
123(2)341,
129(1)79,
135(1)11,
135(1)155
- closure,
70(2)251,
73(2)213,
76(2)261,
76(2)273,
78(2)377,
80(1)53,
81(1)117,
82(2)215,
82(2)389,
83(2)249,
85(1)171,
86(2)233,
88(2)191,
88(2)287,
91(1)71,
93(1)43,
93(2)227,
93(2)321,
96(2)285,
97(2)217,
100(1)157,
103(1)3,
108(2)185,
111(1)89,
116(1)95,
117(1)z,
120(2)293,
125(2)167,
125(2)243,
126(2)183,
127(1)25,
127(1)149,
127(2)287,
132(1)243
- decidability,
71(1)29,
71(2)265,
71(3)281,
72(1)39,
73(3)295,
74(1)3,
74(1)71,
74(3)341,
78(2)347,
79(1)37,
79(1)263,
80(1)77,
80(2)227,
80(2)303,
81(1)137,
81(2)269,
81(2)289,
82(1)19,
82(1)131,
85(1)33,
85(2)253,
87(1)25,
87(2)287,
88(2)269,
88(2)325,
89(1)33,
91(1)71,
91(1)101,
94(1)1,
94(2)367,
95(1)115,
95(2)187,
96(2)325,
98(1)5,
98(2)199,
99(2)291,
101(1)143,
103(1)39,
103(1)143,
103(2)387,
106(1)87,
106(1)135,
106(2)337,
108(1)103,
108(2)237,
109(1)83,
110(1)145,
110(2)419,
112(2)311,
113(1)93,
113(1)119,
114(1)93,
116(2)339,
117(1)39,
118(2)167,
118(2)193,
120(2)229,
121(1)71,
121(1)89,
123(2)315,
126(1)31,
126(1)113,
127(1)1,
127(1)69,
127(1)149,
127(2)229,
129(1)167,
129(2)419,
130(2)239,
131(2)243,
131(2)271,
131(2)431,
131(2)441,
132(1)37,
132(1)85,
132(1)129,
132(1)395,
134(1)107,
134(1)175,
134(2)287,
134(2)311,
134(2)365,
135(2)345
- decision,
71(3)281,
72(1)39,
72(2)265,
74(1)71,
80(2)227,
81(1)137,
81(2)169,
82(1)19,
84(1)127,
84(2)199,
85(1)33,
93(2)279,
95(1)115,
98(1)137,
98(1)z,
106(2)351,
107(1)63,
110(2)419,
112(1)145,
112(2)371,
113(1)119,
118(2)193,
119(1)173,
120(2)197,
123(2)183,
125(2)339,
126(2)183,
127(1)25,
128(1)179,
133(2)307,
134(2)365,
134(2)387,
135(1)139
- equality,
75(3)335,
80(2)263,
87(1)203,
94(1)1,
98(1)5,
98(1)41,
102(2)355,
110(1)99,
114(2)273,
120(1)1,
122(1)225
- finite-state,
72(2)265,
83(2)287,
85(1)53,
92(2)249,
106(1)135,
106(2)283,
108(1)83,
110(1)1,
113(1)93,
129(2)323,
134(1)225
- Francez, Nissim,
131(1)139
- generalization,
70(1)159,
79(1)111,
87(1)203,
91(1)57,
96(1)249,
98(2)347,
108(2)251,
132(1)209,
133(2)307
- infinite,
73(2)121,
74(1)71,
74(2)121,
74(2)227,
75(1)157,
76(2)309,
82(2)177,
83(2)301,
84(2)165,
86(1)3,
86(2)277,
88(1)83,
88(2)365,
93(2)227,
93(2)327,
94(2)161,
96(1)157,
96(1)z,
99(1)121,
100(1)105,
103(1)143,
103(2)165,
103(2)191,
104(1)3,
107(2)305,
108(1)45,
112(1)145,
112(2)277,
112(2)413,
113(1)35,
115(1)63,
116(1)3,
123(1)3,
123(1)55,
125(2)167,
126(1)77,
126(2)183,
129(1)1,
129(2)385,
132(1)37,
132(1)337,
134(1)131
- state, finite-,
72(2)265,
83(2)287,
85(1)53,
92(2)249,
106(1)135,
106(2)283,
108(1)83,
110(1)1,
113(1)93,
129(2)323,
134(1)225
- substitution,
70(1)3,
75(1)45,
75(1)139,
80(1)1,
81(2)169,
86(1)3,
86(2)277,
98(1)115,
99(2)327,
103(2)283,
107(2)209,
107(2)333,
117(1)113,
124(1)71,
124(1)93,
127(1)149,
127(1)181,
132(1)209,
132(1)243
- test,
77(3)331,
78(2)347,
84(2)225,
88(1)117,
95(2)339,
103(2)283,
116(2)305,
125(1)131