Entry Ibarra:1993:SFA 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{Ibarra:1993:SFA,
author = "Oscar H. Ibarra and Nicholas Q. Tr{\^a}n",
title = "Synchronized finite automata and {$2$DFA} reductions",
journal = j-THEOR-COMP-SCI,
volume = "115",
number = "2",
pages = "261--275",
day = "19",
month = jul,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:23 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=115&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=1993&volume=115&issue=2&aid=1237",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., California Univ., Santa
Barbara, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "2DFA reductions; deterministic automata; finite
automata; formal languages; synchronisation;
synchronised finite automata; synchronization; tight
hierarchy; two-way deterministic finite automata; unary
regular languages",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- $2$,
70(3)277,
70(3)305,
70(3)343,
82(1)1,
92(2)227,
112(2)355,
129(2)207,
132(1)151,
132(1)209
- hierarchy,
73(3)313,
80(2)203,
81(1)77,
83(1)97,
83(2)313,
83(2)323,
84(2)199,
85(2)305,
88(2)297,
91(1)71,
95(1)97,
96(2)325,
96(2)345,
97(2)183,
98(2)249,
98(2)289,
100(1)45,
101(2)289,
102(2)215,
104(2)235,
106(2)283,
112(2)339,
112(2)413,
113(1)167,
115(2)225,
116(1)33,
119(2)293,
120(2)293,
123(2)239,
125(2)355,
127(1)123,
129(2)323,
132(1)1,
134(2)263,
134(2)287
- Ibarra, Oscar H.,
112(2)391,
125(2)243
- reduction,
72(2)133,
81(2)189,
82(1)141,
88(1)1,
88(2)269,
89(2)207,
92(1)3,
93(1)75,
96(2)305,
97(2)245,
98(1)137,
99(1)1,
100(1)205,
103(2)283,
104(1)109,
107(1)145,
107(2)333,
108(2)185,
111(1)145,
115(2)371,
118(2)193,
121(1)279,
123(1)95,
123(2)407,
126(2)259,
127(1)99,
127(1)149,
131(2)441,
132(1)179,
132(1)229,
132(1)403,
135(1)67,
135(1)111,
135(1)z
- regular,
70(2)213,
73(1)91,
73(3)329,
74(3)341,
75(1)157,
76(2)261,
76(2)273,
76(2)323,
77(1)97,
79(1)25,
81(2)305,
82(1)19,
83(2)287,
84(2)293,
85(1)117,
86(2)233,
87(1)43,
87(2)315,
88(1)139,
88(2)287,
88(2)351,
91(1)85,
91(1)101,
96(2)285,
97(2)217,
98(2)163,
99(1)79,
100(1)67,
101(1)133,
103(2)191,
103(2)409,
104(2)161,
106(1)61,
106(1)119,
108(1)17,
108(2)393,
112(2)187,
112(2)413,
116(2)305,
116(2)373,
119(2)267,
120(2)197,
124(2)329,
125(2)315,
125(2)361,
127(2)287,
129(1)187,
131(2)311,
131(2)463,
132(1)71,
133(1)49,
134(1)107,
134(1)119,
134(1)175,
134(1)189,
134(1)253,
134(2)537
- synchronisation,
77(1)97,
90(1)171,
91(1)57,
96(2)411,
127(2)313,
128(1)63,
132(1)319,
134(1)87
- synchronization,
76(2)285,
77(1)97,
87(1)43,
90(1)171,
91(1)57,
96(2)411,
127(2)313,
128(1)63,
132(1)319,
134(1)87
- synchronized,
76(2)285,
96(2)411,
99(2)243,
108(1)45,
108(2)393,
127(1)25,
132(1)319,
134(1)87
- tight,
72(2)251,
85(1)205,
108(2)251,
108(2)311
- Trân, Nicholas Q.,
112(2)391
- two-way,
74(3)341,
79(1)3,
82(1)113,
93(1)43,
108(2)271,
117(1)39
- unary,
82(1)151,
120(1)123,
129(2)337,
131(2)441,
134(1)225
- way, two-,
74(3)341,
79(1)3,
82(1)113,
93(1)43,
108(2)271,
117(1)39