Entry Pecuchet:1985:TWF from tcs1985.bib
Last update: Thu Sep 27 02:46:57 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{Pecuchet:1985:TWF,
author = "J.-P. Pecuchet",
title = "Two-way finite automata and finite words",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "1",
pages = "115--122",
month = jan,
year = "1985",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Lab. d'Inf., Fac. des Sci., Mont-Saint-Aigman,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite automata; finite words; formal languages;
omega-language; regular automata; two-way finite
automata",
language = "French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Pecuchet, J.-P.,
47(1)95
- regular,
35(1)17,
35(1)43,
35(2)191,
35(2)313,
36(1)113,
36(2)173,
38(1)133,
38(2)223,
38(2)307,
39(2)155,
40(2)131,
40(2)257,
42(1)1,
43(2)277,
44(2)155,
44(2)237,
45(2)193,
46(1)53,
46(2)175,
47(3)247,
48(1)101,
48(1)117,
52(1)59,
52(3)177,
53(2)169,
54(2)139,
54(2)237,
54(2)331,
55(1)1,
58(1)69,
61(1)25,
61(2)283,
65(1)85,
66(1)55,
66(3)233,
66(3)247,
66(3)341,
67(2)261,
68(3)239,
68(3)277
- two-way,
39(2)267,
44(1)111,
47(2)149,
63(2)141,
66(3)273
- way, Two-,
39(2)267
- way, two-,
39(2)267,
44(1)111,
47(2)149,
63(2)141,
66(3)273
- word,
35(1)1,
35(2)337,
38(1)117,
38(1)137,
39(2)281,
40(1)13,
41(1)61,
43(1)59,
44(1)107,
44(2)175,
44(2)199,
45(1)63,
47(2)191,
47(3)335,
48(1)35,
48(1)127,
52(1)1,
53(2)319,
54(2)139,
55(2)141,
56(2)233,
56(3)253,
56(3)339,
58(1)103,
58(1)231,
60(3)255,
60(3)285,
61(1)1,
65(2)171,
65(2)221,
65(2)z,
69(3)319