Entry Engelfriet:1993:AW 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{Engelfriet:1993:AW,
author = "Joost Engelfriet and Hendrik Jan Hoogeboom",
title = "{$X$}-automata on $\omega$-words",
journal = j-THEOR-COMP-SCI,
volume = "110",
number = "1",
pages = "1--51",
day = "15",
month = mar,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:02 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=110&issue=1;
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=1993&volume=110&issue=1&aid=1182",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Leiden Univ., Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "accepting conditions; finite automata; finite-state
automata; formal languages; inverse X-transductions;
omega-words; topological upper bounds; X-automata",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- accepting,
82(1)141,
103(1)3,
112(2)255,
127(1)171
- bound,
72(2)251,
73(3)313,
74(2)121,
74(3)313,
74(3)329,
81(2)237,
82(1)19,
82(1)113,
82(1)157,
83(2)169,
85(1)155,
85(2)305,
86(2)267,
88(1)59,
91(2)265,
92(1)191,
93(2)279,
96(2)411,
97(2)233,
97(2)285,
98(2)289,
100(1)185,
100(1)223,
102(2)215,
102(2)253,
102(2)355,
106(2)221,
106(2)351,
107(1)77,
107(1)121,
108(2)251,
108(2)271,
108(2)311,
112(2)355,
112(2)419,
113(1)75,
116(1)195,
116(2)305,
116(2)415,
119(2)267,
120(2)169,
121(1)279,
123(1)95,
123(1)145,
123(2)377,
123(2)389,
125(2)329,
125(2)373,
127(2)395,
128(1)63,
129(1)193,
129(2)263,
129(2)279,
130(1)17,
130(1)49,
130(1)73,
130(1)85,
130(1)163,
130(1)175,
131(2)243,
131(2)331,
132(1)259,
132(1)377,
132(1)387,
133(1)23,
133(1)105,
134(1)189,
134(1)253,
136(2)527
- condition,
70(1)35,
70(1)151,
70(2)179,
72(1)27,
74(1)3,
75(1)111,
83(1)57,
83(2)189,
86(1)81,
86(2)233,
87(2)315,
88(2)269,
93(2)185,
93(2)227,
93(2)279,
94(1)101,
94(1)141,
94(2)335,
95(2)307,
97(1)143,
97(2)233,
100(1)157,
100(2)267,
100(2)325,
103(1)39,
105(1)7,
109(1)181,
111(1)89,
112(1)145,
112(2)413,
113(1)93,
118(2)301,
120(1)69,
120(2)197,
121(1)309,
126(2)183,
129(1)123,
131(2)271,
132(1)259
- finite-state,
72(2)265,
83(2)287,
85(1)53,
92(2)249,
106(1)135,
106(2)283,
108(1)83,
113(1)93,
129(2)323,
134(1)225,
134(2)329
- inverse,
76(2)243,
79(1)163,
87(1)1,
95(2)207,
100(2)325,
104(2)161,
123(2)273
- omega-words,
103(1)143
- state, finite-,
72(2)265,
83(2)287,
85(1)53,
92(2)249,
106(1)135,
106(2)283,
108(1)83,
113(1)93,
129(2)323,
134(1)225,
134(2)329
- topological,
72(1)3,
85(2)253,
87(2)347,
111(1)103,
111(1)191,
111(1)z,
112(2)383
- upper,
72(2)251,
74(2)121,
74(3)329,
82(1)113,
86(2)267,
91(2)265,
98(2)289,
100(1)185,
100(1)223,
102(2)253,
103(2)311,
106(2)221,
106(2)351,
108(2)251,
108(2)311,
111(1)59,
112(2)355,
112(2)419,
116(2)305,
119(2)267,
120(2)169,
123(1)95,
123(1)145,
129(1)193,
129(2)263,
129(2)279,
130(1)17,
130(1)73,
130(1)85,
133(1)105,
134(1)253
- word,
71(3)281,
71(3)381,
72(1)27,
72(1)39,
72(1)55,
73(3)335,
74(1)3,
79(1)195,
79(1)241,
81(1)147,
81(2)305,
82(1)71,
83(2)301,
85(1)33,
86(2)277,
88(1)83,
88(2)365,
92(1)19,
93(2)227,
94(2)199,
94(2)367,
96(2)325,
96(2)405,
99(2)327,
100(1)67,
102(2)253,
106(2)327,
106(2)373,
106(2)395,
108(1)3,
108(1)17,
108(1)45,
108(1)103,
108(1)z,
108(2)251,
108(2)311,
108(2)357,
112(2)187,
112(2)311,
115(1)43,
115(2)191,
115(2)243,
117(1)217,
119(2)267,
120(2)303,
123(1)55,
123(2)273,
126(2)237,
127(1)53,
129(2)263,
129(2)369,
131(2)271,
132(1)129,
132(1)415,
134(1)209,
134(1)225,
134(1)z,
134(2)529,
136(2)361
- words, omega-,
103(1)143