Entry Beauquier:1989:MAF 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{Beauquier:1989:MAF,
author = "Daniele Beauquier",
title = "Minimal automation for a factorial, transitive, and
rational language",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "1",
pages = "65--73",
day = "5",
month = sep,
year = "1989",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ de Paris",
affiliationaddress = "Paris, Fr",
classification = "721; 723; C4210 (Formal logic); C4220 (Automata
theory)",
corpsource = "LITP, Paris VII Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; Computer Programming--Algorithms;
deterministic automata; deterministic automaton;
equivalence relation; factorial, transitive, and
rational language; formal languages; Formal Languages;
FTR-language; intrinsic definition; Minimal Automata;
minimal irreducible deterministic automaton; Rational
Languages; syntactic monoid",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
xxtitle = "Minimal automaton for a factorial, transitive, and
rational language",
}
Related entries
- Algorithms, Programming-,
58(0)3,
58(1)3,
58(1)103,
58(1)143,
58(1)183,
59(1)115,
59(3)297,
60(3)255,
60(3)341,
62(0)3,
62(1)67,
62(1)105,
62(1)123,
63(2)157,
63(3)295,
64(1)39,
64(1)83,
64(1)107,
64(3)343,
65(1)1,
66(2)157,
66(2)181
- automation,
37(2)123,
39(2)107,
39(2)171,
40(1)31,
47(1)15,
61(1)1,
62(1)3,
68(1)49
- automaton,
35(1)17,
35(2)313,
36(2)291,
38(1)1,
38(1)133,
39(2)171,
40(1)31,
40(2)149,
40(2)163,
47(1)95,
47(3)335,
48(1)117,
53(2)307,
60(3)341,
61(1)17,
63(2)141,
63(2)223,
65(2)123,
66(3)273
- definition,
51(1)129,
55(2)141,
57(2)327
- deterministic,
35(2)215,
36(1)89,
37(1)1,
37(2)123,
38(1)133,
38(2)323,
40(1)31,
40(1)57,
41(2)223,
41(2)305,
41(2)325,
42(3)251,
43(2)123,
43(2)337,
44(1)111,
46(2)219,
47(1)39,
47(2)149,
48(1)109,
48(1)117,
49(2)267,
52(1)77,
52(1)91,
52(3)269,
54(1)65,
61(1)25,
61(2)149,
64(1)39,
66(1)65,
66(3)273
- equivalence,
35(1)43,
35(2)313,
36(1)21,
36(1)113,
37(2)151,
37(2)183,
38(2)157,
39(1)27,
39(1)z,
41(1)105,
41(2)223,
42(1)1,
43(2)213,
44(2)237,
46(2)107,
46(2)175,
46(2)305,
47(1)39,
47(1)71,
47(3)247,
47(3)263,
47(3)299,
48(2)145,
48(2)329,
49(2)185,
49(2)z,
50(3)241,
52(1)77,
52(3)177,
52(3)307,
53(1)67,
53(2)225,
58(1)183,
59(1)115,
63(1)19,
63(2)223,
64(1)39,
64(3)221,
66(1)1
- irreducible,
54(2)215
- minimal,
35(1)17,
35(2)261,
36(2)203,
36(2)345,
43(2)189,
50(2)183,
51(3)265,
58(1)17,
60(3)285,
63(1)1
- monoid,
35(2)179,
35(2)227,
35(2)271,
37(3)245,
38(1)123,
39(1)3,
40(1)13,
40(2)85,
41(1)121,
41(2)215,
43(1)117,
44(3)333,
46(2)159,
46(2)319,
47(2)191,
48(2)183,
48(2)329,
49(1)13,
51(1)215,
52(1)59,
54(2)165,
55(2)183,
56(3)345,
57(2)239,
58(1)81,
58(1)201,
60(3)285,
64(3)271,
66(1)55,
66(2)117,
66(3)233,
67(1)19,
67(2)143
- Programming--Algorithms,
58(0)3,
58(1)3,
58(1)103,
58(1)143,
58(1)183,
59(1)115,
59(3)297,
60(3)255,
60(3)341,
62(0)3,
62(1)67,
62(1)105,
62(1)123,
63(2)157,
63(3)295,
64(1)39,
64(1)83,
64(1)107,
64(3)343,
65(1)1,
66(2)157,
66(2)181
- rational,
39(2)333,
40(1)13,
41(1)51,
43(1)91,
44(1)107,
44(3)259,
46(1)101,
47(1)39,
47(3)247,
47(3)335,
48(2)329,
53(2)187,
57(2)185,
57(2)303,
58(1)81,
58(1)231,
64(1)1,
65(0)123,
65(2)123,
65(2)171,
65(2)213,
65(2)z,
68(3)253,
68(3)347
- relation,
37(2)151,
38(2)157,
39(2)89,
40(2)131,
41(1)81,
46(2)159,
47(1)39,
47(3)329,
48(2)145,
51(1)215,
53(1)3,
54(2)277,
56(1)59,
57(2)303,
59(1)25,
59(3)287,
60(3)285,
61(2)137,
63(2)223,
64(1)83,
65(1)1,
65(3)343,
67(1)19
- syntactic,
37(1)77,
39(1)3,
39(2)333,
40(1)13,
45(3)293,
52(3)205,
56(1)59,
58(1)231,
62(1)221,
66(3)233,
68(1)49,
68(2)135,
69(3)243
- transitive,
40(2)257,
44(1)17,
44(1)107,
46(2)159,
47(3)315,
58(1)325,
59(3)287,
65(2)265