Entry Cherubini:1991:QFA 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{Cherubini:1991:QFA,
author = "A. Cherubini and C. Citrini and S. C. Reghizzi and D.
Mandrioli",
title = "{QRT FIFO} automata, breadth-first grammars and their
relations",
journal = j-THEOR-COMP-SCI,
volume = "85",
number = "1",
pages = "171--203",
day = "05",
month = aug,
year = "1991",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dipartimento di Matematica, Politecnico di Milano,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; breadth-first grammars; closure
properties; context-free grammars; counting
capabilities; deterministic machines; generative
system; homomorphism; multiqueue automata; periodicity
property; permutation; QRT FIFO automata;
quasi-real-time; queue automata; recognition power;
semilinear",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- breadth-first,
124(2)343
- capability,
92(2)291,
99(2)243,
127(2)351
- 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,
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,
134(2)329
- counting,
79(1)37,
81(1)49,
81(1)77,
86(2)325,
100(1)243,
102(2)283,
103(1)3,
107(1)3,
108(1)3,
108(2)371,
112(2)255,
117(1)45,
117(1)203,
133(1)105
- first, breadth-,
124(2)343
- generative,
98(2)249
- homomorphism,
76(2)261,
88(2)287,
99(2)177,
109(1)49,
112(1)99,
132(1)243
- periodicity,
82(1)19,
123(2)291
- permutation,
88(1)83,
91(1)1,
95(2)263,
102(2)253,
108(1)119,
115(2)351,
117(1)153,
117(1)243,
117(1)303,
125(2)205,
126(2)281,
131(2)449,
135(2)289
- power,
70(1)159,
71(1)47,
73(2)177,
74(2)163,
79(1)3,
79(1)25,
79(1)163,
79(1)179,
79(1)195,
79(1)209,
79(1)257,
79(1)263,
80(1)1,
80(1)35,
80(2)125,
80(2)337,
81(2)269,
81(2)305,
83(2)261,
83(2)301,
88(2)231,
92(2)269,
93(1)1,
93(1)43,
93(2)265,
98(1)27,
98(1)53,
98(1)99,
98(1)z,
98(2)163,
98(2)249,
99(2)291,
99(2)327,
101(1)35,
101(1)143,
108(1)3,
108(2)385,
109(1)7,
110(1)131,
111(1)59,
111(1)z,
112(2)291,
113(1)75,
114(1)119,
114(2)201,
115(2)191,
115(2)359,
116(1)33,
116(1)95,
117(1)39,
117(1)113,
117(1)131,
117(1)169,
117(1)199,
117(1)289,
117(1)z,
127(1)171,
134(2)545,
136(1)21
- queue,
72(2)147,
93(2)201,
113(1)75,
125(1)91,
125(1)111
- recognition,
80(1)53,
81(2)311,
85(1)53,
88(1)99,
92(1)19,
92(1)33,
92(1)77,
92(1)107,
92(1)145,
92(1)165,
92(1)191,
92(1)z,
98(2)289,
106(1)21,
107(2)349,
112(1)53,
115(2)291,
116(1)117,
116(2)421,
123(2)427,
129(2)337,
132(1)403,
132(1)435,
136(2)291,
136(2)387
- relation,
70(1)35,
71(1)29,
72(2)133,
73(2)213,
73(3)279,
74(2)199,
74(3)325,
77(1)131,
77(3)267,
77(3)291,
79(2)323,
81(1)147,
81(2)295,
82(2)303,
83(1)29,
86(2)205,
86(2)277,
87(1)97,
87(1)163,
87(2)263,
89(1)3,
90(1)171,
90(2)355,
91(1)23,
91(1)101,
93(2)321,
94(1)1,
96(1)35,
97(1)67,
98(1)5,
98(1)z,
99(2)177,
103(1)143,
103(2)235,
105(1)7,
105(2)217,
107(2)277,
108(1)45,
114(2)247,
114(2)317,
117(1)45,
123(2)259,
125(1)61,
126(2)281,
129(1)187,
132(1)179,
133(1)15,
133(2)341,
133(2)387,
134(2)537,
135(2)289,
136(1)163
- semilinear,
93(2)185,
104(2)207