@Preamble{"\hyphenation{
Bai-er
He-ma-chan-dra
Ko-ba-ya-shi
Kri-zanc
Lett-mann
Mal-u-szyn-ski
Mar-chet-ti
Mar-u-o-ka
Och-man-ski
Pal-a-mi-des-si
Piet-rzy-kow-ski
Pros-ku-row-ski
Pu-ru-sho-tha-man
Ros-en-krantz
Spor-tel-li
Sturt-i-vant
Ta-ka-da
Vau-zeilles
Win-kow-ski
Win-skel
to-po-log-ique
}"}
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|http://www.math.utah.edu/~beebe/|"}
@String{j-THEOR-COMP-SCI = "Theoretical Computer Science"}
@String{pub-NH = "North-Hol{\-}land"}
@String{pub-NH:adr = "Amsterdam, The Netherlands"}
@Article{Lange:1985:RWS,
author = "K.-J. Lange and E. Welzl",
title = "Recurrent words and simultaneous growth in {T0L}
systems",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "1",
pages = "1--15",
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)",
corpsource = "Fachbereich Inf., Hamburg Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free grammars; context-free languages;
decidability results; Markov DT0L systems; PSPACE-hard;
recurrent words; simultaneous growth; T0L systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Stern:1985:CSC,
author = "J. Stern",
title = "Characterizations of some classes of regular events",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "1",
pages = "17--42",
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 = "C4220 (Automata theory)",
corpsource = "Dept. of Math., Caen Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; characterizations; minimal automaton;
piecewise testable events; regular events",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bloom:1985:LCO,
author = "S. L. Bloom and D. R. Troeger",
title = "A logical characterization of observation
equivalence",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "1",
pages = "43--53",
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)",
corpsource = "Dept. of Pure and Appl. Math., Stevens Inst. of
Technol., Hoboken, NJ, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finitary formal language; formal languages; logical
characterization; observation equivalence;
omega-conjunctions; quantification; regular trace
language; S-TL; synchronisation; synchronization trees;
trees (mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Edelsbrunner:1985:FTS,
author = "H. Edelsbrunner",
title = "Finding transversals for sets of simple geometric
figures",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "1",
pages = "55--69",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. for Inf. Processing, Tech. Univ. of Graz,
Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; computer graphics; convex
hull problems; geometric figures; geometric transforms;
transversals",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Metivier:1985:CLR,
author = "Y. Metivier",
title = "Calculation of the length of rewriting chains in free
monoide",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "1",
pages = "71--87",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "UER de Math. et Inf., Bordeaux Univ., Talence,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity measure; computational complexity; free
monoide; rewriting chains",
language = "French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Benoit:1985:AT,
author = "C. Benoit",
title = "Axiomatisation of tests",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "1",
pages = "89--107",
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)",
corpsource = "Lab. de Marcoussis, Centre de Recherches de la
Compagnie G{\'e}n{\'e}rale d'Electricit{\'e},
Marcoussis, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "axiomatisation; equational theories; formal languages;
function symbol; nonordered algebras",
language = "French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kapur:1985:ATC,
author = "D. Kapur and M. S. Krishnamoorthy and R. McNaughton
and Narendran and P.",
title = "An {$O(\bmod {T} \bmod ^3)$} algorithm for testing the
{Church--Rosser} property of {Thue} systems",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "1",
pages = "109--114",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "General Electric Co., Res. and Dev. Center,
Schenectady, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Church--Rosser property; computational complexity;
linear string-matching algorithm; reduction algorithm;
Thue systems; trees (mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
xxnote = "Check math in title??",
}
@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",
}
@Article{Fribourg:1985:SOT,
author = "L. Fribourg",
title = "A superposition oriented theorem prover",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "2--3",
pages = "129--164",
month = feb,
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 = "C1230 (Artificial intelligence); C4210 (Formal
logic)",
corpsource = "LITP, Paris, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "binary resolution; clausal superposition; equational
clauses; formal logic; formalism of clauses; inference
rules; locking resolution procedures; resolution;
rewriting; strong restriction; strongly restricted
paramodulation; subsumption; superposition oriented
theorem prover; term simplification; theorem proving",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ausiello:1985:EAV,
author = "G. Ausiello and A. d'Atri and M. Moscarini",
title = "On the existence of acyclic views in a database
scheme",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "2--3",
pages = "165--177",
month = feb,
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 = "C4240 (Programming and algorithm theory); C4250
(Database theory)",
corpsource = "Dipartimento di Inf. e Sistemistica, Roma Univ.,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "acyclic database schemes; acyclic views;
alpha-acyclicity; Berge-acyclicity; computational
complexity; database theory; gamma-acyclicity;
NP-completeness; relational database theory; relational
databases",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Cori:1985:RSS,
author = "R. Cori and Y. Metivier",
title = "Recognizable subsets of some partially {Abelian}
monoids",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "2--3",
pages = "179--189",
month = feb,
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Bordeaux I Univ., UER de math. et Inf., Talence,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "connected graph; finite alphabet; formal logic; free
partially abelian monoid; graph theory; noncommuting
pairs; recognisable subsets; set theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Memmi:1985:IFN,
author = "G. Memmi and A. Finkel",
title = "An introduction to {FIFO} nets-monogeneous nets: a
subclass of {FIFO} nets",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "2--3",
pages = "191--214",
month = feb,
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); C4240
(Programming and algorithm theory)",
corpsource = "Ecole Nat. Sup{\'e}rieure des Telecommun., Paris,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alphabetical FIFO nets; bounded monogeneous nets;
coloured-Petri-net simulation; context-free languages;
coverability graph; decidability; graph theory;
monogeneous FIFO nets; parallel computation model;
parallel processing; programming theory; regular
languages; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kobayashi:1985:PTC,
author = "K. Kobayashi",
title = "On proving time constructibility of functions",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "2--3",
pages = "215--225",
month = feb,
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 = "C4220 (Automata theory)",
corpsource = "Dept. of Inf. Sci., Tokyo Inst. of Technol., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic automata; deterministic multitape Turing
machines; functions; sufficient condition; time
constructibility; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Narendran:1985:CRC,
author = "P. Narendran and F. Otto",
title = "Complexity results on the conjugacy problem for
monoids",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "2--3",
pages = "227--243",
month = feb,
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); C4240 (Programming and
algorithm theory)",
corpsource = "Gen Elect. Co., Res. and Dev. Center, Schenectady, NY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alphabet; computational complexity; conjugacy problem;
decidability; finite almost-confluent Thue system;
finite Church--Rosser Thue system; formal languages;
infinite Church--Rosser Thue system; monoids;
presentations; recursive functions; recursive Thue
systems; recursively enumerable degree",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Plaisted:1985:CDP,
author = "D. A. Plaisted",
title = "Complete divisibility problems for slowly utilized
oracles",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "2--3",
pages = "245--260",
month = feb,
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complete divisibility problems; computational
complexity; integers; intractability; NP-completeness;
polynomials; root; slowly utilized oracles; sparse
polynomial; unrelativized complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hirose:1985:HCR,
author = "S. Hirose and S. Okawa and M. Yoneda",
title = "A homomorphic characterization of recursively
enumerable languages",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "2--3",
pages = "261--269",
month = feb,
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)",
corpsource = "Kanagawa Univ., Yokohama, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Dyck language; formal languages; homomorphic
characterization; homomorphic image; intersection;
minimal linear language; recursive functions;
recursively enumerable languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Pin:1985:AMR,
author = "J.-E. Pin and J. Sakarovitch",
title = "An application of the matrix representation of
transductions",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "2--3",
pages = "271--293",
month = feb,
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 = "Paris VI. Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; control operations; Dyck-reduction;
formal language theory; formal languages; free-group;
language recognition; matrix representation; monoids;
T0L-systems; transductions",
language = "French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Head:1985:CPH,
author = "T. Head and J. Wilkinson",
title = "Code properties and homomorphisms of {D0L} systems",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "2--3",
pages = "295--312",
month = feb,
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 = "C1260 (Information theory); C4210 (Formal logic)",
corpsource = "Dept. of Math. Sci., Alaska Univ., Fairbanks, AK,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alphabet; biprefix codes; codes; commutative
equivalent; context-free languages; D0L systems;
derivative; erasure; finite set; finite symbols;
homomorphic image; homomorphisms; infix codes; linearly
bounded D0L languages; outfix codes; polynomially
bounded D0L languages; prefix codes; singleton; suffix
codes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Leiss:1985:CTU,
author = "E. Leiss",
title = "On classes of tractable unrestricted regular
expressions",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "2--3",
pages = "313--327",
month = feb,
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); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean automata; Boolean functions; closure;
computational complexity; context-free languages;
equivalence classes; equivalence problem; finite
automata; intractable complexity; nontrivial
subclasses; reduced automaton; tractable complexity;
tractable unrestricted regular expressions",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Oyamaguchi:1985:DTE,
author = "M. Oyamaguchi",
title = "On the data type extension problem for algebraic
specifications",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "2--3",
pages = "329--336",
month = feb,
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 = "C4240 (Programming and algorithm theory); C6120
(File organisation)",
corpsource = "Fac. of Eng., Mie Univ., Tsu-shi, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract data type; algebraic specifications; data
structures; data type extension problem; decidability;
final algebra semantics; programming theory; terminal
algebra semantics",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kapur:1985:FTS,
author = "D. Kapur and P. Narendran",
title = "A finite {Thue} system with decidable word problem and
without equivalent finite canonical system",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "2--3",
pages = "337--344",
month = feb,
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)",
corpsource = "Comput. Sci. Branch, Gen. Electr. Corp. Res. and Dev.,
Schenectady, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Church--Rosser property; decidability; decidable word
problem; equivalent finite canonical system; finite
Thue system; formal languages; semiThue systems;
single-axiom Thue system; term rewriting systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Sain:1985:SPC,
author = "I. Sain",
title = "A simple proof for the completeness of {Floyd}'s
method",
journal = j-THEOR-COMP-SCI,
volume = "35",
number = "2--3",
pages = "345--348",
month = feb,
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Math. Inst., Hungarian Acad. of Sci., Budapest,
Hungary",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "completeness; continuous traces semantics; Floyd's
method; program semantics; programming theory;
unprovable programs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Broy:1985:HKU,
author = "M. Broy",
title = "On the {Herbrand-Kleene} universe for nondeterministic
computations",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "1",
pages = "1--19",
month = mar,
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 = "C6150J (Operating systems)",
corpsource = "Passau Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arbitrary signature; commuting diagram; function
symbols; Herbrand-Kleene universe; infinite tree;
interpretation; multiprocessing programs;
nondeterministic choice operator; nondeterministic
computations; power domain approach; recursive
equation; set-valued function; trees (mathematics)",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Engelfriet:1985:DOE,
author = "J. Engelfriet",
title = "Determinacy to (observation equivalence=trace
equivalence)",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "1",
pages = "21--25",
month = mar,
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Twente Univ. of Technol.,
Enschede, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "determinacy; nondeterministic behaviour; observation
equivalence; parallel process; programming theory;
trace equivalence",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Janicki:1985:TSS,
author = "R. Janicki",
title = "Transforming sequential systems into concurrent
systems",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "1",
pages = "27--58",
month = mar,
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Electron. Syst., Aalborg Univ., Denmark",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract resources; cigarette smokers; concurrent
systems; dining philosophers; functionally equivalent
system; multiprocessing systems; necessary and
sufficient conditions; path expressions; programming
theory; readers; sequential systems transformation;
specification; vending machine; writers",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Blum:1985:LBM,
author = "N. Blum",
title = "An {$\Omega(n^4/3)$} lower bound on the monotone
network complexity of the $n^{th}$ degree convolution",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "1",
pages = "59--69",
month = mar,
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); C4240 (Programming and
algorithm theory)",
corpsource = "Inst. fur Angewandte Math. und Inf., Univ. des
Saarlandes, Saarbrucken, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean functions; computational complexity; lower
bound; monotone network complexity; n/sup th/ degree
convolution",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Tiomkin:1985:PDL,
author = "M. L. Tiomkin and J. A. Makowsky",
title = "Propositional dynamic logic with local assignments",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "1",
pages = "71--87",
month = mar,
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)",
corpsource = "Technion-Israel Inst. of Technol., Haifa, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finitely branching; formal logic; local assignments;
looping; predicate variables; program terms;
propositional dynamic logic; propositional variables;
truth values",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Igarashi:1985:PLR,
author = "Y. Igarashi",
title = "A pumping lemma for real-time deterministic
context-free languages",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "1",
pages = "89--97",
month = mar,
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 = "Dept. of Comput. Sci., Gunma Univ., Kiryu, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; deterministic automata;
pumping lemma; real-time deterministic context-free
languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{DeFelice:1985:CFC,
author = "C. {De Felice}",
title = "Construction of factorisation codes",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "1",
pages = "99--108",
month = mar,
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 = "C1260 (Information theory)",
corpsource = "LITP, Paris VIII, Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "codes; factorisation codes; finite maximal codes;
finite subset",
language = "French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hirose:1985:CSH,
author = "S. Hirose and M. Yoneda",
title = "On the {Chomsky} and {Stanley}'s homomorphic
characterization of context-free languages",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "1",
pages = "109--112",
month = mar,
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)",
corpsource = "Kanagawa Univ., Yokohama, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; Dyck language; homomorphic
characterization; homomorphism",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ruohonen:1985:EMS,
author = "K. Ruohonen",
title = "On equality of multiplicity sets of regular
languages",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "1",
pages = "113--117",
month = mar,
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)",
corpsource = "Inst. of Math., Tampere Univ. of Technol., Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "equality; equivalence problem; formal languages;
multiplicity sets; regular languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Scarpellini:1985:CBN,
author = "B. Scarpellini",
title = "Complex {Boolean} networks obtained by
diagonalization",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "1",
pages = "119--125",
month = mar,
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)",
corpsource = "Dept. of Math., Basel Univ., Switzerland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean functions; boolean functions; complex Boolean
networks; diagonalization",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Winskel:1985:PM,
author = "G. Winskel",
title = "On powerdomains and modality",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "1",
pages = "127--137",
month = mar,
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Comput. Lab., Cambridge Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Hoare power domain; modal assertions; modality;
nondeterministic computations; nondeterministic
program; partial correctness; Plotkin power domain;
powerdomains; programming theory; Smyth power domain",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Fenton:1985:GMT,
author = "N. E. Fenton and R. W. Whitty and A. A. Kaposi",
title = "A generalised mathematical theory of structured
programming",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "2--3",
pages = "145--171",
month = apr,
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C6110 (Systems
analysis and programming)",
corpsource = "Math. Inst., Oxford Univ., Oxford, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "classification; D-structuredness; flowgraphs; formal
methods; generalised mathematical theory; graph theory;
program control structures; programming theory;
structured programming",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Sudborough:1985:CDC,
author = "I. H. Sudborough and E. Welzl",
title = "Complexity and decidability for chain code picture
languages",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "2--3",
pages = "173--202",
month = apr,
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); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Electr. Eng., Northwestern Univ., Evanston,
IL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "chain code picture languages; codes; complexity;
computational complexity; decidability; formal
languages; membership problem; NP-complete; picture
description; picture processing; regular languages",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Demel:1985:FAC,
author = "J. Demel and M. Demlova and V. Koubek",
title = "Fast algorithms constructing minimal subalgebras,
congruences, and ideals in a finite algebra",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "2--3",
pages = "203--216",
month = apr,
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 = "C4220 (Automata theory)",
corpsource = "Faculty of Civil Eng., Prague Tech. Univ.,
Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebra; congruences; fast algorithms; finite algebra;
finite automata; graph theory; ideals; minimal
nontrivial congruences; minimal subalgebras; running
times; sequential automata",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Kaminski:1985:COR,
author = "M. Kaminski",
title = "A classification of omega-regular languages",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "2--3",
pages = "217--229",
month = apr,
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 = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "classification; finite automata; formal languages;
invariant property; omega-regular languages",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Allender:1985:ILB,
author = "E. Allender and M. M. Klawe",
title = "Improved lower bounds for the cycle detection
problem",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "2--3",
pages = "231--237",
month = apr,
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Sch. of Inf. and Comput. Sci., Georgia Inst. of
Technol., Atlanta, GA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cycle detection problem; Floyd's algorithm; lower
bounds; memory locations; programming theory",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Fagin:1985:BDP,
author = "R. Fagin and M. M. Klawe and N. J. Pippenger and L.
Stockmeyer",
title = "Bounded-depth, polynomial-size circuits for symmetric
functions",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "2--3",
pages = "239--250",
month = apr,
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)",
corpsource = "IBM Res. Lab., San Jose, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean functions; Boolean variables; bounded depth
circuits; polynomial-size circuits; symmetric Boolean
functions; symmetric functions",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{FarinasDelCerro:1985:DLD,
author = "L. {Farinas Del Cerro} and E. Orlowska",
title = "{DAL-a} logic for data analysis",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "2--3",
pages = "251--264",
month = apr,
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)",
corpsource = "Langages et Syst. Inf., Univ. Paul Sabatier, Toulouse,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "data analysis logic; deductive system; formal logic;
logic language; logic tools; proof procedures",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Jerrum:1985:CFM,
author = "M. R. Jerrum",
title = "The complexity of finding minimum-length generator
sequences",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "2--3",
pages = "265--289",
month = apr,
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; cyclicly adjacent
transpositions; generator set cardinality;
minimum-length generator sequences; permutation group;
polynomial time; polynomials; PSPACE-complete; single
target permutation",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Matsuno:1985:ASM,
author = "H. Matsuno and K. Inoue and H. Taniguchi and I.
Takanami",
title = "Alternating simple multihead finite automata",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "2--3",
pages = "291--308",
month = apr,
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 = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Electron., Yamaguchi Junior Coll., Hofu,
Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alternating simple multihead finite automaton;
ASPMHFAs; Boolean operations; closure properties;
complexity measure; computational complexity; finite
automata; ordinary alternating multihead finite
automata; SPMHFAs",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Keller-Gehrig:1985:FAC,
author = "W. Keller-Gehrig",
title = "Fast algorithms for the characteristic polynomial",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "2--3",
pages = "309--317",
month = apr,
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 = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory)",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "characteristic polynomial; computational complexity;
fast algorithms; matrix multiplication; polynomials",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Diks:1985:EBT,
author = "K. Diks",
title = "Embeddings of binary trees in lines",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "2--3",
pages = "319--331",
month = apr,
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 = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Inst. Inf., Warszawa Univ., Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "binary trees embedding; dilation-cost; graph theory;
n-vertex binary tree; trees (mathematics)",
pubcountry = "Netherlands A11",
treatment = "T Theoretical or Mathematical",
}
@Article{Alt:1985:MEN,
author = "H. Alt",
title = "Multiplication is the easiest nontrivial arithmetic
function",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "2--3",
pages = "333--339",
month = apr,
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)",
corpsource = "Dept. of Comput. Sci., Pennsylvania State Univ.,
University Park, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean circuit; Boolean functions; Boolean
operations; fixed point multiplication; nontrivial
arithmetic function",
pubcountry = "Netherlands A12",
treatment = "T Theoretical or Mathematical",
}
@Article{Rytter:1985:CRB,
author = "W. Rytter and M. Chrobak",
title = "A characterization of reversal-bounded multipushdown
machine languages",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "2--3",
pages = "341--344",
month = apr,
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 = "Inst. of Inf., Warsaw Univ., Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; characterization; DLOG; formal
languages; reversal-bounded multipushdown machine
languages; Turing machines",
pubcountry = "Netherlands A13",
treatment = "T Theoretical or Mathematical",
}
@Article{Farr:1985:CCH,
author = "G. Farr and C. McDiarmid",
title = "The complexity of counting homeomorphs",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "2--3",
pages = "345--348",
month = apr,
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Math. Inst., Oxford, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; computational complexity; counting
homeomorphs; finite nontrivial family of graphs; graph
theory; minimal nonplanar subgraphs; subgraphs",
pubcountry = "Netherlands A14",
treatment = "T Theoretical or Mathematical",
}
@Article{Ko:1985:SNC,
author = "K. Ko",
title = "On some natural complete operators",
journal = j-THEOR-COMP-SCI,
volume = "37",
number = "1",
pages = "1--30",
month = may,
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 = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "completeness; computational complexity; deterministic
oracle Turing machine; integer functions; natural
complete operators; nondeterministic oracle Turing
machine; NP operator; polynomial time; polynomials;
Turing machines",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Rozenberg:1985:CSS,
author = "G. Rozenberg",
title = "On coordinated selective substitutions: towards a
unified theory of grammars and machines",
journal = j-THEOR-COMP-SCI,
volume = "37",
number = "1",
pages = "31--50",
month = may,
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 = "Inst. of Appl. Math. and Comput. Sci., Leiden Univ.,
Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; coordinated selective substitutions;
formal language theory; formal languages; grammars;
machines; unified theory",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Muller:1985:TEP,
author = "D. E. Muller and P. E. Schupp",
title = "The theory of ends, pushdown automata, and
second-order logic",
journal = j-THEOR-COMP-SCI,
volume = "37",
number = "1",
pages = "51--75",
month = may,
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Dept. of Math., Comput. Sci. Illinois Univ., Urbana,
IL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; Cayley graphs; cellular automata;
context free groups; edge-labeled graphs; ends theory;
formal logic; graph theory; infinite binary tree;
monadic second-order theory; pushdown automata; Rabin's
theorem; second-order logic theory; tiling systems;
trees (mathematics); two dimensional grid",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Bergstra:1985:ACP,
author = "J. A. Bergstra and J. W. Klop",
title = "Algebra of communicating processes with abstraction",
journal = j-THEOR-COMP-SCI,
volume = "37",
number = "1",
pages = "77--121",
month = may,
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 = "C1160 (Combinatorial mathematics); C1260
(Information theory)",
corpsource = "Centre for Math. and Comput. Sci., Amsterdam,
Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstraction; algebra; axiom system; communicating
processes; conservativity; consistency; expansion
theorem; finite acyclic process graphs; graph theory;
information theory; Milner's tau-laws; model;
recursive path orderings; rewriting terms; syntactic
properties",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Gallier:1985:RTR,
author = "J. H. Gallier and R. V. Book",
title = "Reductions in tree replacement systems",
journal = j-THEOR-COMP-SCI,
volume = "37",
number = "2",
pages = "123--150",
month = nov,
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Dept. of Comput. and Inf. Sci., Moore Sch. of Electr.
Eng., Pennsylvania Univ., Philadelphia, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Church--Rosser monadic reduction systems;
Church--Rosser tree replacement systems; congruence
class; deterministic automata; deterministic bottom-up
tree pushdown automation; finite Church--Rosser
reduction systems; formal languages; grammars; linear
time decidability; monadic Thue systems; norm; tree
reducing machine; tree rewriting system; trees
(mathematics)",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Bouge:1985:CTP,
author = "L. Bouge",
title = "A contribution to the theory of program testing",
journal = j-THEOR-COMP-SCI,
volume = "37",
number = "2",
pages = "151--181",
month = nov,
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 = "C4240 (Programming and algorithm theory)",
corpsource = "LITP, UER de Math., Paris Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract formalism; acceptability; bias; effective
automatic test generation; equivalence relation;
preorder; program proving; program testing; program
testing theory; programming theory; quality assessment;
reliability; test battery; test context; test
optimisation; validity",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Culik:1985:TTT,
author = "K. {Culik, II} and I. Fris",
title = "Topological transformations as a tool in the design of
systolic networks",
journal = j-THEOR-COMP-SCI,
volume = "37",
number = "2",
pages = "183--216",
month = nov,
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 = "C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; computational network; correctness
proving; distributed sorting; equivalence; Leiserson
and Saxe; parallel processing; parallel synchronised
processors; retiming lemma; space-time diagrams;
systolic conversion theorem; systolic network; systolic
ring; topological transformations; unrollings",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Gonczarowski:1985:AST,
author = "J. Gonczarowski and M. K. Warmuth",
title = "Applications of scheduling theory to formal language
theory",
journal = j-THEOR-COMP-SCI,
volume = "37",
number = "2",
pages = "217--243",
month = nov,
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 = "C1290 (Applications of systems theory); C4210
(Formal logic); C4240 (Programming and algorithm
theory)",
corpsource = "Inst. of Math. and Computer Sci., Hebrew Univ. of
Jerusalem, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; context-free grammars;
context-free languages; context-free rewriting;
derivation forest; dynamic programming membership
algorithms; EOL rewriting; formal language theory;
NP-hard membership; parallel nonterminal-rewriting;
scheduling; scheduling theory",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{deSimone:1985:HLS,
author = "R. {de Simone}",
title = "Higher-level synchronising devices in {MEIJE-SCCS}",
journal = j-THEOR-COMP-SCI,
volume = "37",
number = "3",
pages = "245--267",
month = dec,
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Centre de Math. Appl., INRIA, Valbonne, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "actions monoids; expressiveness study; higher level
nonprimitive operators; MEIJE-SCCS; original SCCS
calculus; parallel processing; parallelism; programming
theory; semantic conditional rules; synchronisation;
synchronising operators; transition systems",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Tarlecki:1985:EFM,
author = "A. Tarlecki",
title = "On the existence of free models in abstract algebraic
institutions",
journal = j-THEOR-COMP-SCI,
volume = "37",
number = "3",
pages = "269--304",
month = dec,
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)",
corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract algebraic institutions; abstract data types;
algebra; algebraic specification languages; arbitrary
theory morphism; data structures; forgetful functors;
formal logic; free constructions; free functors; free
models; left adjoints; logical system; partial
algebras; reachable initial models; specification
languages; specifications writing; submodel; theory
morphism",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Darondeau:1985:AFA,
author = "P. Darondeau",
title = "About fair asynchrony",
journal = j-THEOR-COMP-SCI,
volume = "37",
number = "3",
pages = "305--336",
month = dec,
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); C4240 (Programming and
algorithm theory)",
corpsource = "IRISA, Rennes, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract model; asynchronous agents; CCS like
language; classical algebraic domains; fair asynchrony;
fairness; formal languages; implementation preorder;
infinitary languages; observable properties; parallel
processing; parallelism; programming theory; semantic
modelling; synchronisation",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrenfeucht:1985:AGF,
author = "A. Ehrenfeucht and H. C. M. Kleijn and G. Rozenberg",
title = "Adding global forbidding context to context-free
grammars",
journal = j-THEOR-COMP-SCI,
volume = "37",
number = "3",
pages = "357--360",
month = dec,
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)",
corpsource = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context free languages; context-free grammars;
context-free languages; fixed alphabet; global
forbidding context; IS grammar; one sequential
grammars; selective substitution grammar theory",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Fle:1985:MSI,
author = "M. P. Fle and G. Roucairol",
title = "Maximal serializability of iterated transactions",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "1",
pages = "1--16",
month = may,
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 = "C4220 (Automata theory); C4250 (Database theory)",
corpsource = "Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "concurrent transactions; conflicting accesses; correct
behaviours; database consistency; database theory;
dining philosophers; finite automata; finite automaton;
iterated transactions; maximal serialisability;
multiprocessing programs; synchronisation;
synchronization",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Weihrauch:1985:TRT,
author = "K. Weihrauch",
title = "Type 2 recursion theory",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "1",
pages = "17--33",
month = may,
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)",
corpsource = "Dept. of Comput. Sci., Fernuniv., Hagen, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability; computably open subsets; continuous
functions; recursive functions; recursively enumerable
subsets; topological version; type 2 recursion theory",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Kreitz:1985:TR,
author = "C. Kreitz and K. Weihrauch",
title = "Theory of representations",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "1",
pages = "35--53",
month = may,
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "LG Theor. Inf., Fernuniv., Hagen, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability; effectivity theory; recursion
theoretical properties; recursive functions; separable
T/sub 0/-space; set theory; topological properties;
topology; type 2 computability; unique admissible
representation",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Wegener:1985:CSF,
author = "I. Wegener",
title = "On the complexity of slice functions",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "1",
pages = "55--68",
month = may,
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 = "B1265B (Logic circuits); C1160 (Combinatorial
mathematics); C4210 (Formal logic); C4230B
(Combinatorial switching theory)C4240 (Programming and
algorithm theory)",
corpsource = "Johann Wolfgang Goethe-Univ., Frankfurt, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arbitrary complete bases; Boolean convolution; Boolean
functions; canonical slice functions; circuit
combination complexity; clique function; combinatorial
circuits; combinatorial switching; computational
complexity; conjunction; disjunction; monotone circuit
complexity; Nechiporuk Boolean sums; set circuits; set
intersection; set theory; set union",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Snir:1985:LBP,
author = "M. Snir",
title = "Lower bounds on probabilistic linear decision trees",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "1",
pages = "69--82",
month = may,
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 = "C1140E (Game theory); C1160 (Combinatorial
mathematics); C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Comput. Sci., Hebrew Univ. of Jerusalem,
Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; decision theory; lower
bounds; probabilistic linear decision trees; random
processes; randomising algorithm; trees (mathematics)",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Ramanan:1985:PRA,
author = "P. V. Ramanan and C. L. Liu",
title = "Permutation representation of $k$-ary trees",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "1",
pages = "83--98",
month = may,
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "data structures; k-ary tree traversals; k-ary trees;
lexicographic order; permutation representation;
sorting; trees (mathematics)",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Beeri:1985:FSJ,
author = "C. Beeri and M. Y. Vardi",
title = "Formal systems for join dependencies",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "1",
pages = "99--116",
month = may,
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 = "C4250 (Database theory)",
corpsource = "Dept. of Comput. Sci., Hebrew Univ. of Jerusalem,
Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "database theory; extended join dependencies; formal
system; generalised join dependencies; Gentzen-style
system; implication problem; relational database
theory; relational databases; tuple generating
dependencies; unbounded inference rules",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Leconte:1985:CPF,
author = "M. Leconte",
title = "A characterization of power-free morphisms",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "1",
pages = "117--122",
month = may,
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)",
corpsource = "Paris VII Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cube-free image; decidability; formal languages;
power-free morphisms; power-free words; square-free
morphism",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Van:1985:CCS,
author = "D. L. Van",
title = "Code-compatible sets and a generalisation of the
{Sardinas-Patterson} theorem",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "1",
pages = "123--132",
month = may,
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 = "B0250 (Combinatorial mathematics); B6120B (Codes);
C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4290 (Other computer theory)",
corpsource = "Inst. of Math., Hanoi, Viet Nam",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "code-compatible sets; codes; generalised
Sardinas-Patterson theorem; infinitary code; monoid;
set theory",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Leiss:1985:SRR,
author = "E. Leiss",
title = "Succinct representation of regular languages by
{Boolean} automata. {II}",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "1",
pages = "133--136",
month = may,
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 = "Dept. of Comput. Sci., Houston Univ., TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean automata; Boolean function; Boolean functions;
complementation; context-free languages; deterministic
automata; finite automata; language equations;
precisely attainable lower bound; reduced automaton;
regular languages; sequential networks; succinct
representation; transition function",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Finkel:1985:GTH,
author = "A. Finkel",
title = "A generalisation of the theorems of {Higman} and of
{Simon} to infinite words",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "1",
pages = "137--142",
month = may,
year = "1985",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Oct 26 07:53:28 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Univ. de Paris-Sud, Orsay, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "be a subword of; finite alphabet; finite words; formal
languages; generalised Higman's theorem; generalised
Simon's theorem; increasing subsequence; infinite
sequence; infinite words; quasi-order",
pubcountry = "Netherlands A11",
treatment = "T Theoretical or Mathematical",
}
@Article{Schmidt:1985:RTS,
author = "D. Schmidt",
title = "The recursion-theoretic structure of complexity
classes",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "2--3",
pages = "143--156",
month = jun,
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. fur Informat. I, Karlsruhe Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity classes; computational complexity;
diagonalization theorems; recursion-theoretic
structure",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Watanabe:1985:OOP,
author = "O. Watanabe",
title = "On one-one polynomial time equivalence relations",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "2--3",
pages = "157--165",
month = jun,
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 = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Inf. Sci., Tokyo Inst. of Technol., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity classes; computational complexity;
EXPTIM-P; EXPTIME complete sets; one-one polynomial
time equivalence relations; polynomials",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Imori:1985:PCS,
author = "M. Imori and H. Yamada",
title = "Periodic character sequences where identifying two
characters strictly reduces the period",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "2--3",
pages = "167--192",
month = jun,
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 = "C4220 (Automata theory)",
corpsource = "Fac. of Sci., Tokyo Univ., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cellular automata; finite automata; homomorphic map;
periodic character sequences; primitive period",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Burkhard:1985:ICC,
author = "H. D. Burkhard",
title = "An investigation of controls for concurrent systems
based on abstract control languages",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "2--3",
pages = "193--122",
month = jun,
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 = "C4240 (Programming and algorithm theory); C6150J
(Operating systems)",
corpsource = "Sektion Math., Humboldt Univ., Berlin, East Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract control languages; concurrent systems;
deadlock avoidance; fairness; liveness; multiprocessing
programs; programming theory",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Jantzen:1985:ERE,
author = "M. Jantzen",
title = "Extending regular expressions with iterated shuffle",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "2--3",
pages = "223--247",
month = jun,
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Fachbereich Informat., Hamburg Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic language theory; finite expression; iterated
shuffle; Kleene star; multicounter machine; NSPACE;
product; programming theory; regular expressions
extending; union",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Asano:1985:ASH,
author = "T. Asano",
title = "An approach to the subgraph homeomorphism problem",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "2--3",
pages = "249--267",
month = jun,
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 = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Math. Eng. and Instrum. Phys., Tokyo Univ.,
Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "fixed pattern graph; graph theory; Kuratowski graphs;
NP- complete; polynomial time; subgraph homeomorphism
problem; Thomsen graph",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Mishra:1985:HVA,
author = "B. Mishra and E. Clarke",
title = "Hierarchical verification of asynchronous circuits
using temporal logic",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "2--3",
pages = "269--291",
month = jun,
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)",
corpsource = "Dept. of Comput. Sci., Carnegie-Mellon Univ.,
Pittsburgh, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "asynchronous circuits; branching time temporal logic;
correctness; formal logic; hierarchical verification;
nondeterminism; temporal logic",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Gonzalez:1985:CMM,
author = "T. F. Gonzalez",
title = "Clustering to minimize the maximum intercluster
distance",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "2--3",
pages = "293--306",
month = jun,
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 = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Programs in Comput. Sci., Texas Univ., Richardson, TX,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm theory; approximation algorithm; clustering;
graph theory; maximum intercluster distance;
minimisation; objective function value; triangular
inequality",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Harel:1985:PLR,
author = "D. Harel and D. Peleg",
title = "Process logic with regular formulas",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "2--3",
pages = "307--322",
month = jun,
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)",
corpsource = "Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot,
Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "extension RPL; formal logic; Kleene's regular
operators; process logic; program behaviour; regular
formulas",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Rosenkrantz:1985:TGC,
author = "D. J. Rosenkrantz and H. B. {Hunt, III}",
title = "Testing for grammatical coverings",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "2--3",
pages = "323--341",
month = jun,
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)",
corpsource = "Dept. of Comput. Sci., State Univ. of New York,
Albany, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational problem; context-free grammars;
deterministic polynomial time algorithms; grammar
homomorphism; grammar isomorphism; grammatical
coverings testing; interpretation; mappings;
NP-complete; Reynolds covering; weak Reynolds
covering",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Linial:1985:DHC,
author = "N. Linial and M. Tarsi",
title = "Deciding hypergraph $2$-colourability by
{H}-resolution",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "2--3",
pages = "343--347",
month = jun,
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 = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Inst. of Math. and Comput. Sci., Hebrew Univ.,
Jerusalem, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean formulas; computational problem; graph
colouring; H-resolution; hypergraph 2-colourability
deciding; propositional calculus; satisfiability
problem",
pubcountry = "Netherlands A11",
treatment = "T Theoretical or Mathematical",
}
@Article{Anonymous:1985:TCF,
author = "Anonymous",
title = "{Third Conference on Foundations of Software
Technology and Theoretical Computer Science}",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "1",
pages = "??--??",
month = jul,
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); C6110 (Systems analysis and
programming)",
conflocation = "Bangalore, India; 12-14 Dec. 1983",
conftitle = "Third Conference on Foundations of Software Technology
and Theoretical Computer Science",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cancellation properties; communicating processes;
context-free grammars; linear equations; logic
programming; logic programs; modulator proofs;
observational equivalence; optimal fixed points;
polynomials; proof-theoretic characterisation; software
engineering; software technology; stability; trace
semantics",
pubcountry = "Netherlands",
sponsororg = "Nat. Centre Software Dev. and Comput. Tech",
}
@Article{Frougny:1985:CFG,
author = "C. Frougny",
title = "Context-free grammars with cancellation properties",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "1",
pages = "3--13",
month = jul,
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)",
conflocation = "Bangalore, India; 12-14 Dec. 1983",
conftitle = "Third Conference on Foundations of Software Technology
and Theoretical Computer Science",
corpsource = "LITP and UER de Math., Univ. Paris V, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cancellation properties; context-free grammar;
context-free grammars; free monoid; general algebraic
construction; Hotz monoid; Rees quotient; syntactic
monoid",
pubcountry = "Netherlands A01",
sponsororg = "Nat. Centre Software Dev. and Comput. Tech",
treatment = "T Theoretical or Mathematical",
}
@Article{Lassez:1985:OFL,
author = "J.-L. Lassez and M. J. Maher",
title = "Optimal fixedpoints of logic programs",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "1",
pages = "15--25",
month = jul,
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 = "C6110 (Systems analysis and programming)",
conflocation = "Bangalore, India; 12-14 Dec. 1983",
conftitle = "Third Conference on Foundations of Software Technology
and Theoretical Computer Science",
corpsource = "Dept. of Comput. Sci., Melbourne Univ., Parkville,
Vic., Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "least fixedpoint semantics; logic programming; logic
programs; optimal fixed points; recursive programming",
pubcountry = "Netherlands A02",
sponsororg = "Nat. Centre Software Dev. and Comput. Tech",
treatment = "T Theoretical or Mathematical",
}
@Article{Stirling:1985:PTC,
author = "C. Stirling",
title = "A proof-theoretic characterization of observational
equivalence",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "1",
pages = "27--45",
month = jul,
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)",
conflocation = "Bangalore, India; 12-14 Dec. 1983",
conftitle = "Third Conference on Foundations of Software Technology
and Theoretical Computer Science",
corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal languages; modal language; modal proof systems;
nondeterministic languages; observational equivalence;
proof-theoretic characterization",
pubcountry = "Netherlands A03",
sponsororg = "Nat. Centre Software Dev. and Comput. Tech",
treatment = "T Theoretical or Mathematical",
}
@Article{Back:1985:STS,
author = "R. J. R. Back and H. Mannila",
title = "On the suitability of trace semantics for modular
proofs of communicating processes",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "1",
pages = "47--68",
month = jul,
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 = "C4290 (Other computer theory)",
conflocation = "Bangalore, India; 12-14 Dec. 1983",
conftitle = "Third Conference on Foundations of Software Technology
and Theoretical Computer Science",
corpsource = "Dept. of Inf. Processing, Abo Akademi, Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstraction; communicating processes; distributed
processing; modular proofs; partial correctness;
semantic model; suitability; trace model; trace
semantics",
pubcountry = "Netherlands A04",
sponsororg = "Nat. Centre Software Dev. and Comput. Tech",
treatment = "T Theoretical or Mathematical",
}
@Article{Kannan:1985:SSL,
author = "R. Kannan",
title = "Solving systems of linear equations over polynomials",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "1",
pages = "69--88",
month = jul,
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 = "B0290F (Interpolation and function approximation);
C4130 (Interpolation and function approximation)",
conflocation = "Bangalore, India; 12-14 Dec. 1983",
conftitle = "Third Conference on Foundations of Software Technology
and Theoretical Computer Science",
corpsource = "Dept. of Comput. Sci., Carnegie-Mellon Univ.,
Pittsburgh, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Hermite form; linear equations; matrix; matrix
algebra; polynomials; triangular canonical form",
pubcountry = "Netherlands A05",
sponsororg = "Nat. Centre Software Dev. and Comput. Tech",
treatment = "T Theoretical or Mathematical",
}
@Article{Ibarra:1985:ERT,
author = "O. H. Ibarra and M. A. Palis and J. H. Chang",
title = "On efficient recognition of transductions and
relations",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "89--106",
month = aug,
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); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; computational complexity;
context-free language recognition; context-free
languages; counter machines; depth-first search;
dynamic programming; k-tape one-way nondeterministic
pushdown acceptors; language recognition; pushdown
machines; relations; transductions; translation;
unit-cost random access machine",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Priese:1985:FDM,
author = "L. Priese",
title = "On a fast decomposition method in some models of
concurrent computations",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "107--121",
month = aug,
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 = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Fachbereich Math. und Inf., Univ. Gesamthochschule
Paderborn, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "asynchronous control modules; automata theory;
computational complexity; concurrent automation;
concurrent computations; data flow machines; fast
decomposition method; network-type models;
output-lines; parallel computations; parallel
processing; Petri nets; sequential machines;
speed-independent modules",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Kapur:1985:CRP,
author = "D. Kapur and P. Narendran and M. S. Krishnamoorthy and
McNaughton and R.",
title = "The {Church--Rosser} property and special {Thue}
systems",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "123--133",
month = aug,
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Comput. Sci. Branch, G.E. Res. and Dev. Center,
Schenectady, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Church--Rosser property; computational complexity;
empty string; Thue systems",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Bohm:1985:AST,
author = "Corrado B{\"o}hm and Alessandro Berarducci",
title = "Automatic synthesis of typed {$\Lambda$}-programs on
term algebras",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "135--153",
month = aug,
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dipartimento di Matematica, Roma Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automatic synthesis; automatic uniform synthesis
paradigms; completeness theorem; computational
complexity; iterative functions; iteratively defined
functions; programming language; programming theory;
second-order types lambda calculus; term algebras;
tree-structures; typed Lambda -programs",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Parigot:1985:LAP,
author = "M. Parigot and E. Pelz",
title = "A logical approach of {Petri} net languages",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "155--169",
month = aug,
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "UER de Math. et Inf., Paris VII Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Buchi-like theorem; deadlock languages; directed
graphs; finite automata; formal languages; logical
approach; logical formulas; Petri net languages;
regular expressions",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Spehner:1985:ESE,
author = "J.-C. Spehner",
title = "Entire systems of equations on a finite alphabet and
{Ehrenfeucht}'s conjecture",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "171--188",
month = aug,
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 = "C4220 (Automata theory)",
corpsource = "Inst. des Sci., Exactes et Appl., Univ. de Haute
Alsace, Mulhouse, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; Ehrenfeucht conjecture; entire
systems of equations; finite alphabet; generalized
automaton; morphism; morphisms; shuffle automation",
language = "French",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{RodriguezArtalejo:1985:SQA,
author = "M. {Rodriguez Artalejo}",
title = "Some questions about expressiveness and relative
completeness in {Hoare}'s logic",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "189--206",
month = aug,
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)",
corpsource = "Dept. de Ecuaciones Funcionales, Univ. Complutense,
Madrid, Spain",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "completeness; expressiveness; formal logic; Hoare
logic; strong relative incompleteness; true partial
correctness assertion; unwind property;
while-programs",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Mahaney:1985:RAP,
author = "S. R. Mahaney and P. Young",
title = "Reductions among polynomial isomorphism types",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "207--224",
month = aug,
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 = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory)",
corpsource = "AT and T Bell Labs., Murray Hill, NJ, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "classical recursive function theory; computational
complexity; Karp-reducible; many-one degree;
NP-complete sets; polynomial isomorphism types;
polynomially invertible reductions; polynomials;
size-increasing",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Joseph:1985:SRW,
author = "D. Joseph and P. Young",
title = "Some remarks on witness functions for nonpolynomial
and noncomplete sets in {NP}",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "225--237",
month = aug,
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 = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; coNP; k-creative set;
noncomplete sets; nonpolynomial sets; NP; polynomially
computable function; polynomials; witness functions",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Hull:1985:NFS,
author = "R. Hull",
title = "Non-finite specifiability of projections of functional
dependency families",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "239--265",
month = aug,
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 = "C4250 (Database theory); C6160D (Relational
databases)",
corpsource = "Dept. of Comput. Sci., Univ. of Southern California,
Los Angeles, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "database theory; functional dependency families;
implicational dependency family; nonfinite
specifiability; projections; relational database
instances; relational databases",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Vogel:1985:TWA,
author = "J. Vogel and K. Wagner",
title = "Two-way automata with more than one storage medium",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "267--280",
month = aug,
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 = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Sektion Math., Friedrich-Schiller Univ., Jena, East
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; checking stacks; computational
complexity; computational power; nonerasing stack;
pushdown store; space complexity classes; storage
medium; two-way automata",
pubcountry = "Netherlands A11",
treatment = "T Theoretical or Mathematical",
}
@Article{Siromoney:1985:IWO,
author = "R. Siromoney and V. R. Dare",
title = "On infinite words obtained by selective substitution
grammars",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "281--295",
month = aug,
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)",
corpsource = "Dept. of Math., Madras Christian Coll., India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "closure properties; decidability; grammars; infinite
words; limit language families; limiting processes;
selective substitution grammars",
pubcountry = "Netherlands A12",
treatment = "T Theoretical or Mathematical",
}
@Article{Haken:1985:IR,
author = "A. Haken",
title = "The intractability of resolution",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "297--308",
month = aug,
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Toronto Univ., Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; infinitely many disjunctive
normal form propositional calculus tautologies;
intractability; pigeonhole principle; polynomial;
resolution",
pubcountry = "Netherlands A13",
treatment = "T Theoretical or Mathematical",
}
@Article{Ginsburg:1985:CTS,
author = "S. Ginsburg and E. H. Spanier",
title = "On completing tables to satisfy functional
dependencies",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "309--317",
month = aug,
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 = "C4250 (Database theory); C6160D (Relational
databases)",
corpsource = "Dept. of Comput. Sci., Univ. of Southern California,
Los Angeles, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "completely-specified table; database theory;
functional dependencies; partially-specified table;
relational databases; sufficiency conditions",
pubcountry = "Netherlands A14",
treatment = "T Theoretical or Mathematical",
}
@Article{Book:1985:SNS,
author = "R. V. Book and F. Otto",
title = "On the security of name-stamp protocols",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "319--325",
month = aug,
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 = "C5620 (Computer networks and techniques); C6130
(Data handling techniques)",
corpsource = "Dept. of Math., California Univ., Santa Barbara, CA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cryptography; name-stamp protocols; p-parity cascade
protocols; protocols; security; two-party cascade
protocols",
pubcountry = "Netherlands A15",
treatment = "T Theoretical or Mathematical",
}
@Article{Leiss:1985:SSE,
author = "E. L. Leiss",
title = "On solving star equations",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "327--332",
month = aug,
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)",
corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "constant language; formal languages; language
equation; mapping; operations union; star equation;
uniqueness; unrestricted star",
pubcountry = "Netherlands A16",
treatment = "T Theoretical or Mathematical",
}
@Article{Arnold:1985:SCR,
author = "A. Arnold",
title = "A syntactic congruence for rational omega-languages",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "333--335",
month = aug,
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)",
corpsource = "Dept. de Math. et Inf., Poitiers Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal languages; rational omega-languages; syntactic
congruence",
pubcountry = "Netherlands A17",
treatment = "T Theoretical or Mathematical",
}
@Article{Bunder:1985:EKC,
author = "M. W. Bunder",
title = "An extension of {Klop}'s counterexample to the
{Church--Rosser} property to lambda-calculus with other
ordered pair combinators",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "2--3",
pages = "337--342",
month = aug,
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 = "C1160 (Combinatorial mathematics); C4230B
(Combinatorial switching theory)",
corpsource = "Dept. of Math., Wollongong Univ., NSW, Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Church--Rosser property; combinatorial mathematics;
combinatory logic; Klop counterexample; ordered pair
combinators",
pubcountry = "Netherlands A18",
treatment = "T Theoretical or Mathematical",
}
@Article{Karhumaki:1985:TEC,
author = "J. Karhumaki",
title = "On three-element codes",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "1",
pages = "3--11",
month = sep,
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 = "B6120B (Codes); C4210 (Formal logic)",
corpsource = "Dept. of Math., Turku Univ., Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded delay; codes; formal language theory; formal
languages; three-element codes; unique maximal
element",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Restivo:1985:RLB,
author = "A. Restivo and C. Reutenauer",
title = "Rational languages and the {Burnside} problem",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "1",
pages = "13--30",
month = sep,
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)",
corpsource = "Istituto di Matematica, Palermo Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded languages; Burnside problem; commutativity;
formal languages; pumping; rational languages; rational
power series; regularity conditions; square-free words;
syntactic monoid",
pubcountry = "Netherlands A02",
treatment = "B Bibliography; T Theoretical or Mathematical",
}
@Article{Blumer:1985:SAR,
author = "A. Blumer and J. Blumer and D. Haussler and A.
Ehrenfeucht and Chen and M. T. and J. Seiferas",
title = "The smallest automation recognizing the subwords of a
text",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "1",
pages = "31--55",
month = sep,
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 = "C4220 (Automata theory)",
corpsource = "Dept. of Math. and Comput. Sci., Denver Univ., CO,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite automata; linear time; partial deterministic
finite automaton; smallest automation; text subwords",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Schoning:1985:RAD,
author = "U. Schoning",
title = "Robust algorithms: a different approach to oracles",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "1",
pages = "57--66",
month = sep,
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. fur Inf., Stuttgart Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; deterministic polynomial
time algorithms; NP-complete problems; oracle machine;
probabilistic classes; robust algorithms",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Paige:1985:LTS,
author = "R. Paige and R. E. Tarjan and R. Bonic",
title = "A linear time solution to the single function coarsest
partition problem",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "1",
pages = "67--84",
month = sep,
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 = "C1180 (Optimisation techniques); C4220 (Automata
theory)",
corpsource = "Dept. of Comput. Sci., Rutgers Univ., New Brunswick,
NJ, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automated manufacturing; finite automata; finite state
automata; linear time solution; minimisation; single
function coarsest partition problem; state
minimization; woven fabric",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Bauer:1985:LRS,
author = "G. Bauer",
title = "n-level rewriting systems",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "2--3",
pages = "85--99",
month = "????",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Kaiserslautern Univ., West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite complete rewriting system; monoid; n-level
rewriting systems; programming theory",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Book:1985:VTA,
author = "R. V. Book and F. Otto",
title = "On the verifiability of two-party algebraic
protocols",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "2--3",
pages = "101--130",
month = "????",
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 = "B6210L (Computer communications); C5620 (Computer
networks and techniques); C6130 (Data handling
techniques)",
corpsource = "Dept. of Math., California Univ., Santa Barbara, CA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "communication protocols; cryptography; protocols;
public-key cryptosystems; two-party algebraic
protocols; verifiability",
pubcountry = "Netherlands A02",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Bucher:1985:TRG,
author = "W. Bucher and A. Ehrenfeucht and D. Haussler",
title = "On total regulators generated by derivation
relations",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "2--3",
pages = "131--148",
month = "????",
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)",
corpsource = "Inst. for Inf. Process., Tech. Univ. of Graz,
Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; derivation relations; formal
languages; regular language; total regulators;
well-quasi-order",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Aalbersberg:1985:CSP,
author = "I. J. J. Aalbersberg and G. Rozenberg",
title = "{CTS} systems and {Petri} nets",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "2--3",
pages = "149--162",
month = "????",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Inst. of Appl. Math. and Comput. Sci., Leiden Univ.,
Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automaton models; concurrent processes; context-free
grammar selector'; context-free grammars; coordinated
table selective substitution systems; CTS systems;
directed graphs; grammar; Petri nets; unifying
framework",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Ayers:1985:DAS,
author = "K. Ayers",
title = "Deque automata and a subfamily of context-sensitive
languages which contains all semilinear bounded
languages",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "2--3",
pages = "163--174",
month = "????",
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 = "Boise State Univ., ID, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; closure properties; context-sensitive
languages; grammars; lambda -linearly bounded deque
automata; ordered grammar; pushdown automaton;
semilinear bounded languages",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Kobayashi:1985:SOT,
author = "K. Kobayashi",
title = "On the structure of one-tape nondeterministic {Turing}
machine time hierarchy",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "2--3",
pages = "175--193",
month = "????",
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 = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Inf. Sci., Tokyo Inst. of Technol., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; crossing sequences;
Kolmogorov complexity; one-tape nondeterministic Turing
machine time hierarchy; Turing machines",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Huang:1985:IFS,
author = "Ming-Deh A. Huang and K. J. Lieberherr",
title = "Implications of forbidden structures for extremal
algorithmic problems",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "2--3",
pages = "195--210",
month = "????",
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 = "B0290F (Interpolation and function approximation);
C4130 (Interpolation and function approximation)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Princeton
Univ., NJ, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "approximation theory; extremal algorithmic problems;
forbidden structures; linear time; maximisation;
P-optimal approximation algorithms; P-optimal
thresholds; RAM; satisfiability problems",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Mascari:1985:WPN,
author = "G. Mascari and M. {Venturini Zilli}",
title = "While-programs with nondeterministic assignments and
the logic {ALNA}",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "2--3",
pages = "211--235",
month = "????",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Istituto per le Applicazioni del Calcolo 'Mauro
Picone', CNR, Roma, Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Algorithmic Logic for while-programs with
Nondeterministic Assignments; computation trees; logic
ALNA; nondeterministic assignments; programming theory;
semantical properties; trees (mathematics); unbounded
countable nondeterminism; while-programs",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Balcazar:1985:BQM,
author = "J. L. Balcazar and R. V. Book and U. Schoning",
title = "On bounded query machines",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "2--3",
pages = "237--243",
month = "????",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Fac. d'Inf., Univ. Politecnica de Barcelona, Spain",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded query machines; computational complexity",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Kanaoka:1985:HDS,
author = "T. Kanaoka and S. Tomita",
title = "Homogeneous decomposition of stochastic systems",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "2--3",
pages = "245--255",
month = "????",
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 = "C4220 (Automata theory)",
corpsource = "Fac. of Eng., Yamaguchi Univ., Ube, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; decomposition theory; homogeneous
decomposition; homogeneous whirl decomposition;
nonpseudostochastic; state splitting; stochastic
systems; transition matrices",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Abdali:1985:TCR,
author = "S. K. Abdali and B. D. Saunders",
title = "Transitive closure and related semiring properties via
eliminants",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "2--3",
pages = "257--274",
month = "????",
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 = "C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci. and Eng., Univ. of Pet. and
Min., Dhahran, Saudi Arabia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic structures; axiomatic formulation; closed
semirings; closure algorithms; computer science;
correctness; eliminants; finite automata;
graph-theoretical path problems; linear equations;
matrix closure; operations research; regular
expressions; semiring properties; transitive closure",
pubcountry = "Netherlands A11",
treatment = "T Theoretical or Mathematical",
}
@Article{Fogelman-Soulie:1985:PSC,
author = "F. Fogelman-Soulie",
title = "Parallel and sequential computation on {Boolean}
networks",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "2--3",
pages = "275--300",
month = "????",
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. de Dynamique des Reseaux, Paris, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "asymptotic behavior; automata theory; Boolean
functions; Boolean networks; computing elements;
discrete iterations; large assemblies; limit cycles;
model; parallel computation; sequential computation;
spatial characterization; spatial structure",
pubcountry = "Netherlands A12",
treatment = "T Theoretical or Mathematical",
}
@Article{Ginzburg:1985:RSS,
author = "A. Ginzburg and M. Yoeli",
title = "Reducibility of synchronization structures",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "2--3",
pages = "301--314",
month = "????",
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 = "C4240 (Programming and algorithm theory); C6110
(Systems analysis and programming)",
corpsource = "Dept. of Comput. Sci., Technion-Israel Inst. of
Technol., Haifa, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "control structures; homomorphism; necessary and
sufficient conditions; posets; programming theory;
reducibility; structured programming; synchronisation;
synchronization structures",
pubcountry = "Netherlands A13",
treatment = "T Theoretical or Mathematical",
}
@Article{Urbanek:1985:GNF,
author = "F. J. Urbanek",
title = "On {Greibach} normal form construction",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "2--3",
pages = "315--317",
month = "????",
year = "1985",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Oct 26 07:53:09 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. fur Algebra und Diskrete Math., Tech. Univ.,
Wien, Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Chomsky normal form grammar; context-free grammars;
derivation-oriented reasoning; Greibach normal form;
Greibach normal form construction",
pubcountry = "Netherlands A14",
treatment = "T Theoretical or Mathematical",
}
@Article{Kaminski:1985:LBP,
author = "M. Kaminski",
title = "A lower bound for polynomial multiplication",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "2--3",
pages = "319--322",
month = "????",
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 = "B0290F (Interpolation and function approximation);
C4130 (Interpolation and function approximation)",
corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "lower bound; polynomial multiplication; polynomials;
two third degree polynomials",
pubcountry = "Netherlands A15",
treatment = "T Theoretical or Mathematical",
}
@Article{Krishnamoorthy:1985:RPO,
author = "M. S. Krishnamoorthy and P. Narendran",
title = "On recursive path ordering",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "2--3",
pages = "323--328",
month = "????",
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 = "C4200 (Computer theory)",
corpsource = "Dept. of Comput. Sci., Rensselaer Polytech. Inst.,
Troy, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computation theory; function symbols; NP-complete;
partial order; recursive path ordering; well-founded
partial order",
pubcountry = "Netherlands A16",
treatment = "T Theoretical or Mathematical",
}
@Article{Gonthier:1985:ACP,
author = "G. Gonthier",
title = "Algebraic calculi of processes and net expressions",
journal = j-THEOR-COMP-SCI,
volume = "40",
number = "2--3",
pages = "329--337",
month = "????",
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 = "B0210 (Algebra); B0250 (Combinatorial mathematics);
C1110 (Algebra); C1160 (Combinatorial mathematics)",
corpsource = "CMA-ENSMP Sophia-Antipolis, Valbonne, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebra; algebraic calculi; flow algebra; graph
theory; MEIJE algebra; net expressions",
pubcountry = "Netherlands A17",
treatment = "T Theoretical or Mathematical",
}
@Article{Paun:1985:VRC,
author = "G. P{\u{a}}un",
title = "A variant of random context grammars: semi-conditional
grammars",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "1",
pages = "1--17",
month = "????",
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)",
corpsource = "Inst. of Math., Bucuresti, Romania",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free grammar; context-free grammars;
context-sensitive languages; generative capacity;
random context grammars; recursively enumerable
languages; semiconditional grammars",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Goles:1985:DPA,
author = "E. Goles",
title = "Dynamics of positive automata networks",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "1",
pages = "19--32",
month = "????",
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 = "C4220 (Automata theory)",
corpsource = "Dept. Matematicas, Chile Univ., Santiago, Chile",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; cycle length; dynamic behaviour;
Lyapunov function; Lyapunov methods; majority networks;
positive automata networks; threshold networks;
transient length",
pubcountry = "Netherlands A02",
treatment = "X Experimental",
}
@Article{Cazanescu:1985:CFT,
author = "V. E. Cazanescu",
title = "On context-free trees",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "1",
pages = "33--50",
month = "????",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Math., Bucharest Univ., Romania",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free grammars; context-free languages;
context-free trees; generalised iterative algebraic
theory; iterate; iterative methods; recursive programs;
trees (mathematics)",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Gohon:1985:ADW,
author = "P. Gohon",
title = "An algorithm to decide whether a rational subset of
{$N^k$} is recognizable",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "1",
pages = "51--59",
month = "????",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Lab. d'Inf., Univ. de Haute-Normandie, Mt.St. Aignan,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; decidability; formal power
series; rational subset; series (mathematics); set
theory; unambiguous rational expression",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Barbin-LeRest:1985:CTW,
author = "E. {Barbin-Le Rest} and M. {Le Rest}",
title = "On the combinatorial of two-word codes",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "1",
pages = "61--80",
month = "????",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Lab. d'Inf., Maine Univ., Le Mans, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "codes; combinatorial mathematics; disjoint
X-interpretations; factor; formal languages;
imprimitive word; two-word codes",
language = "French",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Iliopoulos:1985:CGA,
author = "C. S. Iliopoulos",
title = "Computing in general {Abelian} groups is hard",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "1",
pages = "81--93",
month = "????",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Warwick Univ., Coventry, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Abelian groups; canonical structure; computational
complexity; computational difficulty; cyclic group
testing; defining relations; element order; explicit
generator set; group theory; membership testing;
polynomial time reduction; primality testing; prime
factorisation; relative computational complexity",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Hayashi:1985:ASC,
author = "S. Hayashi",
title = "Adjunction of semifunctors: categorical structures in
nonextensional Lambda calculus",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "1",
pages = "95--104",
month = "????",
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)",
corpsource = "Res. Inst. for Math. Sci., Kyoto Univ., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "adjunction of semifunctors; calculus; Cartesian closed
categories; category theory; extensional typed lambda
-calculus; formal logic; nonextensional Lambda
calculus; Scott embedding; semi cartesian closed
category; semiadjunction",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Maon:1985:EPC,
author = "Y. Maon",
title = "On the equivalence problem of compositions of
morphisms and inverse morphisms on context-free
languages",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "1",
pages = "105--107",
month = "????",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Comput. Sci., Tel-Aviv Univ., Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "compositions; context-free languages; decidability;
equivalence classes; equivalence problem; inverse
morphisms",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Thibon:1985:IAF,
author = "J.-Y. Thibon",
title = "Integrity of algebras of formal series on a partially
commutative alphabet",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "1",
pages = "109--112",
month = "????",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Paris Univ., Paris, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebra; formal logic; formal power series; integral
domain; integrity; partially commutative alphabet;
ring; series (mathematics)",
language = "French",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Bunder:1985:PFE,
author = "M. W. Bunder",
title = "Possible forms of evaluation or reduction in
{Martin-L{\"o}f} type theory",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "1",
pages = "113--120",
month = "????",
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)",
corpsource = "Dept. of Math., Wollongong Univ., NSW, Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "evaluation procedures; formal logic; Martin-L{\"o}f
type theory; reductions",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Albert:1985:PEC,
author = "M. H. Albert and J. Lawrence",
title = "A proof of {Ehrenfeucht}'s conjecture",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "1",
pages = "121--123",
month = "????",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Pure Math., Waterloo Univ., Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "agreement; Ehrenfeucht's conjecture; endomorphisms;
finite subset; finitely generated free monoid; formal
languages; group theory; proof; set theory",
pubcountry = "Netherlands A11",
treatment = "T Theoretical or Mathematical",
}
@Article{Helfrich:1985:ACM,
author = "B. Helfrich",
title = "Algorithms to construct {Minkowski} reduced and
{Hermite} reduced lattice bases",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "2--3",
pages = "125--139",
month = "????",
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 = "B0290F (Interpolation and function approximation);
C4130 (Interpolation and function approximation)",
corpsource = "Fachbereich Math., Johann Wolfgang Goethe-Univ.,
Frankfurt-Main, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "fixed dimension; Hermite reduced lattice bases;
Minkowski reduced lattice bases; polynomial;
polynomials; runtime",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Monien:1985:BCN,
author = "B. Monien and I. H. Sudborough",
title = "Bandwidth constrained {NP-complete} problems",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "2--3",
pages = "141--167",
month = "????",
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 = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Fachbereich Math. und Inf., Paderborn Univ., West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "3- colorability; 3-dimensional matching;
3satisfiability; bandwidth constrained NP-complete
problems; bandwidth minimization; directed graphs;
exact cover by 3 sets; Hamiltonian circuit; hitting
set; independent set; log space complete; NTISP;
partition; polynomial time nondeterministic algorithms;
simple max cut; vertex cover",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Dahlhaus:1985:CTA,
author = "E. Dahlhaus and H. Gaifman",
title = "Concerning two-adjacent context-free languages",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "2--3",
pages = "169--184",
month = "????",
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)",
corpsource = "Dept. of Math., Tech. Univ. of Berlin, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; E0L- languages; negative
solution; two-adjacent context-free languages",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Reisig:1985:PNI,
author = "W. Reisig",
title = "Petri nets with individual tokens",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "2--3",
pages = "185--213",
month = "????",
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 = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Gesellschaft fur Math. und Datenverarbeitung, St.
Augustin, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "coloured nets; directed graphs; individual tokens;
Petri nets; place/transition nets; predicate/transition
nets; real systems",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Karhumaki:1985:PTE,
author = "J. Karhumaki",
title = "A property of three-element codes",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "2--3",
pages = "215--222",
month = "????",
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 = "B6120B (Codes); C1260 (Information theory)",
corpsource = "Dept. of Math., Turku Univ., Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "codes; finitely generated free monoid; property;
three-element codes",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Tomita:1985:WSC,
author = "E. Tomita and K. Seino",
title = "A weaker sufficient condition for the equivalence of a
pair of {DPDAs} to be decidable",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "2--3",
pages = "223--230",
month = "????",
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 = "C4220 (Automata theory)",
corpsource = "Dept. of Commun. Eng., Univ. of Electro-Commun.,
Tokyo, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic automata; deterministic pushdown
automata; equivalence; weaker sufficient condition",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Ibarra:1985:FPL,
author = "O. H. Ibarra and M. A. Palis and S. M. Kim",
title = "Fast parallel language recognition by cellular
automata",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "2--3",
pages = "231--246",
month = "????",
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 = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cellular automata; context-free languages; fast
parallel language recognition; finite automata; linear
automata; noncontext-free languages",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Pelz:1985:CTP,
author = "E. Pelz",
title = "On the complexity of theories of permutations",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "2--3",
pages = "247--269",
month = "????",
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); C4240 (Programming and
algorithm theory)",
corpsource = "LRI, Univ. de Paris-Sud, Orsay, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "ATM; computational complexity; decidability; decision
algorithm; first-order theory; lower bounds; NTM;
permutations theory complexity; upper bounds",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Grant:1985:IND,
author = "J. Grant and J. Minker",
title = "Inferences for numerical dependencies",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "2--3",
pages = "271--287",
month = "????",
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 = "C4250 (Database theory)",
corpsource = "Dept. of Comput. and Inf. Sci., Towson State Univ.,
MD, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "database theory; first-order logic; functional
dependencies; Horn formulas; inference rules; numerical
dependencies",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Hirokawa:1985:CCR,
author = "S. Hirokawa",
title = "Complexity of the combinator reduction machine",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "2--3",
pages = "289--303",
month = "????",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Shizuoka Univ., Hamamatsu,
Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "combinator codes; combinator reduction machine
complexity; combinatorial mathematics; computational
complexity; linearity coefficient; recursive programs;
reduction steps",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Slutzki:1985:ATA,
author = "G. Slutzki",
title = "Alternating tree automata",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "2--3",
pages = "305--318",
month = "????",
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 = "C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Iowa State Univ., Ames, IA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alternating automata; alternation; automata theory;
deterministic automata; nondeterministic automata; tree
automata; universal automata",
pubcountry = "Netherlands A11",
treatment = "T Theoretical or Mathematical",
}
@Article{Stoss:1985:CEI,
author = "H.-J. Stoss",
title = "The complexity of evaluating interpolation
polynomials",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "2--3",
pages = "319--323",
month = "????",
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 = "B0290F (Interpolation and function approximation);
C4130 (Interpolation and function approximation); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Math., Konstanz Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; interpolation; Lagrangian
interpolation polynomial; polynomials",
pubcountry = "Netherlands A12",
treatment = "T Theoretical or Mathematical",
}
@Article{MeyerAufDerHeide:1985:SPD,
author = "F. {Meyer Auf Der Heide}",
title = "Simulating probabilistic by deterministic algebraic
computation trees",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "2--3",
pages = "325--330",
month = "????",
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 = "B0250 (Combinatorial mathematics); C1140Z (Other
topics in statistics); C1160 (Combinatorial
mathematics)",
corpsource = "IBM Res. Lab., San Jose, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic algebraic computation trees; linear
search algorithms; probabilistic algebraic computation
tree; probability; trees (mathematics)",
pubcountry = "Netherlands A13",
treatment = "T Theoretical or Mathematical",
}
@Article{Inoue:1985:ALT,
author = "K. Inoue and I. Takanami and R. Vollmar",
title = "Alternating on-line {Turing} machines with only
universal states and small space bounds",
journal = j-THEOR-COMP-SCI,
volume = "41",
number = "2--3",
pages = "331--339",
month = "????",
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 = "C4220 (Automata theory)",
corpsource = "Dept. of Electron., Yamaguchi Univ., Ube, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alternating online Turing machines; small space
bounds; Turing machines; universal states",
pubcountry = "Netherlands A14",
treatment = "T Theoretical or Mathematical",
}
@Article{Courcelle:1986:ETR,
author = "B. Courcelle",
title = "Equivalences and transformations of regular
systems-applications to recursive program schemes and
grammars",
journal = j-THEOR-COMP-SCI,
volume = "42",
number = "1",
pages = "1--122",
month = may,
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4130
(Interpolation and function approximation); C4210
(Formal logic)",
corpsource = "Dept. of Math. and Comput. Sci., Bordeaux-1 Univ.,
Talence, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic laws; arbitrary algebraic structures;
classical transformations; context-free grammars;
equational algebraic laws; equivalences; folding;
grammars; graph theory; graphs; polynomial systems;
polynomials; recursive program schemes; regular
systems; system transformations; transformations;
trees; trees (mathematics); unfolding; unified theory",
pubcountry = "Netherlands A01",
treatment = "B Bibliography; T Theoretical or Mathematical",
}
@Article{Wirsing:1986:SAS,
author = "M. Wirsing",
title = "Structured algebraic specifications: a kernel
language",
journal = j-THEOR-COMP-SCI,
volume = "42",
number = "2",
pages = "123--249",
month = aug,
year = "1986",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Fakultat fur Math. und Inf., Passau Univ., West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "ASL; complete semiformal proof system; computability;
data structures; declarative high-order language;
denotational semantics; homomorphism; kernel language;
model class semantics; observability; presentation
semantics; primitive operations; programming theory;
recursive enumerability; recursive functions;
recursively enumerable signature; specification
languages; structured algebraic specifications;
structured programming",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Engelfriet:1986:PMM,
author = "J. Engelfriet and H. Vogler",
title = "Pushdown machines for the macro tree transducer",
journal = j-THEOR-COMP-SCI,
volume = "42",
number = "3",
pages = "251--368",
month = oct,
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Twente Univ. of Technol.,
Enschede, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; generalized pushdown; iterated
pushdown; iterative control; macro tree transducer;
macro tree-to-string transducers; n-fold composition;
programming language semantics; pushdown machines;
recursive control without parameters; recursive
function procedures; recursive functions; total
deterministic transducer; tree translations;
tree-to-string translations; trees (mathematics)",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Grzymala-Busse:1986:CSI,
author = "J. W. Grzymala-Busse and Z. Bavel",
title = "Characterization of state-independent automata",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "1",
pages = "1--10",
month = may,
year = "1986",
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 = "C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Kansas Univ., Lawrence, KS,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; characterisation; semigroup automata;
state-independent automata",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Scheuing:1986:DLA,
author = "A. Scheuing",
title = "Decomposition of linear automata over residue rings
into shift-registers",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "1",
pages = "11--30",
month = may,
year = "1986",
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 = "C4220 (Automata theory)",
corpsource = "Inst. fur Inf. und Angewandte Math., Bern Univ.,
Switzerland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "artin local rings; automata theory; decomposition;
linear automata; necessary and sufficient conditions;
residue rings; shift registers; shift-registers",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Ronse:1986:TCT,
author = "C. Ronse",
title = "A topological characterization of thinning",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "1",
pages = "31--41",
month = may,
year = "1986",
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 = "C1250 (Pattern recognition)",
corpsource = "Philips Res. Lab., Bruxelles, Belgium",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "binary images; picture processing; skeletonization
algorithms; strong k-deletability; thinning;
topological characterization; topology",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Goldschlager:1986:CPC,
author = "L. M. Goldschlager and I. Parberry",
title = "On the construction of parallel computers from various
bases of {Boolean} functions",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "1",
pages = "43--58",
month = may,
year = "1986",
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); C4240 (Programming and
algorithm theory)",
corpsource = "Basser Dept. of Comput. Sci., Sydney Univ., NSW,
Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean functions; computational complexity; EP;
P-complete set; parallel computers; parallel
processing; tournament isomorphism; Turing machines",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Redziejowski:1986:IWL,
author = "R. R. Redziejowski",
title = "Infinite-word languages and continuous mappings",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "1",
pages = "59--79",
month = may,
year = "1986",
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 = "IBM Nordic Lab., Lidingo, Sweden",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; continuous mappings; formal
languages; functionally closed sets; infinite word
languages; strongly zero-dimensional; topological
space",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Orlowska:1986:SAI,
author = "E. Orlowska",
title = "Semantic analysis of inductive reasoning",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "1",
pages = "81--89",
month = may,
year = "1986",
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 = "C4250 (Database theory)",
corpsource = "Inst. of Comput. Sci., Polish Acad. of Sci., Warsaw,
Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "database theory; expert decisions; inductive
generalisations; inductive learning; inductive
reasoning; semantic analysis",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Hansel:1986:DSP,
author = "G. Hansel",
title = "The demonstration of a simple proof of
Skolem-Mahler-Lech theorem",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "1",
pages = "91--98",
month = may,
year = "1986",
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 = "C4220 (Automata theory)",
corpsource = "Lab. d'inf., Fac. des Sci., Mont-Saint-Aignan,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; characteristic zero; commutative
field; rational series; recognizable series;
Skolem-Mahler-Lech theorem",
language = "French",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Clote:1986:FCP,
author = "P. Clote",
title = "On the finite containment problem for {Petri} nets",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "1",
pages = "99--105",
month = may,
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Oct 26 07:53:56 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Boston Coll., Chestnut Hill, MA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Ackermann theorem; combinatorial mathematics;
combinatorial problems; directed graphs; finite
containment problem; infinite Ramsey Theorem; Petri
nets; reducibility",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Lindsay:1986:AOT,
author = "P. A. Lindsay",
title = "Alternation and omega-type {Turing} acceptors",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "1",
pages = "107--115",
month = may,
year = "1986",
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 = "C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Manchester Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "omega-languages; omega-type Turing acceptors;
recursion-theoretic hierarchies; Turing machines",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Albert:1986:TSF,
author = "M. H. Albert and J. Lawrence",
title = "Test sets for finite substitutions",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "1",
pages = "117--122",
month = may,
year = "1986",
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)",
corpsource = "Dept. of Pure Math., Waterloo Univ., Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Ehrenfeucht conjecture; endomorphisms; finite subset;
finite substitutions; finitely generated free monoid;
formal languages; free algebra; Konig Lemma; test
sets",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Berghammer:1986:RAS,
author = "R. Berghammer and H. Zierer",
title = "Relational algebraic semantics of deterministic and
nondeterministic programs",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "2--3",
pages = "123--147",
month = "????",
year = "1986",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. fur Inf., Tech. Univ. Munchen, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract relational algebra; algebra; angelic
nondeterminism; correctness proving; demonic
nondeterminism; denotational semantics; deterministic
language; DFP; erratic nondeterminism; NFP;
nondeterministic functional language; nondeterministic
programs; program transformation rule; programming
languages; programming theory; relational algebraic
semantics; termination proving",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Heering:1986:PEO,
author = "J. Heering",
title = "Partial evaluation and omega-completeness of algebraic
specifications",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "2--3",
pages = "149--167",
month = "????",
year = "1986",
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); C4240 (Programming and
algorithm theory)",
corpsource = "Centre for Math. and Comput. Sci., Amsterdam,
Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebra; algebraic specifications; equational logic;
formal logic; incomplete information; initial algebra
specification; maximal propagation; mixed computation;
omega-completeness; partial evaluation; programming
theory; specialised residual program; term rewriting
systems",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Jerrum:1986:RGC,
author = "M. R. Jerrum and L. G. Valiant and V. V. Vazirani",
title = "Random generation of combinatorial structures from a
uniform distribution",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "2--3",
pages = "169--188",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "almost uniform generation; approximate counting;
combinatorial mathematics; combinatorial structures;
computational complexity; exactly uniform generation;
polynomial hierarchy; random generation; randomised
approximate counting; self-reducible problems; uniform
distribution",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Fages:1986:CSU,
author = "F. Fages and G. Huet",
title = "Complete sets of unifiers and matchers in equational
theories",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "2--3",
pages = "189--200",
month = "????",
year = "1986",
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)",
corpsource = "CNRS, INRIA, Le Chesnay, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebra; equational theories; formal logic; matching
problems; minimal matchers; minimal unifiers;
nonexistence of complete sets; unification",
pubcountry = "Netherlands A04",
treatment = "B Bibliography; T Theoretical or Mathematical",
}
@Article{Wegener:1986:MCS,
author = "I. Wegener",
title = "More on the complexity of slice functions",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "2--3",
pages = "201--211",
month = "????",
year = "1986",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Johann Wofgang Goethe-Univ., Frankfurt am Main, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean functions; circuit complexity; complexity
theory; computational complexity; explicitly defined
Boolean function; monotone complexity; monotone
representation; nonlinear lower bounds;
pseudocomplements; slice functions",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Janicki:1986:CMC,
author = "R. Janicki and P. E. Lauer and M. Koutny and R.
Devillers",
title = "Concurrent and maximally concurrent evolution of
nonsequential systems",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "2--3",
pages = "213--238",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Inst. of Electron. Syst., Aalborg Univ. Centre,
Denmark",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract model; COSY path expression formalism;
equivalence; equivalence classes; maximally concurrent
evolution; maximally concurrent semantics;
nonsequential systems; parallel processing; programming
theory",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Landau:1986:ESM,
author = "G. M. Landau and U. Vishkin",
title = "Efficient string matching with k mismatches",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "2--3",
pages = "239--249",
month = "????",
year = "1986",
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 = "C1250 (Pattern recognition); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Tel Aviv Univ., Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; pattern matching; pattern
recognition; string matching",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Pasztor:1986:SIC,
author = "A. Pasztor and R. Statman",
title = "Scott induction and closure under omega-sups",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "2--3",
pages = "251--263",
month = "????",
year = "1986",
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)",
corpsource = "Dept. of Math., Carnegie-Mellon Univ., Pitsburgh, PA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "closure under omega-sups; computability; definability;
effectiveness; finite axiomatisation; formal languages;
LCF; logic of computable functions; logic of continuous
functionals; necessary condition; Scott induction;
sufficient condition",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{deLuca:1986:SFS,
author = "A. {de Luca} and A. Restivo",
title = "Star-free sets of integers",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "2--3",
pages = "265--275",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Dipartimento di Matematica, Rome Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite automata; formal languages; nonnegative
integers; number theory; recognisable sets; set theory;
star-free integer sets",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Suzuki:1986:SVD,
author = "I. Suzuki and Y. Motohashi and K. Taniguchi and T.
Kasami and T. Okamoto",
title = "Specification and verification of decentralized daisy
chain arbiters with omega-extended regular
expressions",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "2--3",
pages = "277--291",
month = "????",
year = "1986",
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); C4230 (Switching theory);
C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Electr. Eng., Texas Tech Univ., Lubbock, TX,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computer interfaces; concurrent processes; containment
problem; decentralized daisy chain arbiters;
distributed processing; eventuality; finite event
sequences; formal logic; infinite event sequences;
liveness; logical circuits; omega-extended regular
expressions; programming theory; property proving;
property specification; property verification;
switching networks; temporal logic",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Adamek:1986:CS,
author = "J. Adamek and J. Reiterman and E. Nelson",
title = "Continuous semilattices",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "2--3",
pages = "293--313",
month = "????",
year = "1986",
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); C4240 (Programming and
algorithm theory)",
corpsource = "Tech. Univ., Prague, Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal logic; free continuous semilattices; join
preservation; join-continuity; programming theory",
pubcountry = "Netherlands A11",
treatment = "T Theoretical or Mathematical",
}
@Article{Saoudi:1986:VAD,
author = "A. Saoudi",
title = "Varieties of automata deriving from infinite trees",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "2--3",
pages = "315--335",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); 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/",
keywords = "automata theory; B-variety; Bi-automata; Buchi
automata; closure properties; determinism; formal
languages; infinite tree language recognition;
M-variety; McNaughton theorem; Mi-automata; Muller
automata; nondeterminism; trees (mathematics)",
pubcountry = "Netherlands A12",
treatment = "T Theoretical or Mathematical",
}
@Article{Edwards:1986:CCP,
author = "K. Edwards",
title = "The complexity of colouring problems on dense graphs",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "2--3",
pages = "337--343",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Math. Inst., Oxford Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "colouring problems; computational complexity; dense
graphs; deterministic polynomial time algorithm;
enumeration problems; graph colouring; vertex
k-colouring",
pubcountry = "Netherlands A13",
treatment = "T Theoretical or Mathematical",
}
@Article{Johnson:1986:SPT,
author = "D. B. Johnson",
title = "A simple proof of a time-space trade-off for sorting
with linear comparisons",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "2--3",
pages = "345--350",
month = "????",
year = "1986",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math., Dartmouth Coll., Hanover, NH, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; linear branching programs;
sorting; sorting with linear comparisons; time-space
trade-off",
pubcountry = "Netherlands A14",
treatment = "T Theoretical or Mathematical",
}
@Article{Ritzmann:1986:FNA,
author = "P. Ritzmann",
title = "A fast numerical algorithm for the composition of
power series with complex coefficients",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "1",
pages = "1--16",
month = "????",
year = "1986",
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 = "C4130 (Interpolation and function approximation);
C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Inst. fur Angewandte Math., Zurich Univ.,
Switzerland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Brent-Kung algorithm; complex coefficients;
composition problem; computation model; computational
complexity; fast numerical algorithm; integer
coefficients; interpolation; interpolation methods;
m-bit numbers; modulus; multitape Turing machines;
Turing machines; univariate complex power series",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Blanchard:1986:CS,
author = "F. Blanchard and G. Hansel",
title = "Coded systems",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "1",
pages = "17--49",
month = "????",
year = "1986",
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. de Probabilit{\'e}s, Paris 6 Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; Bernoulli shifts; coded systems;
finitarily isomorphic; formal languages; homomorphisms;
invariant measures; symbolic dynamical systems;
transitive sofic systems",
language = "French",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Leivant:1986:TCP,
author = "D. Leivant",
title = "Typing and computational properties of lambda
expressions",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "1",
pages = "51--68",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Comput. Sci., Carnegie-Mellon Univ.,
Pittsburgh, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "calculus; combinatorial mathematics; computational
properties; expressions; formal logic; lambda
-Calculus; lambda expressions; normalizability;
second-order typing; semantic properties; solvability;
strong normalizability",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Rosier:1986:BEC,
author = "L. E. Rosier and H.-C. Yen",
title = "Boundedness, empty channel detection, and
synchronization for communicating finite automata",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "1",
pages = "69--105",
month = "????",
year = "1986",
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 = "B6110 (Information theory); C4220 (Automata
theory)",
corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "boundedness problem; CFSMs; communicating finite state
machines; empty channel detection; FIFO networks;
finite automata; signal detection; synchronization;
telecommunication channels; telecommunication networks;
VASSs; vector addition systems with states; zero
testing",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Blanchard:1986:DOP,
author = "F. Blanchard and S. Martinez",
title = "Dense orbit points of certain languages of infinite
words",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "1",
pages = "107--110",
month = "????",
year = "1986",
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)",
corpsource = "Lab. de Probabilit{\'e}s, Paris 6 Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "dense orbit points, rational factor set; doubly
infinite word; formal languages; infinite words;
languages; periodic; rationality; Topological Dynamics;
transitive",
language = "French",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Chang:1986:PA,
author = "J. H. Chang and O. H. Ibarra and M. A. Palis and B.
Ravikumar",
title = "On pebble automata",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "1",
pages = "111--121",
month = "????",
year = "1986",
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 = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic checking stack automata; formal
languages; halting; language families; pebble automata;
recognition power; space-bounded Turing machines; TMs;
Turing machines; two-way deterministic pushdown
automata",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Paul:1986:SEP,
author = "E. Paul",
title = "On solving the equality problem in theories defined by
{Horn} clauses",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "2",
pages = "127--153",
month = "????",
year = "1986",
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 = "C1230 (Artificial intelligence); C4210 (Formal
logic)",
corpsource = "CNET, Issy Les Moulineaux, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "completeness property; equality problem; formal logic;
Horn clauses; Knuth--Bendix completion procedure;
nonequational theories; proof by induction; reflexivity
axiom; resolution/paramodulation-based methods; theorem
proving; universally quantified formulae; weak
axiomatization of Boolean calculus",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Leiss:1986:GLE,
author = "E. L. Leiss",
title = "Generalized language equations with multiple
solutions",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "2",
pages = "155--174",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "1- reducible substitution graph; equations; formal
languages; generalized language equation; graph theory;
multiple solutions; regular languages",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Kobayashi:1986:RFW,
author = "Y. Kobayashi",
title = "Repetition-free words",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "2",
pages = "175--197",
month = "????",
year = "1986",
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)",
corpsource = "Dept. of Math. and Comput. Sci., Tokushima Univ.,
Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "density function; formal languages; global structure;
repetition-free homomorphisms; repetition-free infinite
words; repetition-free words",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Diekert:1986:CST,
author = "V. Diekert",
title = "Complete {semi-Thue} systems for {Abelian} groups",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "2",
pages = "199--208",
month = "????",
year = "1986",
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)",
corpsource = "Inst. fur Inf., Tech. Univ. Munchen, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complete semi-Thue systems; decidability; decidable
word problem; finite semi-Thue systems; finitely
generated Abelian groups; formal languages",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Etzion:1986:AGS,
author = "T. Etzion",
title = "An algorithm for generating shift-register cycles",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "2",
pages = "209--224",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4290 (Other
computer theory)",
corpsource = "Dept. of Comput. Sci., Technion-Israel Inst. of
Technol., Haifa, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "binary sequence generation; combinatorial mathematics;
series (mathematics); shift registers; shift-register
cycle generation",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Okawa:1986:IHC,
author = "S. Okawa and S. Hirose and M. Yoneda",
title = "On the impossibility of the homomorphic
characterization of context-sensitive languages",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "2",
pages = "225--228",
month = "????",
year = "1986",
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)",
corpsource = "Hachinohe Inst. of Technol., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "characterization; context-sensitive languages",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Urbanek:1986:GNF,
author = "F. J. Urbanek",
title = "On {Greibach} normal form construction",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "2",
pages = "229--236",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Oct 26 07:53:17 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. fur Algebra Diskrete Math., Tech. Univ. Wien,
Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "chain-free context-free grammar; context-free
grammars; Ehrenfeucht-Rozenberg algorithm; epsilon
-free CFG; Greibach normal form construction;
nonterminals; Rosenkrantz GNF construction",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Narendran:1986:EPR,
author = "P. Narendran",
title = "On the equivalence problem for regular {Thue}
systems",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "2",
pages = "237--245",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "General Electric Corp. Res. and Dev. Center,
Schenectady, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "decidability; decision procedure; equivalence classes;
equivalence problem; formal languages; regular
almost-confluent Thue systems; regular preperfect
systems; regular Thue systems; undecidability",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Dunne:1986:CCS,
author = "P. E. Dunne",
title = "The complexity of central slice functions",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "3",
pages = "247--257",
month = "????",
year = "1986",
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); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Liverpool Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean functions; Boolean matrix functions; central
slice functions; combinational complexity;
computational complexity; kth threshold function;
monotone Boolean function; monotone network complexity;
NP-complete functions; superlinear lower bounds;
threshold logic",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Takahashi:1986:GFP,
author = "M. Takahashi",
title = "The greatest fixed-points and rational omega-tree
languages",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "3",
pages = "259--274",
month = "????",
year = "1986",
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 = "LITP, Paris VII Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; context-free languages; greatest
fixed-points; Rabin special automata; rational
omega-tree languages; simple normal form",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Kreowski:1986:NPC,
author = "H.-J. Kreowski and A. Wilharm",
title = "Net processes correspond to derivation processes in
graph grammars",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "3",
pages = "275--305",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Dept. of Math. and Comput. Sci., Bremen Univ., West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; complete conflict-free processes;
derivation processes; directed graphs; firing
sequences; grammars; graph grammars; nonsequential
behaviour; Petri net processes",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Dowling:1986:CSF,
author = "W. F. Dowling and J. H. Gallier",
title = "Continuation semantics for flowgraph equations",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "3",
pages = "307--331",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math. and Comput. Sci., Drexel Univ.,
Philadelphia, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "composition; continuation semantics; directed graphs;
flowgraph equations; formal languages; formal logic;
grammars; iteration; language; pairing; programming
theory; recursive functions; recursive systems;
syntax",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Poulsen:1986:ECA,
author = "E. T. Poulsen",
title = "The {Ehrenfeucht Conjecture}: an algebra-framework for
its proof",
journal = j-THEOR-COMP-SCI,
volume = "44",
number = "3",
pages = "333--339",
month = "????",
year = "1986",
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 = "C1110 (Algebra); C1160 (Combinatorial mathematics);
C4210 (Formal logic)",
corpsource = "Math. Inst., Aarhus Univ., Denmark",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "affine monoid; algebra; algebraic proof framework;
Ehrenfeucht conjecture; formal languages; group theory;
Hilbert basis theorem",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Broy:1986:TNP,
author = "M. Broy",
title = "A theory for nondeterminism, parallelism,
communication, and concurrency",
journal = j-THEOR-COMP-SCI,
volume = "45",
number = "1",
pages = "1--61",
month = "????",
year = "1986",
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)",
corpsource = "Fakultat fur Math. und Inf., Passau Univ., West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "applicative language; communicating systems;
communication; complete partial orderings; concurrency;
concurrent programs; data flow; data-driven data flow
semantics; data-driven reduction semantics; fixed
points; formal languages; functions; mathematical
semantics; multiprogramming; mutually recursive
systems; nonconventional computational models;
nondeterminism; nondeterministic equations; operational
semantics; parallelism; partial recursive functions;
recursive stream equations; reduction machines;
streams; term rewriting rules; usual expressions",
pubcountry = "Netherlands A01",
treatment = "B Bibliography; T Theoretical or Mathematical",
}
@Article{Crochemore:1986:TR,
author = "M. Crochemore",
title = "Transducers and repetitions",
journal = j-THEOR-COMP-SCI,
volume = "45",
number = "1",
pages = "63--86",
month = "????",
year = "1986",
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 = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Centre Sci. et Polytech., Univ. de Paris-Nord,
Villetaneuse, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; factor transducer; factors; optimal
bounds; programming theory; repetition searching;
string-matching problem; subsequent suffix transducers;
subwords; word",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Gonczarowski:1986:MDF,
author = "J. Gonczarowski",
title = "Manipulating derivation forests by scheduling
techniques",
journal = j-THEOR-COMP-SCI,
volume = "45",
number = "1",
pages = "87--119",
month = "????",
year = "1986",
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 = "C1180 (Optimisation techniques); C4240 (Programming
and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Hebrew Univ. of Jerusalem,
Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arbitrary grammars; context-free rewriting; derivation
forests; dynamic programming; k-derivations; k-parallel
rewriting; membership problems; polynomial dynamic
programming membership algorithm; programming theory;
pumping; rewriting mechanism; scheduling; scheduling
techniques; scheduling theory",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Dezani-Ciancaglini:1986:CFC,
author = "M. Dezani-Ciancaglini and I. Margaria",
title = "A characterization of {F}-complete type assignments",
journal = j-THEOR-COMP-SCI,
volume = "45",
number = "2",
pages = "121--157",
month = "????",
year = "1986",
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)",
corpsource = "Centro Linceo Interdisciplinare di Sci. Matematiche e
Loro Appl., Roma, Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "calculus; canonical representatives of functions;
characterization of F-complete type assignments;
F-completeness; F-semantics; F-soundness; formal logic;
intersection type discipline; untyped lambda calculus",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Girard:1986:SFV,
author = "J.-Y. Girard",
title = "The system {F} of variable types, fifteen years
later",
journal = j-THEOR-COMP-SCI,
volume = "45",
number = "2",
pages = "159--192",
month = "????",
year = "1986",
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)",
corpsource = "Equipe de Logique Mathe., CNRS, Paris, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "category theory; circularity of variable types;
concept totality; direct limit; formal logic;
lambda-calculus; qualitative domains; semantics; system
F of variable types; universal model",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Meyer:1986:MRP,
author = "J.-J. Ch. Meyer",
title = "Merging regular processes by means of fixed-point
theory",
journal = j-THEOR-COMP-SCI,
volume = "45",
number = "2",
pages = "193--260",
month = "????",
year = "1986",
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); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Mathe. and Comput. Sci., Free Univ.,
Amsterdam, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alpha -recursion; arbitrary interleaving; arbitrary
merging; fair merging; fixed-point theory; iteration
using while statements; iterative methods; Kleene-star
iteration; merging; mu -recursion; programming theory;
recursive functions; regular recursion; regular
sequential nondeterministic processes; regular-process
merging; trace-set process semantics",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Huber:1986:RTH,
author = "P. Huber and A. M. Jensen and L. O. Jepsen and K.
Jensen",
title = "Reachability trees for high-level {Petri} nets",
journal = j-THEOR-COMP-SCI,
volume = "45",
number = "3",
pages = "261--292",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Oct 26 07:54:21 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Comput. Sci., Aarhus Univ., Denmark",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "directed graphs; high-level Petri nets;
place/transition nets; reachability trees; trees
(mathematics)",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Ait-Kaci:1986:ASA,
author = "H. Ait-Kaci",
title = "An algebraic semantics approach to the effective
resolution of type equations",
journal = j-THEOR-COMP-SCI,
volume = "45",
number = "3",
pages = "293--351",
month = "????",
year = "1986",
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 = "C6120 (File organisation)",
corpsource = "Microelectron. and Comput. Technol. Corp., Austin, TX,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "artificial intelligence; Brouwerian lattice; data
structures; iterated rewriting; knowledge base
language; least fixed-point semantics;
partially-ordered data type structures; record-like
terms; syntactic calculus; term rewriting; type
subsumption ordering; type symbols",
pubcountry = "Netherlands A02",
treatment = "P Practical",
}
@Article{Bernot:1986:ADT,
author = "G. Bernot and M. Bidoit and C. Choppy",
title = "Abstract data types with exception handling: an
initial approach based on a distinction between
exceptions and errors",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "1",
pages = "13--45",
month = "????",
year = "1986",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract data types; algebraic specifications; error
handling; error propagation rule; exception handling;
exception labelling; exception recovery policy;
functional semantics; programming theory",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Guo:1986:DDL,
author = "Y. Q. Guo and G. W. Xu and G. Thierrin",
title = "Disjunctive decomposition of languages",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "1",
pages = "47--51",
month = "????",
year = "1986",
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)",
corpsource = "Dept. of Math., Lanzhou Univ., China",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "dense languages; disjoint union; disjunctive
decomposition; disjunctive languages; formal
languages",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Hashiguchi:1986:NFG,
author = "K. Hashiguchi",
title = "Notes on finitely generated semigroups and pumping
conditions for regular languages",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "1",
pages = "53--66",
month = "????",
year = "1986",
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)",
corpsource = "Dept. of Inf. and Comput. Sci., Toyohashi Univ. of
Technol., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finitely generated semigroups; formal languages;
Luca-Restivo condition; pumping conditions; regular
languages",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Lerat:1986:NN,
author = "N. Lerat and W. {Lipski, Jr.}",
title = "Nonapplicable nulls",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "1",
pages = "67--82",
month = "????",
year = "1986",
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 = "C4250 (Database theory)",
corpsource = "Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "database theory; Generalized Relational Algebra;
Generalized Relational Calculus; nonapplicable null;
null-free instances; query language",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Head:1986:PDL,
author = "T. Head and B. Lando",
title = "Periodic {D0L} languages",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "1",
pages = "83--89",
month = "????",
year = "1986",
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)",
corpsource = "Dept. of Math. Sci., Alaska Univ., Fairbanks, AK,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; decidability; decidable
property; n-codes; periodic D0L languages; periodicity;
stationary omega-words; ultimate periodicity",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Yamasaki:1986:COR,
author = "H. Yamasaki and M. Takahashi and K. Kobayashi",
title = "Characterization of omega-regular languages by monadic
second-order formulas",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "1",
pages = "91--99",
month = "????",
year = "1986",
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)",
corpsource = "Dept. of Math., Hitotsubashi Univ., Tokyo, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "characterisation; formal languages; monadic
second-order formulas; omega-regular languages; product
topology",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Latteux:1986:TCR,
author = "M. Latteux and E. Timmerman",
title = "Two characterizations of rational adherences",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "1",
pages = "101--106",
month = "????",
year = "1986",
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)",
corpsource = "Lille I Univ., Villeneuve d'Ascq, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alphabetic morphisms; characterizations; finite sets;
formal languages; inverse uniform morphisms; rational
adherences; rational omega-languages",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Howell:1986:SCB,
author = "R. R. Howell and L. E. Rosier and Dung T. Huynh and
Hsu-Chun Yen",
title = "Some complexity bounds for problems concerning finite
and $2$- dimensional vector addition systems with
states",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "2--3",
pages = "107--140",
month = "????",
year = "1986",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "2- dimensional vector addition systems; complexity
bounds; computational complexity; containment;
equivalence problems; finite vector addition systems;
reachability; semilinear reachability sets; states;
upper bounds",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Jaffar:1986:SIT,
author = "J. Jaffar and P. J. Stuckey",
title = "Semantics of infinite tree logic programming",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "2--3",
pages = "141--158",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C6110 (Systems
analysis and programming)",
corpsource = "Dept. of Comput. Sci., Monash Univ., Clayton, Vic.,
Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "closure property; declarative semantics; infinite tree
logic programming; logic programming;
negation-as-failure; operational semantics; trees
(mathematics)",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Duboc:1986:SEF,
author = "C. Duboc",
title = "On some equations in free partially commutative
monoids",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "2--3",
pages = "159--174",
month = "????",
year = "1986",
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 = "C4200 (Computer theory)",
corpsource = "Lab. d'Inf., Rouen Univ., Mont-Saint-Aignan, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computation theory; conjugacy relation; connected
solutions; cyclic; free partially commutative monoids;
transitive closure; transposition relation",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Brazma:1986:GRE,
author = "A. Brazma and E. Kinber",
title = "Generalized regular expressions --- a language for
synthesis of programs with branching in loops",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "2--3",
pages = "175--195",
month = "????",
year = "1986",
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);
C6150G (Diagnostic, testing, debugging and evaluating
systems)",
corpsource = "Comput. Centre, Latvian State Univ., Riga, Latvian
SSR, USSR",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata; automata theory; branching; equivalence
problem; finite alphabet; formal languages; generalised
regular expressions; inductive synthesis; loops;
natural numbers; program testing; programs synthesis
language; set-theoretic properties",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Longo:1986:CHT,
author = "G. Longo and S. Martini",
title = "Computability in higher types, {P} omega and the
completeness of type assignment",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "2--3",
pages = "197--217",
month = "????",
year = "1986",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dipartimento di Inf., Pisa Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "applicative structure; completeness; computability;
computational complexity; independent
recursion-theoretical motivation; reverse implication;
type assignment; type checking",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Dieu:1986:APT,
author = "Phan Dinh Dieu and Le Cong Thanh and Le Tuan Hoa",
title = "Average polynomial time complexity of some
{NP-complete} problems",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "2--3",
pages = "219--237",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Inst. of Comput. Sci., Hanoi, Viet Nam",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "average polynomial time complexity; computational
complexity; deterministic algorithm; graph theory;
nonuniform distributions; NP-complete problems; set of
graphs",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Hajek:1986:SDL,
author = "P. Hajek",
title = "A simple dynamic logic",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "2--3",
pages = "239--259",
month = "????",
year = "1986",
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 = "C4240 (Programming and algorithm theory); C6110
(Systems analysis and programming)",
corpsource = "Math. Inst., Czechoslovak Acad. of Sci., Prague,
Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "dynamic logic; logic programming; nonstandard
modelling; one-sorted; predicate logic; programming
theory; recursive axiomatization; three-sorted system",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Huang:1986:APT,
author = "Chua-Huang Huang and C. Lengauer",
title = "The automated proof of a trace transformation for a
bitonic sort",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "2--3",
pages = "261--284",
month = "????",
year = "1986",
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 = "C4240 (Programming and algorithm theory); C6130
(Data handling techniques)",
corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automated proof; bitonic sort; concurrency;
logarithmic time; parallel trace; programming theory;
sequential trace; sorting; stepwise refinement; trace
transformation",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Dicky:1986:AAM,
author = "A. Dicky",
title = "An algebraic and algorithmic method for analysing
transition systems",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "2--3",
pages = "285--303",
month = "????",
year = "1986",
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)",
corpsource = "Bordeaux I Univ., Talence, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic method; algorithmic method; analysing
transition systems; concurrent processes; effectively
computable functions; formal algebra; formal logic;
power algebras; temporal logics",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Hardin:1986:PTR,
author = "T. Hardin and A. Laville",
title = "Proof of termination of the rewriting system {SUBST}
on {CCL}",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "2--3",
pages = "305--312",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. Inf., Reims Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "combinatorial mathematics; equivalence theorem;
programming theory; rewriting; termination",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Diekert:1986:SVE,
author = "V. Diekert",
title = "On some variants of the {Ehrenfeucht Conjecture}",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "2--3",
pages = "313--318",
month = "????",
year = "1986",
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)",
corpsource = "Inst. fur Inf., Tech. Univ. Munchen, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic properties; Chomsky classes; Ehrenfeucht
Conjecture; formal language; formal languages;
variants",
pubcountry = "Netherlands A11",
treatment = "T Theoretical or Mathematical",
}
@Article{Diekert:1986:CMC,
author = "V. Diekert",
title = "Commutative monoids have complete presentations by
free (non-commutative) monoids",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "2--3",
pages = "319--327",
month = "????",
year = "1986",
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 = "C4200 (Computer theory)",
corpsource = "Inst. fur Inf., Tech. Univ. Munchen, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "commutative monoids; computation theory; finite
Noetherian confluent semi-Thue system; finitely
generated; free monoids; noncommutative monoids",
pubcountry = "Netherlands A12",
treatment = "T Theoretical or Mathematical",
}
@Article{Griesser:1986:LBA,
author = "B. Griesser",
title = "Lower bounds for the approximative complexity",
journal = j-THEOR-COMP-SCI,
volume = "46",
number = "2--3",
pages = "329--338",
month = "????",
year = "1986",
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 = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory)",
corpsource = "Inst. fur Angewandte Math., Zurich Univ.,
Switzerland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic geometric degree; approximative complexity;
approximative mode; computational complexity; lower
bounds; polynomials; substitution; transcendence
degree",
pubcountry = "Netherlands A13",
treatment = "T Theoretical or Mathematical",
}
@Article{Esik:1986:CCA,
author = "Z. Esik and P. Domosi",
title = "Complete classes of automata for the
$\alpha_0$-product",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "1",
pages = "1--14",
month = "????",
year = "1986",
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 = "C4220 (Automata theory)",
corpsource = "Bolyai Inst., A. Jozsef Univ., Szeged, Hungary",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alpha /sub 0/-product; cascade composition; finite
automata; homomorphic completeness; Krohn-Rhodes
decomposition theorem; loop-free product;
quasisuperposition; R-product; series-parallel
composition",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Culik:1986:RTP,
author = "K. {Culik, II} and Sheng Yu",
title = "Real-time, pseudo real-time, and linear-time {ITA}",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "1",
pages = "15--26",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "A k-ary iterative tree automation; finite automata;
formal languages; infinite synchronous network;
linear-time computational power; parallel
architectures; pseudo real-time computational power;
real-time infinite memory; real-time systems; trees
(mathematics)",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Narendran:1986:PCE,
author = "P. Narendran and F. Otto",
title = "The problems of cyclic equality and conjugacy for
finite complete rewriting systems",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "1",
pages = "27--38",
month = "????",
year = "1986",
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)",
corpsource = "Res. and Dev. Center, General Electric Co.,
Schenectady, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cyclic equality; decidability; finite length-reducing
complete rewriting systems; formal languages; grammars;
left-conjugacy problem",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Johnson:1986:RER,
author = "J. H. Johnson",
title = "Rational equivalence relations",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "1",
pages = "39--60",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "class membership decision problems; computational
complexity; containment hierarchy; decidability;
deterministic rational equivalence relations;
equivalence classes; finite automata; finite
equivalence relations; finite transductions; formal
languages; Hasse diagrams; length-bounded rational
equivalence relations; rational function equivalence
kernels, canonical function computation complexity;
recognizable equivalence relations; reflexivity;
relative containments; space complexity; subsequential
function equivalence kernels; symmetry; time
complexity; transitivity",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Pelc:1986:LPS,
author = "A. Pelc",
title = "Lie patterns in search procedures",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "1",
pages = "61--69",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. d'Inf., Quebec Univ., Hull, Que., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean combinations; Boolean functions; error
detection; lie patterns; queries; search procedures;
set identification; set theory",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Culik:1986:EFV,
author = "K. {Culik, II} and J. Karhumaki",
title = "The equivalence of finite valued transducers (on
{HDT0L} languages) is decidable",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "1",
pages = "71--84",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; decidability; equivalence
classes; equivalence of finite valued transducers;
finite automata; finite test set; generalised
Ehrenfeucht Conjecture; Gurani-Ibarra problem; HDT0L
languages; multivalued transducers; normalized k-valued
finite transducers",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Valiant:1986:NED,
author = "L. G. Valiant and V. V. Vazirani",
title = "{NP} is as easy as detecting unique solutions",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "1",
pages = "85--93",
month = "????",
year = "1986",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Aiken Comput. Lab., Harvard Univ., Cambridge, MA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; cryptography; D/sup p/-hard
problems; NP-complete problem; NP-hard problems;
parity; randomized polynomial time reducibility; SAT;
unique solutions",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Pecuchet:1986:CBA,
author = "J.-P. Pecuchet",
title = "On the complementation of {Buchi Automata}",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "1",
pages = "95--98",
month = "????",
year = "1986",
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. de Rouen, Mont-Saint-Aignan, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Buchi automaton; complementation; context-free
languages; finite automata",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Heintz:1986:PSG,
author = "J. Heintz",
title = "On polynomials with symmetric {Galois} group which are
easy to compute",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "1",
pages = "99--105",
month = "????",
year = "1986",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Fachbereich Math., J. W. Goethe-Univ., Frankfurt am
Main, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity class; computational complexity; easily
computed polynomials; hard-to-compute polynomials;
Hilbertian field; polynomials; sequence of univariate
polynomials; symmetric Galois group",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Wyrostek:1986:SUC,
author = "P. Wyrostek",
title = "On the size of unambiguous context-free grammars",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "1",
pages = "107--110",
month = "????",
year = "1986",
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)",
corpsource = "Regional Comput. Centre, Krakow, Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free grammars; size of unambiguous
context-free grammars",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Dymond:1986:NPC,
author = "P. W. Dymond",
title = "On nondeterminism in parallel computation",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "2",
pages = "111--120",
month = "????",
year = "1986",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., California
Univ., San Diego, La Jolla, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; hardware modification
machine model; nondeterministic parallel complexity
classes; parallel algorithms; simultaneous
hardware/time bounds",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Orponen:1986:CCC,
author = "P. Orponen",
title = "A classification of complexity core lattices",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "2",
pages = "121--130",
month = "????",
year = "1986",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Helsinki Univ., Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity core lattices; computational complexity;
polynomial complexity core; recursive set",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Wagner:1986:SOC,
author = "K. W. Wagner",
title = "Some observations on the connection between counting
and recursion",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "2",
pages = "131--147",
month = "????",
year = "1986",
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); C4240
(Programming and algorithm theory)",
corpsource = "Inst. fur Math., Augsburg Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "accepting computations; class P; class PSPACE;
computational complexity; counting functions;
nondeterministic polynomial-time Turing machines; PHCF;
polynomial-time computable functions; polynomial-time
hierarchy; recursion theory; recursive functions;
Turing machines",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Chrobak:1986:FAU,
author = "M. Chrobak",
title = "Finite automata and unary languages",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "2",
pages = "149--158",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 05 09:19:14 2003",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
note = "See errata \cite{Chrobak:2003:EFA}.",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
(Programming and algorithm theory)",
corpsource = "Inst. of Inf., Warsaw Univ., Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "1DFA; 2DFA; alternating automata; computational
complexity; deterministic automata; finite automata;
formal languages; lower bound; n-state 1NFA;
nondeterministic automata; one-way automata; state
complexity; tight bounds; two-way automata; unary
languages; upper bound",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Dare:1986:ST,
author = "V. R. Dare and R. Siromoney",
title = "Subword topology",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "2",
pages = "159--168",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Math., Madras Christian Coll., India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "closed sets; closure; compactness; formal languages;
language adherence, Ehrenfeucht conjecture; limiting
processes; set theory; subword topology; topology;
unavoidable sets",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Homer:1986:SCS,
author = "S. Homer",
title = "On simple and creative sets in {NP}",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "2",
pages = "169--180",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Boston Univ., MA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; creative sets; NP- complete
sets; set theory; simple sets",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Spehner:1986:RCS,
author = "J.-C. Spehner",
title = "The rapid calculation of shuffles of two words",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "2",
pages = "191--203",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Inst. des Sci. Exactes et Appliqu{\'e}es, Univ. de
Haute Alsace, Mulhouse, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal languages; free monoid; group theory; shuffles;
words",
language = "French",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Kirousis:1986:SP,
author = "L. M. Kirousis and C. H. Papadimitriou",
title = "Searching and pebbling",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "2",
pages = "205--218",
month = "????",
year = "1986",
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 = "C1140E (Game theory); C1160 (Combinatorial
mathematics); C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Comput. Sci., Nat. Tech. Univ., Athens,
Greece",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computation theory; directed acyclic graphs; game
theory; graph theory; node-searching; progressive
pebble demands; search number; undirected graph",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Parchmann:1986:SEI,
author = "R. Parchmann and J. Duske",
title = "Self-embedding indexed grammars",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "2",
pages = "219--223",
month = "????",
year = "1986",
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)",
corpsource = "Inst. for Inf., Hannover Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free grammars; context-free languages;
nonselfembedding right-linear indexed languages;
right-linear indexed grammars; self-embedding indexed
grammars",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Otto:1986:USE,
author = "F. Otto",
title = "The undecidability of self-embedding for finite
{semi-Thue} and {Thue} systems",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "2",
pages = "225--232",
month = "????",
year = "1986",
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)",
corpsource = "Fachbereich Inf., Kaiserslautern Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free grammars; context-free languages;
decidability; finite semi-Thue systems; finite Thue
systems; self-embedding; undecidability",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Karchmer:1986:TTS,
author = "M. Karchmer",
title = "Two time-space tradeoffs for element distinctness",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "3",
pages = "237--246",
month = "????",
year = "1986",
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 = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Hebrew Univ., Jerusalem,
Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean function; Boolean functions; branching
program; computational complexity; element
distinctness; k-headed Turing machine; linear queries;
low-level computational complexity; minimum operations;
time-space tradeoffs; Turing machines",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Maon:1986:BMV,
author = "Y. Maon and A. Yehudai",
title = "Balance of many-valued transductions and equivalence
problems",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "3",
pages = "247--262",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Tel-Aviv Univ., Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; balance; context-free languages;
decidability; decidability of equivalence; equivalence
classes; equivalence problems; inverses; many-valued
transductions; morphisms on a given language;
single-valued rational transductions on regular
languages",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Ko:1986:OWF,
author = "Ker-I Ko and T. J. Long and D.-Z. Du",
title = "On one-way functions and polynomial-time
isomorphisms",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "3",
pages = "263--276",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability; computational complexity; equivalence
classes; exponential-time computable sets;
length-increasing polynomial-time reductions; one-one
polynomial-time reductions; one-way functions;
polynomial-time isomorphisms; polynomial-time
truth-table completeness; set equivalence; set theory",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Maon:1986:PED,
author = "Y. Maon and B. Schieber and U. Vishkin",
title = "Parallel ear decomposition search ({EDS}) and
st-numbering in graphs",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "3",
pages = "277--298",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. Comput. Sci., Tel Aviv Univ., Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "biconnected graph; computational complexity;
concurrent-read concurrent-write PRAM; depth-first
search; efficient search method; Even-Tarjan linear
time-serial algorithm; graph planarity testing; graph
theory; NC; parallel algorithm; parallel algorithms;
parallel ear decomposition search; parallel undirected
graphs; s t-numbering",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Ko:1986:CFR,
author = "Ker-I Ko",
title = "On the continued fraction representation of computable
real numbers",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "3",
pages = "299--313",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Math. Sci. Res. Inst., Berkeley, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Cauchy sequences; computability; computable real
numbers; continued fraction form; continued fraction
representation; left cut representation; left cuts;
left-continuous functions; number theory; polynomial
equivalence; principal convergents; real number
addition; recursive analysis; recursive functions;
right-continuous functions",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Rytter:1986:CPP,
author = "W. Rytter",
title = "On the complexity of parallel parsing of general
context-free languages",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "3",
pages = "315--321",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Warwick Univ., Coventry, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; context-free grammars;
context-free language recognition; context-free
languages; graph theory; parallel algorithms; parallel
parsing complexity; parallel random-access machine;
parallel time log n computation; parsing the
representation; time complexity; transitive closure of
directed graphs",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Hong:1986:LBC,
author = "J. W. Hong and Q. Zuo",
title = "Lower bounds on communication overlap of networks",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "3",
pages = "323--328",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4230 (Switching
theory); C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Chicago Univ., IL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "communication overlap; complexity; computational
complexity; graph theory; graph-theoretical invariant;
interconnection network; multiprocessor interconnection
networks; tight lower bounds",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Szalas:1986:CSC,
author = "Z. Szalas",
title = "Concerning the semantic consequence relation in
first-order temporal logic",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "3",
pages = "329--334",
month = "????",
year = "1986",
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)",
corpsource = "Inst. of Inf., Warsaw Univ., Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "axiomatization; discrete time; first-order temporal
logic; formal languages; formal logic; linear time;
nonarithmetical tautologies; semantic consequence
relation",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Deleage:1986:RID,
author = "J.-L. Deleage and L. Pierre",
title = "The rational index of the {Dyck} language {$D_1'*$}",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "3",
pages = "335--343",
month = "????",
year = "1986",
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); C4240
(Programming and algorithm theory)",
corpsource = "Dijon Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "asymptotic behaviour; computational complexity; finite
automata; finite nondeterministic automaton; formal
languages; language complexity measure; rational index;
restricted Dyck language; well-parenthesized words",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Esik:1986:PP,
author = "Z. Esik and F. Gecseg",
title = "On $\alpha_0$-products and $\alpha_2$-products",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "1",
pages = "1--8",
month = "????",
year = "1986",
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 = "C4220 (Automata theory)",
corpsource = "Bolyai Inst., A. Jozsef Univ., Szeged, Hungary",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; Gluskov-type product; Krohn-Rhodes
decomposition theorem; necessary and sufficient
condition",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Ko:1986:NIP,
author = "K.-I. Ko",
title = "On the notion of infinite pseudorandom sequences",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "1",
pages = "9--33",
month = "????",
year = "1986",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; infinite pseudorandom
sequences; Martin-L{\"o}f's notion; monotonic operator
complexity; polynomial time; sequential tests; space
complexity",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Spehner:1986:OFG,
author = "J.-C. Spehner",
title = "The occurrence of the factors of a given word in a
text",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "1",
pages = "35--52",
month = "????",
year = "1986",
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 = "C4220 (Automata theory)",
corpsource = "Dept. de Math. et Inf., Univ. de Haute Alsace,
Mulhouse, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; time linear",
language = "French",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Bublitz:1986:PCM,
author = "S. Bublitz and U. Schurfeld and I. Wegener and B.
Voigt",
title = "Properties of complexity measures for {PRAMs} and
{WRAMs}",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "1",
pages = "53--73",
month = "????",
year = "1986",
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); C4240 (Programming and
algorithm theory); C5320G (Semiconductor storage)",
corpsource = "Fachbereich Inf., J. W. Goethe-Univ., Frankfurt am
Main, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "asymptotic behaviour; Boolean functions; branching
program depth; complexity measures; computational
complexity; monotone functions; parallel computers;
PRAMs; random-access storage; shared memory; symmetric
functions; WRAMs",
pubcountry = "Netherlands A04",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Kruskal:1986:UTI,
author = "C. P. Kruskal and M. Snir",
title = "A unified theory of interconnection network
structure",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "1",
pages = "75--94",
month = "????",
year = "1986",
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 = "B6150 (Communication system theory); C5620 (Computer
networks and techniques)",
corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park,
MD, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "baseline networks; bidelta network; computer networks;
data manipulators; delta networks; delta property; flip
networks; functional properties; graph theoretical
characterisations; interconnection network structure;
labelling schemes; omega networks; packet switching;
routing scheme; unified theory",
pubcountry = "Netherlands A05",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Statman:1986:ECP,
author = "R. Statman",
title = "Every countable poset is embeddable in the poset of
unsolvable terms",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "1",
pages = "95--100",
month = "????",
year = "1986",
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 = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Math., Carnegie-Mellon Univ., Pittsburgh, PA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Bohm trees; combinatorial mathematics; combinators;
computational behaviour; countable poset; lambda
calculus; model theory; trees (mathematics)",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Head:1986:RSI,
author = "T. Head and B. Lando",
title = "Regularity of sets of initial strings of periodic
{D0L}-systems",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "1",
pages = "101--108",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Oct 24 12:43:56 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math. Sci., Alaska Univ., Fairbanks, AK,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; initial strings sets
regularity; periodic D0L-systems; regular language",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Hromkovic:1986:CCH,
author = "J. Hromkovic",
title = "Communication complexity hierarchy",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "1",
pages = "109--115",
month = "????",
year = "1986",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Theor. Cybern., Komensky Univ., Bratislava,
Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "communication complexity hierarchy; computational
complexity; deterministic models; nondeterministic
models",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Berry:1986:RED,
author = "G. Berry and R. Sethi",
title = "From regular expressions to deterministic automata",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "1",
pages = "117--126",
month = "????",
year = "1986",
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 = "C4220 (Automata theory)",
corpsource = "Ecole Nat. Sup{\'e}rieure des Mines de Paris, Centre
de Math. Appliqu{\'e}es, Valbonne, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic automata; elegant algorithm; finite
automata; finite automaton; regular expressions; state
transitions",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Weispfenning:1986:CWP,
author = "V. Weispfenning",
title = "The complexity of the word problem for {Abelian}
$l$-groups",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "1",
pages = "127--132",
month = "????",
year = "1986",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Math. Inst., Heidelberg Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abelian l-groups; co-NP-complete; computational
complexity; universal theory; word problem complexity",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Tchuente:1986:SSP,
author = "M. Tchuente",
title = "Sequential simulation of parallel iterations and
applications",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "2--3",
pages = "135--144",
month = "????",
year = "1986",
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 = "C4220 (Automata theory); C4230 (Switching theory)",
corpsource = "Dept. de Math., Fac. des Sci., Yaounde, Cameroon",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "dynamic behaviour; finite automata; finite automata
networks; local transition functions; parallel
evolution; parallel iterations; sequential simulation;
simulation",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Marek:1986:ASE,
author = "W. Marek and H. Rasiowa",
title = "Approximating sets with equivalence relations",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "2--3",
pages = "145--152",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C1250 (Pattern
recognition); C4210 (Formal logic); C4250 (Database
theory)",
corpsource = "Dept. of Comput. Sci., Kentucky Univ., Lexington, KY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "approximation theory; closure operations; computer
science; database theory; databases; equivalence
classes; equivalence relations; image processing;
picture processing; set approximation spaces; set
theory",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Chrobak:1986:HOW,
author = "M. Chrobak",
title = "Hierarchies of one-way multihead automata languages",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "2--3",
pages = "153--181",
month = "????",
year = "1986",
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 = "Inst. of Inf., Warsaw Univ., Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; formal languages; one-way multihead
automata language hierarchies; one-way multihead DPDAs;
one-way multihead nondeterministic pushdown automata",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Duboc:1986:MPA,
author = "C. Duboc",
title = "Mixed product and asynchronous automata",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "2--3",
pages = "183--199",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Lab d'Inf., Univ. des Sci. de Rouen, Mont Saint
Aignan, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "asynchronous automata; automata theory; formal
languages; free partially commutative monoids; group
theory; homomorphic image; Mezei theorem; mixed
product; recognizable trace language; strictly
alphabetical morphism; synchronous products; trace
languages; Zielonka theorem",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrenfeucht:1986:AFU,
author = "A. Ehrenfeucht and H. J. Hoogeboom and G. Rozenberg",
title = "On the active and full use of memory in right-boundary
grammars and push-down automata",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "2--3",
pages = "201--228",
month = "????",
year = "1986",
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 = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; context free grammars; context-free
grammars; formal languages; memory; n-active language;
n-active records; n-full record language; push-down
automata; representation theorem; right-boundary
grammars; string rewriting",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Fitting:1986:PML,
author = "M. Fitting",
title = "Partial models and logic programming",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "2--3",
pages = "229--255",
month = "????",
year = "1986",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math. and Comput. Sci., Herbert H. Lehmann
Coll., New York, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "conservative semantics; continuous operators; domain
closure assumption; Gentzen sequents; logic
programming; negation; partial models; programming
theory; PROLOG; PROLOG fixpoint semantics; proof
procedure; quantification; SAT semantics; semantics
tableaux; strong semantics; weak semantics",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Danko:1986:FOA,
author = "W. Danko",
title = "First-order approximation of algorithmic theories",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "2--3",
pages = "257--272",
month = "????",
year = "1986",
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); C4240 (Programming and
algorithm theory)",
corpsource = "Inst. of Math., Warsaw Univ., Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithmic theories; completeness; decidability;
first-order approximation; first-order language; formal
languages; language translation; many-sorted
algorithmic logic; many-valued logics; natural numbers;
nonstandard computations; object coding computations;
programming theory",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Italiano:1986:AEP,
author = "G. F. Italiano",
title = "Amortized efficiency of a path retrieval data
structure",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "2--3",
pages = "273--281",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dipartimento di Inf. e Sistemistica, Roma Univ.,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "ADD operation; amortised efficiency; computational
complexity; data structures; digraph; directed graphs;
path retrieval data structure; SEARCHPATH operation;
space complexity; time complexity",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Salomaa:1986:PKC,
author = "A. Salomaa and S. Yu",
title = "On a public-key cryptosystem based on iterated
morphisms and substitutions",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "2--3",
pages = "283--296",
month = "????",
year = "1986",
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 = "B6120B (Codes); C1260 (Information theory); C4210
(Formal logic); C4290 (Other computer theory)",
corpsource = "Dept. of Math., Turku Univ., Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "backward determinism; context-free languages;
cryptoanalysis; cryptography; DT0L system; growth;
iterated morphisms; L systems; mathematics; plaintext
blocksize; preprocessing; Salomaa-Welzl public-key
cryptosystem; substitutions",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Ginsburg:1986:POH,
author = "S. Ginsburg and C. Tang",
title = "Projection of object histories",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "2--3",
pages = "297--328",
month = "????",
year = "1986",
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 = "C4250 (Database theory)",
corpsource = "Dept. of Comput. Sci., Univ. of Southern California,
Los Angeles, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computation-tuple sequence scheme; database theory;
necessary and sufficient condition; object histories;
projections; record-based data model; sufficiency
condition",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Gibbons:1986:DSP,
author = "A. Gibbons and W. Rytter",
title = "On the decidability of some problems about rational
subsets of free partially commutative monoids",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "2--3",
pages = "329--337",
month = "????",
year = "1986",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Warwick Univ., Coventry, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; cardinality; decidability;
equivalence classes; formal languages; free partially
commutative monoids; group theory; nondeterministic
sequential machines; rational subsets; reversal-bounded
nondeterministic multicounter machines; set theory",
pubcountry = "Netherlands A11",
treatment = "T Theoretical or Mathematical",
}
@Article{Takahashi:1987:BHO,
author = "M. Takahashi",
title = "Brzozowski hierarchy of omega-languages",
journal = j-THEOR-COMP-SCI,
volume = "49",
number = "1",
pages = "1--12",
month = "????",
year = "1987",
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)",
corpsource = "Dept. of Inf. Sci., Tokyo Inst. of Technol., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean closure; Brzozowski hierarchy; Buchi second
order formulas; factorization theorem; formal
languages; language-theoretic properties; omega
-languages",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Squier:1987:USC,
author = "C. C. Squier",
title = "Units of special {Church--Rosser} monoids",
journal = j-THEOR-COMP-SCI,
volume = "49",
number = "1",
pages = "13--22",
month = "????",
year = "1987",
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)",
corpsource = "Dept. of Math. Sci., State Univ. of New York,
Binghamton, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Church--Rosser monoids; formal languages;
left-invertible elements; right-invertible elements",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Parchmann:1987:GDM,
author = "R. Parchmann and J. Duske",
title = "Grammars, derivation modes and properties of indexed
and type-0 languages",
journal = j-THEOR-COMP-SCI,
volume = "49",
number = "1",
pages = "23--42",
month = "????",
year = "1987",
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)",
corpsource = "Inst. fur Inf. Hannover Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free grammar; context-free grammars;
context-free languages; context-free productions;
derivation modes; Dyck languages; grammars; homomorphic
characterizations; indexed languages; normal-form
transformations; type-0 languages",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Oyamaguchi:1987:CRP,
author = "M. Oyamaguchi",
title = "The {Church--Rosser} property for ground
term-rewriting systems is decidable",
journal = j-THEOR-COMP-SCI,
volume = "49",
number = "1",
pages = "43--79",
month = "????",
year = "1987",
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)",
corpsource = "Fac. of Eng., Mie Univ., Tsu, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Church--Rosser property; decidability; formal
languages; ground term-rewriting systems",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Guibas:1987:SRT,
author = "L. J. Guibas and J. Stolfi and K. L. Clarkson",
title = "Solving related two- and three-dimensional linear
programming problems in logarithmic time",
journal = j-THEOR-COMP-SCI,
volume = "49",
number = "1",
pages = "81--84",
month = "????",
year = "1987",
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 = "B0260 (Optimisation techniques); C1180 (Optimisation
techniques)",
corpsource = "Xerox PARC, Palo Alto, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "circle arcs; linear inequalities; linear programming;
logarithmic time; three-dimensional linear programming;
two-dimensional linear programming",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Anonymous:1987:TIC,
author = "Anonymous",
title = "{Twelfth International Colloquium on Automata,
Languages and Programming}",
journal = j-THEOR-COMP-SCI,
volume = "49",
number = "2--3",
pages = "??--??",
month = "????",
year = "1987",
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); C4240
(Programming and algorithm theory)",
conflocation = "Nafplion, Greece; 15-19 July 1985",
conftitle = "Twelfth International Colloquium on Automata,
Languages and Programming",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "asynchronous communicating processes; automata theory;
Buchi automata; communicating systems; computational
complexity; context dependent equivalence; context free
languages; distributed systems; finite observations;
formal languages; infinite streams; modal logics;
partitioning point sets; programming theory; repeated
snapshots; semantics; set intersection; synchronous
broadcasting networks; temporal logic; uniform
concurrency",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{deBakker:1987:ISF,
author = "J. W. {de Bakker} and J.-J. C. Meyer and E.-R.
Olderog",
title = "Infinite streams and finite observations in the
semantics of uniform concurrency",
journal = j-THEOR-COMP-SCI,
volume = "49",
number = "2--3",
pages = "87--112",
month = "",
year = "1987",
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)",
conflocation = "Nafplion, Greece; 15-19 July 1985",
conftitle = "Twelfth International Colloquium on Automata,
Languages and Programming",
corpsource = "Centre for Math. and Comp. Sci., Free Univ.,
Amsterdam, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite observations; formal languages; infinite
streams; language; nondeterministic choice; parallel
composition; semantics; sequential composition; uniform
concurrency",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Main:1987:AIS,
author = "M. G. Main and W. Bucher and D. Haussler",
title = "Applications of an infinite square-free {co-CFL}",
journal = j-THEOR-COMP-SCI,
volume = "49",
number = "2--3",
pages = "113--119",
month = "",
year = "1987",
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)",
conflocation = "Nafplion, Greece; 15-19 July 1985",
conftitle = "Twelfth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Comp. Sci., Colorado Univ., Boulder, CO,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; infinite square-free
sequence",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Hennessy:1987:ATF,
author = "M. Hennessy",
title = "An algebraic theory of fair asynchronous communicating
processes",
journal = j-THEOR-COMP-SCI,
volume = "49",
number = "2--3",
pages = "121--143",
month = "",
year = "1987",
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)",
conflocation = "Nafplion, Greece; 15-19 July 1985",
conftitle = "Twelfth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Comput. Sci., Sussex Univ., Brighton, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstracting; algebraic theory; binary composition
operator; denotational semantics; fair asynchronous
communicating processes; finite-branching trees; formal
languages",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Bouge:1987:RSD,
author = "L. Bouge",
title = "Repeated snapshots in distributed systems with
synchronous communications and their implementation in
{CSP}",
journal = j-THEOR-COMP-SCI,
volume = "49",
number = "2--3",
pages = "145--169",
month = "",
year = "1987",
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 = "C4220 (Automata theory)",
conflocation = "Nafplion, Greece; 15-19 July 1985",
conftitle = "Twelfth International Colloquium on Automata,
Languages and Programming",
corpsource = "Paris Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "CSP; distributed processing; distributed systems;
partially ordered semantics; repeated snapshots;
sequential machines; synchronous communications",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Galil:1987:DAS,
author = "Z. Galil and G. M. Landau and M. M. Yung",
title = "Distributed algorithms in synchronous broadcasting
networks",
journal = j-THEOR-COMP-SCI,
volume = "49",
number = "2--3",
pages = "171--184",
month = "",
year = "1987",
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 = "B6210 (Telecommunication applications); C5690 (Other
data communication equipment and techniques)",
conflocation = "Nafplion, Greece; 15-19 July 1985",
conftitle = "Twelfth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Comput. Sci., Tel-Aviv Univ., Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "broadcasting; distributed algorithms; distributed
computation model; distributed processing; information
sharing; lower bounds; multiple identification
function; simulation; sorting networks; synchronous
broadcasting networks; telecommunication networks",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Larsen:1987:CDE,
author = "K. G. Larsen",
title = "A context dependent equivalence between processes",
journal = j-THEOR-COMP-SCI,
volume = "49",
number = "2--3",
pages = "185--215",
month = "",
year = "1987",
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 = "C4240 (Programming and algorithm theory)",
conflocation = "Nafplion, Greece; 15-19 July 1985",
conftitle = "Twelfth International Colloquium on Automata,
Languages and Programming",
corpsource = "Inst. of Electron. Syst., Aalborg Univ. Centre,
Denmark",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bisimulation equivalence; concurrent processes;
context dependent equivalence; information ordering;
nondeterministic processes; process-constructing
operations; programming theory",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Sistla:1987:CPB,
author = "A. Prasad Sistla and M. Y. Vardi and P. Wolper",
title = "The complementation problem for {Buchi} automata with
applications to temporal logic",
journal = j-THEOR-COMP-SCI,
volume = "49",
number = "2--3",
pages = "217--237",
month = "",
year = "1987",
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 = "C4220 (Automata theory)",
conflocation = "Nafplion, Greece; 15-19 July 1985",
conftitle = "Twelfth International Colloquium on Automata,
Languages and Programming",
corpsource = "Comput. Sci. Lab., GTE Lab. Inc, Waltham, MA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; Buchi automata; complementation
problem; complexity hierarchy; decision procedure;
exponential blow-up; polynomial space upper bound;
propositional temporal logic; temporal logic",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Cole:1987:PPS,
author = "R. Cole",
title = "Partitioning point sets in arbitrary dimension",
journal = j-THEOR-COMP-SCI,
volume = "49",
number = "2--3",
pages = "239--265",
month = "",
year = "1987",
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 = "C6120 (File organisation)",
conflocation = "Nafplion, Greece; 15-19 July 1985",
conftitle = "Twelfth International Colloquium on Automata,
Languages and Programming",
corpsource = "Courant Inst. of Math. Sci., New York Univ., NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arbitrary dimension; data structure; data structures;
half-space retrieval problem; parallel planes
partition; partitioning point sets",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Kurtz:1987:PDA,
author = "T. G. Kurtz and U. Manber",
title = "A probabilistic distributed algorithm for set
intersection and its analysis",
journal = j-THEOR-COMP-SCI,
volume = "49",
number = "2--3",
pages = "267--282",
month = "",
year = "1987",
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 = "C4240 (Programming and algorithm theory)",
conflocation = "Nafplion, Greece; 15-19 July 1985",
conftitle = "Twelfth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Math., Wisconsin Univ., Madison, WI, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; deterministic models;
distributed processing; Markov chains; probabilistic
distributed algorithm; probability; set disjointness;
set intersection",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Flajolet:1987:AMA,
author = "P. Flajolet",
title = "Analytic models and ambiguity of context-free
languages",
journal = j-THEOR-COMP-SCI,
volume = "49",
number = "2--3",
pages = "283--309",
month = "",
year = "1987",
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)",
conflocation = "Nafplion, Greece; 15-19 July 1985",
conftitle = "Twelfth International Colloquium on Automata,
Languages and Programming",
corpsource = "INRIA, Le Chesnay, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "ambiguity; analytic models; context-free languages;
counting generating functions; formal languages;
general density theorem",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Stirling:1987:MLC,
author = "C. Stirling",
title = "Modal logics for communicating systems",
journal = j-THEOR-COMP-SCI,
volume = "49",
number = "2--3",
pages = "311--347",
month = "",
year = "1987",
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 = "C4240 (Programming and algorithm theory)",
conflocation = "Nafplion, Greece; 15-19 July 1985",
conftitle = "Twelfth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "axiomatizations; CCS; communicating systems;
compositional rules; modal logics; program combinators;
programming theory; SCCS",
pubcountry = "Netherlands A11",
treatment = "T Theoretical or Mathematical",
}
@Article{Girard:1987:LL,
author = "J.-Y. Girard",
title = "Linear logic",
journal = j-THEOR-COMP-SCI,
volume = "50",
number = "1",
pages = "1--102",
month = "????",
year = "1987",
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)",
corpsource = "Paris VII Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "constructive logic; formal logic; linear negation;
negation",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Gray:1987:CAD,
author = "J. W. Gray",
title = "Categorical aspects of data type constructors",
journal = j-THEOR-COMP-SCI,
volume = "50",
number = "2",
pages = "103--135",
month = "????",
year = "1987",
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 = "C6120 (File organisation)",
corpsource = "Dept. of Math., Illinois Univ., Urbana-Champaign, IL,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "constructors; data structures; data types; fibred
category; homomorphism; many-sorted algebraic theories;
structured sketches; tensor product",
pubcountry = "Netherlands A01",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Bergstra:1987:ASC,
author = "J. A. Bergstra and J. V. Tucker",
title = "Algebraic specifications of computable and
semicomputable data types",
journal = j-THEOR-COMP-SCI,
volume = "50",
number = "2",
pages = "137--181",
month = "????",
year = "1987",
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 = "C6120 (File organisation); C6130 (Data handling
techniques)",
corpsource = "Dept. of Comput. Sci., Amsterdam Univ., Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computable data types; data structures; initial
algebra semantics; semicomputable data types;
specification mechanisms; symbol manipulation",
pubcountry = "Netherlands A02",
treatment = "B Bibliography; P Practical; T Theoretical or
Mathematical",
}
@Article{Mazoyer:1987:SSM,
author = "J. Mazoyer",
title = "A six-state minimal time solution to the firing squad
synchronization problem",
journal = j-THEOR-COMP-SCI,
volume = "50",
number = "2",
pages = "183--238",
month = "????",
year = "1987",
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 = "C4220 (Automata theory)",
corpsource = "Inst. de Math. et d'Inf., Univ. Claude Bernard,
Villeurbanne, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite automata; firing squad synchronization problem;
homothetical image; sequential machines; six-state
minimal time solution",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Phillips:1987:RT,
author = "I. Phillips",
title = "Refusal testing",
journal = j-THEOR-COMP-SCI,
volume = "50",
number = "3",
pages = "241--284",
month = "????",
year = "1987",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput., Imperial Coll. of Sci. and Technol.,
London, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "CCS processes; concurrent processes; observer;
parallel processing; programming theory; proof system;
refusal equivalence; refusal testing",
pubcountry = "Netherlands A01",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Sain:1987:TCN,
author = "I. Sain",
title = "Total correctness in nonstandard logics of programs",
journal = j-THEOR-COMP-SCI,
volume = "50",
number = "3",
pages = "285--321",
month = "????",
year = "1987",
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 = "C4240 (Programming and algorithm theory); C6150G
(Diagnostic, testing, debugging and evaluating
systems)",
corpsource = "Math. Inst., Hungarian Acad. of Sci., Budapest,
Hungary",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "explicit first-order characterizations; first-order
notion; intermittent assertions method; logic
programming; Manna-Cooper method; nonstandard logics of
programs; program verification; program-verifying
power; termination; total correctness",
pubcountry = "Netherlands A02",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Wagner:1987:CCP,
author = "E. G. Wagner and H. Ehrig",
title = "Canonical constraints for parameterized data types",
journal = j-THEOR-COMP-SCI,
volume = "50",
number = "3",
pages = "323--349",
month = "????",
year = "1987",
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 = "C6130 (Data handling techniques)",
corpsource = "Dept. of Math. Sci., IBM Thomas J. Watson Res. Center,
Yorktown Heights, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebras; canonical constraints; data handling;
parameterized data types",
pubcountry = "Netherlands A03",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Troelstra:1987:SML,
author = "A. S. Troelstra",
title = "On the syntax of {Martin-L{\"o}f}'s type theories",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "1--2",
pages = "1--26",
month = "????",
year = "1987",
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 = "C4220 (Automata theory)",
corpsource = "Math. Inst., Amsterdam Univ., Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arithmetical fragment; automata theory;
Martin-L{\"o}f's type theories; normalization of terms;
syntactical presentation; type-statement premises",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{LeChenadec:1987:ADA,
author = "P. {Le Chenadec}",
title = "Analysis of {Dehn}'s algorithm by critical pairs",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "1--2",
pages = "27--52",
month = "????",
year = "1987",
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)",
corpsource = "INRIA, Domaine de Voluceau, Rocquencourt, Le Chesnay,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "critical pairs; Dehn algorithm; formal languages;
formal logic; geometrical characterization; rewriting
rules",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Wagner:1987:MCQ,
author = "K. W. Wagner",
title = "More complicated questions about maxima and minima,
and some closures of {NP}",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "1--2",
pages = "53--80",
month = "????",
year = "1987",
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 = "C1180 (Optimisation techniques); C4210 (Formal
logic)",
corpsource = "Inst. fur Math., Augsburg Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean closure; Boolean functions; closures; maxima;
minima; minimisation; N P-complete problems;
polynominal-time hierarchy",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Habel:1987:CGL,
author = "A. Habel and H. J. Kreowski",
title = "Characteristics of graph languages generated by edge
replacement",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "1--2",
pages = "81--115",
month = "????",
year = "1987",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Fachbereich Math Inf., Bremen Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free grammars; edge replacement; graph
languages; graph theory",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Beauquier:1987:NCT,
author = "J. Beauquier and F. Gire",
title = "A note on the characterisation theorem for algebraic
generators",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "1--2",
pages = "117--127",
month = "????",
year = "1987",
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)",
corpsource = "Lab. Inf. Theor. et Programmation, Picardie Univ.,
Amiens, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "biprefix encodement; characterization theorem;
context-free generators; context-free language;
context-free languages; Schutzenberger generator",
language = "French",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Baeten:1987:CKF,
author = "J. C. M. Baeten and J. A. Bergstra and J. W. Klop",
title = "On the consistency of {Koomen}'s fair abstraction
rule",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "1--2",
pages = "129--176",
month = "????",
year = "1987",
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 = "C6120 (File organisation)",
corpsource = "Dept. of Comput. Sci., Amsterdam Univ., Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "approximation induction principle; data structures;
graph model; graph theory; Koomen fair abstraction
rule; recursive definition; specification principles",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Ambos-Spies:1987:DPT,
author = "K. Ambos-Spies and H. Fleischhack and H. Huwig",
title = "Diagonalizations over polynomial time computable
sets",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "1--2",
pages = "177--204",
month = "????",
year = "1987",
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 = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory)",
corpsource = "Lehrstuhl fur Inf. II, Dortmund Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; diagonalizations; p-generic;
p-immunity; polynomial time computable sets;
polynomials",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Orejas:1987:CPC,
author = "F. Orejas",
title = "A characterization of passing compatibility for
parameterized specifications",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "1--2",
pages = "205--214",
month = "????",
year = "1987",
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 = "C6120 (File organisation)",
corpsource = "Fac. d'Inf., Univ. Politecnica de Catalunya,
Barcelona, Spain",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "characterization; data structures; parameter passing;
parameterized specifications; passing compatibility",
pubcountry = "Netherlands A08",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Carpi:1987:URM,
author = "A. Carpi",
title = "On unambiguous reductions of monoids of unambiguous
relations",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "1--2",
pages = "215--220",
month = "????",
year = "1987",
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 = "B6120B (Codes); C1260 (Information theory)",
corpsource = "Dipartimento di Matematica e Applicazioni, Napoli
Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "codes; monoids; morphism; unambiguous reductions;
unambiguous relations",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Vyskoc:1987:TSA,
author = "J. Vyskoc",
title = "An {$O(n^{lgk}.2^n2)$} time and {$O(k.2^nk)$} space
algorithm for certain {NP-complete} problems",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "1--2",
pages = "221--227",
month = "????",
year = "1987",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Tech. Cybern., Slovak Acad. of Sci.,
Bratislava, Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; general-purpose algorithm;
NP-complete problems; space complexity",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
xxnote = "Check math in title??",
}
@Article{Belaga:1987:CUA,
author = "E. G. Belaga",
title = "Constructive universal algebra: an introduction",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "1--2",
pages = "229--238",
month = "????",
year = "1987",
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 = "B0210 (Algebra); C1110 (Algebra)",
corpsource = "IRMA-CNRS, Strasbourg, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebra; constructive universal algebra",
language = "French",
pubcountry = "Netherlands A11",
treatment = "T Theoretical or Mathematical",
}
@Article{Parberry:1987:TRS,
author = "I. Parberry",
title = "On the time required to sum n semigroup elements on a
parallel machine with simultaneous writes",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "1--2",
pages = "239--247",
month = "????",
year = "1987",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Pennsylvania State Univ.,
University Park, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; local instruction set;
parallel machine; parallel processing; semigroup
elements; semigroup summation problem; shared memory;
simultaneous writes",
pubcountry = "Netherlands A12",
treatment = "T Theoretical or Mathematical",
}
@Article{Head:1987:BDL,
author = "T. Head and B. Lando",
title = "Bounded {DL} languages",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "3",
pages = "255--264",
month = "????",
year = "1987",
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); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Math. Sci., Alaska Univ., Fairbanks, AK,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded language; computability; computational
complexity; D0L language; decidability; formal
languages; periodic D0L languages; polynomially
bounded",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Homer:1987:HPD,
author = "S. Homer and T. J. Long",
title = "Honest polynomial degrees and {P=?NP}",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "3",
pages = "265--280",
month = "????",
year = "1987",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Boston Univ., MA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability; computational complexity; honest
polynomial degrees; honest polynomial-time Turing
reducibility; minimal; nonrecursive sets; set theory;
tally sets",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Berard:1987:LSF,
author = "B. B{\'e}rard",
title = "Literal shuffle (formal languages)",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "3",
pages = "281--299",
month = "????",
year = "1987",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jun 21 07:21:15 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "closure properties; concurrent processes; formal
languages; literal shuffle; shuffle operation;
synchronous behaviour",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Yokomori:1987:PMC,
author = "T. Yokomori",
title = "On purely morphic characterizations of context-free
languages",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "3",
pages = "301--308",
month = "????",
year = "1987",
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)",
corpsource = "Int. Inst. for Adv. Study of Social Inf. Sci., Fujitsu
Ltd., Shizuoka, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; Dyck set; lambda - free;
morphic characterizations; two-letter alphabet",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Yamasaki:1987:FSH,
author = "S. Yamasaki and M. Yoshida and S. Doshita",
title = "A fixpoint semantics of {Horn} sentences based on
substitution sets",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "3",
pages = "309--324",
month = "????",
year = "1987",
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); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Inf. Sci., Kyoto Univ., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "answer set; continuous function; denotational
semantics; fixpoint semantics; formal logic; formal
semantics; Horn sentences; logic programming;
programming theory; substitution sets; unit deduction",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Hromkovic:1987:RBN,
author = "J. Hromkovic",
title = "Reversal-bounded nondeterministic multicounter
machines and complementation",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "3",
pages = "325--330",
month = "????",
year = "1987",
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 = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Theor. Cybern., Comenius Univ., Bratislava,
Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; counter reversals; finite
automata; formal languages; nondeterministic
multicounter machines; reversal bounded",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Beth:1987:CCG,
author = "T. Beth",
title = "On the computational complexity of the general
discrete {Fourier} transform",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "3",
pages = "331--339",
month = "????",
year = "1987",
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 = "C1130 (Integral transforms); C4240 (Programming and
algorithm theory)",
corpsource = "Fak. fur Inf., Karlsruhe Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; finite groups; Fourier
transforms; general discrete Fourier transform; group
algebras",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Galil:1987:PSM,
author = "Z. Galil and R. Giancarlo",
title = "Parallel string matching with k mismatches",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "3",
pages = "341--348",
month = "????",
year = "1987",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Columbia Univ., New York, NY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; fast integer multiplication
algorithms; k mismatches; parallel algorithms; string
matching",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Zaionc:1987:WOD,
author = "M. Zaionc",
title = "Word operation definable in the typed
lambda-calculus",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "1--2",
pages = "1--14",
month = "????",
year = "1987",
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)",
corpsource = "Dept. of Comp. and Inf. Sci., Alabama Univ.,
Birmingham, AL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "binary alphabet; binary word type; closed terms;
formal languages; formal logic; grammars; lambda
-definable word function; Schwichtenberg theorem; typed
lambda -calculus",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Ko:1987:HRO,
author = "K. I. Ko",
title = "On helping by robust oracle machines",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "1--2",
pages = "15--36",
month = "????",
year = "1987",
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 = "C1160 (Combinatorial mathematics); C4220 (Automata
theory); C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., State Univ. of New York, Stony
Brook, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; helping by robust oracle
Turing machines; one-sided helping; self-helping sets;
self-reducible sets; set theory; structural properties
of NP sets; Turing machines",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Kennaway:1987:GR,
author = "R. Kennaway",
title = "On 'On graph rewritings'",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "1--2",
pages = "37--58",
month = "????",
year = "1987",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Sch. of Inf. Syst., East Anglia Univ., Norwich, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "category theory; directed graphs; formal languages;
formal logic; graph rewritings; pushout; Raoult; redex;
term rewriting",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Sakarovitch:1987:RTL,
author = "J. Sakarovitch",
title = "On regular trace languages",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "1--2",
pages = "59--75",
month = "????",
year = "1987",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Lab. d'Inf. Th{\'e}orique et Programmation, Paris VI
Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean algebra; context-free languages; finite
automata; free partially commutative monoids; free
products of free commutative monoids; generalized
automata; group theory; regular trace languages; set
theory; unambiguous regular sets",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{vonzurGathen:1987:FPP,
author = "J. {von zur Gathen}",
title = "Factoring polynomials and primitive elements for
special primes",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "1--2",
pages = "77--89",
month = "????",
year = "1987",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Toronto Univ., Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; deterministic
polynomial-time equivalence; extended Riemann
hypothesis; number theory; polynomials; prime numbers;
primitive elements; univariate polynomial factoring",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Seite:1987:YEL,
author = "B. Seite",
title = "A {Yacc} extension for {LRR} grammar parsing",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "1--2",
pages = "91--143",
month = "????",
year = "1987",
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)",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Cohen-Culik LRR; complementary tables; conflicting
actions; deterministic bottom-up parsing; finite
automata; finite-state automata generation; grammars;
linear-time parsing; lookahead; LR automata; LR0
collection; LRR grammar parsing; stack; unbounded
examination; Yacc extension",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Mundici:1987:SMV,
author = "D. Mundici",
title = "Satisfiability in many-valued sentential logic is
{NP}-complete",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "1--2",
pages = "145--153",
month = "????",
year = "1987",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Oct 24 12:44:01 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Math. Inst., Florence Univ., Firenze, Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "calculus; computational complexity; Cook
NP-completeness theorem; Lukasiewicz infinite-valued
calculus; many-valued logics; many-valued sentential
logic; satisfiability",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Spirakis:1987:PCD,
author = "P. Spirakis",
title = "The parallel complexity of deadlock detection",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "1--2",
pages = "155--163",
month = "????",
year = "1987",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Courant Inst. of Math. Sci., New York, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; deadlock detection; directed
graphs; directed multigraph problem; distributed
processing; fast parallel algorithms; graph problems;
parallel algorithms; parallel complexity; programming
theory; serially re-usable multi-unit resources",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Moriya:1987:TCI,
author = "T. Moriya",
title = "Topological characterizations of infinite tree
languages",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "1--2",
pages = "165--171",
month = "????",
year = "1987",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Comput. Center, Kokushikan Univ., Tokyo, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite automata; formal languages; infinite tree
languages; topological properties; topology; tree
language acceptors; trees (mathematics)",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Kim:1987:MEP,
author = "C. Kim and I. H. Sudborough",
title = "The membership and equivalence problems for picture
languages",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "3",
pages = "177--191",
month = "????",
year = "1987",
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 = "C1250 (Pattern recognition); C4210 (Formal logic);
C4240 (Programming and algorithm theory)",
corpsource = "Sch. of Electr. Eng. and Comput. Sci., Oklahoma Univ.,
Norman, OK, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arbitrary picture; automata theory; automatic pattern
recognition problems; computational complexity; context
free picture language; context-free languages;
decidability; equivalence classes; equivalence problem;
formal language; membership problems; nondeterministic
polynomial time algorithm; NP complete problem; pattern
recognition; principal results; regular picture
languages",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Marberg:1987:DSA,
author = "J. M. Marberg and E. Gafni",
title = "Distributed sorting algorithms for multi-channel
broadcast networks",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "3",
pages = "193--203",
month = "????",
year = "1987",
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 = "C4240 (Programming and algorithm theory); C5620L
(Local area networks); C6130 (Data handling
techniques)",
corpsource = "Dept. of Comput Sci., California Univ., Los Angeles,
CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm theory; bit communication; bit strings;
broadcasting; distributed computation model;
distributed processing; distributed sorting algorithms;
efficient sorting method; independent processors; LAN;
local area networks; local computations; MCB;
multichannel broadcast networks; parallel algorithms;
relative order; shared broadcast channels; sorting;
synchronous cycles",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Felleisen:1987:STS,
author = "M. Felleisen and D. P. Friedman and E. Kohlbecker and
B. Duba",
title = "A syntactic theory of sequential control",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "3",
pages = "205--237",
month = "????",
year = "1987",
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); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract machine; algebraic extension; calculus;
call/cc; context-free languages; diamond property;
evaluation function; formal logic; lambda /sub nu /
calculus; lambda calculus; machine semantics;
nonfunctional control operators; programming language;
programming theory; rewriting machine; sequential
control; sequential machines; standardization theorem;
syntactic theory",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Nigmatullin:1987:MLB,
author = "R. G. Nigmatullin",
title = "Models of lower-bounds proofs",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "3",
pages = "239--249",
month = "????",
year = "1987",
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); C4240 (Programming and
algorithm theory)",
corpsource = "Kazan State Univ., USSR",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean circuits; Boolean functions; complexity;
computational complexity; effective proofs; function
width; high lower bounds; lower bounds;
superpolynomials; theorems; theoretical cybernetics",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Balcazar:1987:CCP,
author = "J. L. Balcazar and J. Diaz and J. Gabarro",
title = "On characterizations of the class {PSPACE\slash}
poly",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "3",
pages = "251--267",
month = "????",
year = "1987",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Fac. d'Inf. de Barcelona, Spain",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic closure operations; class PSPACE/poly;
computational complexity; exponential lower bound;
formal language theory; Kolmogorov complexity;
nonuniform complexity; parallel computation models;
polynomially space bounded machine; Turing machine;
vectorial straight line programs",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Gelenbe:1987:SDF,
author = "E. Gelenbe and D. Finkel",
title = "Stationary deterministic flows. {II.} The
single-server queue",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "3",
pages = "269--280",
month = "????",
year = "1987",
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 = "C1140C (Queueing theory)",
corpsource = "Lab. d'Inf. des Syst. Exp. et de leur Modelisation,
Univ. de Paris Sud, Orsay, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "asymptotic behavior; asymptotic birth/death equations;
computer-system performance analysis; discrete state
space; discrete systems; inter arrival times; long term
averages; probabilistic assumptions; queueing theory;
service times; single server queuing systems;
stability; stability conditions; stable queue;
stationary deterministic flows; unstable queue",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Topor:1987:DIF,
author = "R. W. Topor",
title = "Domain-independent formulas and databases",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "3",
pages = "281--306",
month = "????",
year = "1987",
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); C4250 (Database theory)",
corpsource = "Dept. of Comput. Sci., Melbourne Univ., Parkville,
Vic., Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "allowed formula; database clauses; database
management; database theory; deductive databases;
domain closure axioms; domain independent formulae;
logic programming; proof theoretic terms; query
evaluation; recursive functions; recursive subclass",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Stefanescu:1987:FTI,
author = "G. Stefanescu",
title = "On flowchart theories. {II.} The nondeterministic
case",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "3",
pages = "307--340",
month = "????",
year = "1987",
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); C4240 (Programming and
algorithm theory)",
corpsource = "Nat. Inst. for Sci. and Tech. Creation, Bucharest,
Romania",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic structure; axiomatized iteration;
axiomatized repetition; control flow; flowcharting;
formal logic; formal representation; iterative methods;
matrix algebra; matrix theory; natural equivalence;
nondeterministic flowchart schemes; nondeterministic
systems; polynomial calculus; programming theory",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Brandenburg:1987:CDA,
author = "F. J. Brandenburg",
title = "Comments on 'Deque automata and a subfamily of
context-sensitive languages which contains all
semilinear bounded languages'",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "3",
pages = "341--342",
month = "????",
year = "1987",
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 = "Lehrstuhl fur Inf., Passau Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context sensitive languages; context-sensitive
languages; multihead Turing tape; nondeterministic
automata; open problem; output restricted deque; quasi
realtime; semilinear bounded languages; Turing
machines; worktape",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Anonymous:1987:ECT,
author = "Anonymous",
title = "Eleventh Colloquium on Trees in Algebra and
Programming",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "1",
pages = "??--??",
month = "????",
year = "1987",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
conflocation = "Nice, France; March 1986",
conftitle = "Eleventh Colloquium on Trees in Algebra and
Programming",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebra; categorical treatment; Gaussian processes;
incremental attribute evaluation; list structures;
probabilistic Ianov schemes; programming; programming
theory; random walks; recursive procedures; sequences
of actions; trees; trees (mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Wagner:1987:CTP,
author = "E. G. Wagner",
title = "A categorical treatment of pre- and post-conditions",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "1",
pages = "3--24",
month = "",
year = "1987",
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 = "C4240 (Programming and algorithm theory)",
conflocation = "Nice, France; March 1986",
conftitle = "Eleventh Colloquium on Trees in Algebra and
Programming",
corpsource = "Dept. of Math. Sci., IBM Thomas J. Watson Res. Center,
Yorktown Heights, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "categorical treatment; Galois connection;
interpretations; morphisms; partial functions; post
conditions; preconditions; predicate transformers;
program verification; programming theory; relations;
total functions",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{File:1987:CIA,
author = "G. File",
title = "Classical and incremental attribute evaluation by
means of recursive procedures",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "1",
pages = "25--65",
month = "",
year = "1987",
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)",
conflocation = "Nice, France; March 1986",
conftitle = "Eleventh Colloquium on Trees in Algebra and
Programming",
corpsource = "CNRS, Bordeaux I Univ., Talence, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "absolutely noncircular; attribute grammars; classical
evaluation; grammars; incremental attribute evaluation;
recursive incremental evaluators; recursive
procedures",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{FrutosEscrig:1987:PIS,
author = "D. {Frutos Escrig}",
title = "Probabilistic {Ianov}'s schemes",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "1",
pages = "67--97",
month = "",
year = "1987",
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 = "C1140 (Probability and statistics); C4240
(Programming and algorithm theory)",
conflocation = "Nice, France; March 1986",
conftitle = "Eleventh Colloquium on Trees in Algebra and
Programming",
corpsource = "Dept. de Inf. y Autom., Fac. de Matematicas, Univ.
Complutense, Madrid, Spain",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "decision algorithms; equivalence; probabilistic Ianov
scheme; probability; programming theory; semantics",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Louchard:1987:RWG,
author = "G. Louchard",
title = "Random walks, {Gaussian} processes and list
structures",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "1",
pages = "99--124",
month = "",
year = "1987",
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 = "B0240 (Probability and statistics); C1140
(Probability and statistics)",
conflocation = "Nice, France; March 1986",
conftitle = "Eleventh Colloquium on Trees in Algebra and
Programming",
corpsource = "Lab. d'Inf. Th{\'e}orique, Univ. Libre de Bruxelles,
Belgium",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "asymptotic analysis; asymptotic normal distributions;
cost functions; Gaussian processes; list structure
properties; list structures; Markov processes;
Markovian processes; random processes; random walks",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Pelin:1987:BEC,
author = "A. Pelin and J. H. Gallier",
title = "Building exact computation sequences",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "1",
pages = "125--150",
month = "",
year = "1987",
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 = "C4240 (Programming and algorithm theory)",
conflocation = "Nice, France; March 1986",
conftitle = "Eleventh Colloquium on Trees in Algebra and
Programming",
corpsource = "Dept. of Math. Sci., Florida Int. Univ., Miami, FL,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "axiom systems; computational complexity; exact
computation sequences; free algebra; rewrite rules;
theorem proving; top-down reduction extension",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Pettorossi:1987:DEP,
author = "A. Pettorossi",
title = "Derivation of efficient programs for computing
sequences of actions",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "1",
pages = "151--167",
month = "",
year = "1987",
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 = "C4240 (Programming and algorithm theory)",
conflocation = "Nice, France; March 1986",
conftitle = "Eleventh Colloquium on Trees in Algebra and
Programming",
corpsource = "Istituto di Analisi dei Sistemi ed Inf., CNR, Rome,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "actions; iterative programs; moves; online behaviour;
programming theory; sequence of elementary actions;
sequences; Towers of Hanoi; transformation strategies",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Attiya:1987:LCS,
author = "H. Attiya and Y. Mansour",
title = "Language complexity on the synchronous anonymous
ring",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "2--3",
pages = "169--185",
month = "????",
year = "1987",
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); C5600 (Data communication
equipment and techniques)",
corpsource = "Dept. of Comput. Sci., Hebrew Univ., Jerusalem,
Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "counter-free regular languages; data communication
systems; formal languages; gap theorem; language
complexity; necessary and sufficient condition;
nondistinct processors; regular language; synchronous
anonymous ring",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Litovsky:1987:GRO,
author = "I. Litovsky and E. Timmerman",
title = "On generators of rational omega-power languages",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "2--3",
pages = "187--200",
month = "????",
year = "1987",
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)",
corpsource = "CNRS, Lille I Univ., Villeneuve d'Ascq., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal languages; maximal generators; rational omega
-power languages generators",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Schnorr:1987:HPT,
author = "C. P. Schnorr",
title = "A hierarchy of polynomial time lattice basis reduction
algorithms",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "2--3",
pages = "201--224",
month = "????",
year = "1987",
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 = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics); C4200 (Computer theory)",
corpsource = "Fachbereich Math./Inf., Frankfurt Univ., West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "combinatorial mathematics; computation theory;
hierarchy; Korkine-Zolotareff reduction; polynomial
time lattice basis reduction algorithms; shortest
nonzero element",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Abramsky:1987:OET,
author = "S. Abramsky",
title = "Observation equivalence as a testing equivalence",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "2--3",
pages = "225--241",
month = "????",
year = "1987",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Comput., Imperial Coll. of Sci. and Technol.,
London, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "combinatorial mathematics; copying; divergence; formal
logic; global testing; observation equivalence;
refusals; testing equivalence; traces; transition
systems",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Esik:1987:RTA,
author = "Z. Esik and F. Gecseg",
title = "On a representation of tree automata",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "2--3",
pages = "243--255",
month = "????",
year = "1987",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Bolyai Inst. A. Jozsef Univ., Szeged, Hungary",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; decidability; representation;
selective products; sequential compositions; tree
automata; trees (mathematics); unary case",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Muller:1987:NCS,
author = "H. Muller and A. Brandstadt",
title = "The {NP-completeness} of {Steiner} tree and dominating
set for chordal bipartite graphs",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "2--3",
pages = "257--265",
month = "????",
year = "1987",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Sektion Math., Friedrich-Schiller-Univ., Jena, East
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "chordal bipartite graphs; computational complexity;
dominating set; graph theory; NP-completeness; Steiner
tree",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Beynon:1987:PMC,
author = "M. Beynon and J. Buckle",
title = "On the planar monotone computation of {Boolean}
functions",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "2--3",
pages = "267--279",
month = "????",
year = "1987",
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)",
corpsource = "Dept. of Comput. Sci., Warwick Univ., Coventry, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean functions; planar monotone computation",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Peleg:1987:GPR,
author = "D. Peleg and E. Upfal",
title = "The generalized packet routing problem",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "2--3",
pages = "281--293",
month = "????",
year = "1987",
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 = "B0250 (Combinatorial mathematics); B6150
(Communication system theory); C1160 (Combinatorial
mathematics); C5620 (Computer networks and
techniques)",
corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "communication networks; data communication systems;
distributed processing; distributed systems;
generalized packet routing problem; graph theory; load
balancing problem; optimal algorithms; packet
switching; token distribution problem",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Rytter:1987:OPP,
author = "W. Rytter and R. Giancarlo",
title = "Optimal parallel parsing of bracket languages",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "2--3",
pages = "295--306",
month = "????",
year = "1987",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Comput. Sci., Warwick Univ., Coventry, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bracket context-free languages; context-free
languages; grammars; optimal parallel parsing; parallel
algorithms; tree compression; trees (mathematics)",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Garzon:1987:CA,
author = "M. Garzon",
title = "Cyclic automata",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "2--3",
pages = "307--317",
month = "????",
year = "1987",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Math., Illinois Univ., Urbana, IL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "1-pebble cyclic automata; 2-pebble automata; automata
theory; Cayley automaton; cyclic graph language;
decision problems; graph theory; Turing machine; Turing
machines",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Nishida:1987:RWS,
author = "T. Nishida and Y. Kobuchi",
title = "Repeatable words for substitution",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "2--3",
pages = "319--333",
month = "????",
year = "1987",
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)",
corpsource = "Dept. of Biophys., Fac. of Sci., Kyoto Univ., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free language; context-free languages;
repeatable language; repeatable languages; repeatable
words; substitution",
pubcountry = "Netherlands A11",
treatment = "T Theoretical or Mathematical",
}
@Article{Hallnas:1987:ICL,
author = "L. Hallnas",
title = "An intensional characterization of the largest
bisimulation",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "2--3",
pages = "335--343",
month = "????",
year = "1987",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Swedish Inst. of Comput. Sci., Spanga, Sweden",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; calculus of communication systems;
finite approximations; intensional characterization;
largest bisimulation; trees (mathematics)",
pubcountry = "Netherlands A12",
treatment = "T Theoretical or Mathematical",
}
@Article{Santoro:1987:GCV,
author = "N. Santoro and J. B. Sidney and S. J. Sidney and J.
Urrutia",
title = "Geometric containment and vector dominance",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "2--3",
pages = "345--352",
month = "????",
year = "1987",
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 = "C4190 (Other numerical methods)",
corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont.,
Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational geometry; geometric containment;
polygons; real variables; vector dominance",
pubcountry = "Netherlands A13",
treatment = "T Theoretical or Mathematical",
}
@Article{Hsiang:1987:AIT,
author = "Jieh Hsiang and M. Srivas",
title = "Automatic inductive theorem proving using {PROLOG}",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "1",
pages = "3--28",
month = sep,
year = "1987",
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 = "C1230 (Artificial intelligence); C4210 (Formal
logic); C6140D (High level languages)",
conflocation = "New Delhi, India; 16-18 Dec. 1985",
conftitle = "Fifth Conference on Foundations of Software Technology
and Theoretical Computer Science",
corpsource = "Dept. of Comput. Sci., State Univ. of New York, Stony
Brook, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automatic inductive theorem proving; backtracking;
backward chaining; domain partitioning; formal logic;
Horn clauses; lemma; limited forward chaining; PROLOG;
skolemization by need; suspended evaluation; theorem
proving",
pubcountry = "Netherlands A01",
sponsororg = "Indian Inst. Technol.; Tata Inst. Fundamental Res",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Jensen:1987:RDD,
author = "F. V. Jensen and K. D. Larsen",
title = "Recursively defined domains and their induction
principles",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "1",
pages = "29--51",
month = sep,
year = "1987",
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 = "C1230 (Artificial intelligence); C4210 (Formal
logic)",
conflocation = "New Delhi, India; 16-18 Dec. 1985",
conftitle = "Fifth Conference on Foundations of Software Technology
and Theoretical Computer Science",
corpsource = "Dept. of Comput. Sci., Aalborg Univ. Center, Denmark",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "denotational semantics; induction; recursive
functions; recursively-defined domains; simultaneous
recursion; theorem proving",
pubcountry = "Netherlands A02",
sponsororg = "Indian Inst. Technol.; Tata Inst. Fundamental Res",
treatment = "T Theoretical or Mathematical",
}
@Article{Marchetti-Spaccamela:1987:NPE,
author = "A. Marchetti-Spaccamela",
title = "New protocols for the election of a leader in a ring",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "1",
pages = "53--64",
month = sep,
year = "1987",
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 = "C4240 (Programming and algorithm theory); C5600
(Data communication equipment and techniques)",
conflocation = "New Delhi, India; 16-18 Dec. 1985",
conftitle = "Fifth Conference on Foundations of Software Technology
and Theoretical Computer Science",
corpsource = "Dipartimento di Inf. e Sistemistica, Roma Univ.,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "communication-time characteristics; computational
complexity; distributed election; distributed
processing; protocols; ring network; synchronous
communications; time complexity",
pubcountry = "Netherlands A03",
sponsororg = "Indian Inst. Technol.; Tata Inst. Fundamental Res",
treatment = "T Theoretical or Mathematical",
}
@Article{Pan:1987:CPM,
author = "V. Pan",
title = "Complexity of parallel matrix computations",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "1",
pages = "65--85",
month = sep,
year = "1987",
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 = "C4140 (Linear algebra); C4240 (Programming and
algorithm theory)",
conflocation = "New Delhi, India; 16-18 Dec. 1985",
conftitle = "Fifth Conference on Foundations of Software Technology
and Theoretical Computer Science",
corpsource = "Dept. of Comput. Sci., State Univ. of New York,
Albany, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arithmetic machine models; Boolean machine models;
characteristic polynomial; combinatorial computations;
computational complexity; determinant; deterministic
methods; integer input matrix; inverse; matrix algebra;
parallel algorithms; parallel complexity; parallel
matrix computations; polylogarithmic parallel time;
probabilistic approaches; processor complexity;
QR-factorizations; reduction to Hessenberg form; time
complexity; triangular factorisations",
pubcountry = "Netherlands A04",
sponsororg = "Indian Inst. Technol.; Tata Inst. Fundamental Res",
treatment = "T Theoretical or Mathematical",
}
@Article{Bajaj:1987:GOP,
author = "C. Bajaj",
title = "Geometric optimization and the polynomial hierarchy",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "1",
pages = "87--102",
month = sep,
year = "1987",
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 = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C4240 (Programming and
algorithm theory); C4290 (Other computer theory)",
conflocation = "New Delhi, India; 16-18 Dec. 1985",
conftitle = "Fifth Conference on Foundations of Software Technology
and Theoretical Computer Science",
corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Co-NP; computational complexity; computational
complexity classes; computational geometry; geometric
optimization; location-allocation problems under
minimax; location-allocation problems under minsum;
optimisation; polynomial hierarchy",
pubcountry = "Netherlands A05",
sponsororg = "Indian Inst. Technol.; Tata Inst. Fundamental Res",
treatment = "T Theoretical or Mathematical",
}
@Article{Lakshmanan:1987:ATF,
author = "V. S. Lakshmanan and C. E. {Veni Madhavan}",
title = "An algebraic theory of functional and multivalued
dependencies in relational databases",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "1",
pages = "103--128",
month = sep,
year = "1987",
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 = "C4250 (Database theory)",
conflocation = "New Delhi, India; 16-18 Dec. 1985",
conftitle = "Fifth Conference on Foundations of Software Technology
and Theoretical Computer Science",
corpsource = "Dept. of Comput. Sci. and Autom., Indian Inst. of
Sci., Bangalore, India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebra; algebraic theory; database theory; dependency
basis; dependency-lattice; functional dependencies;
inference basis; membership problem; multivalued
dependencies; relational databases",
pubcountry = "Netherlands A06",
sponsororg = "Indian Inst. Technol.; Tata Inst. Fundamental Res",
treatment = "T Theoretical or Mathematical",
}
@Article{Venkatesan:1987:AAW,
author = "S. M. Venkatesan",
title = "Approximation algorithms for weighted matching",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "1",
pages = "129--137",
month = sep,
year = "1987",
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 = "C1180 (Optimisation techniques); C4110 (Error
analysis in numerical methods); C4130 (Interpolation
and function approximation); C4240 (Programming and
algorithm theory)",
conflocation = "New Delhi, India; 16-18 Dec. 1985",
conftitle = "Fifth Conference on Foundations of Software Technology
and Theoretical Computer Science",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,,
MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "approximation algorithms; approximation theory;
computational complexity; error analysis; graph theory;
maximum weighted matching problem; n-vertex graphs;
optimisation; planar graph; relative error; time
complexity",
pubcountry = "Netherlands A07",
sponsororg = "Indian Inst. Technol.; Tata Inst. Fundamental Res",
treatment = "T Theoretical or Mathematical",
}
@Article{Priese:1987:IRT,
author = "L. Priese and R. Rehrmann and U. Willecke-Klemme",
title = "An introduction to the regular theory of fairness",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "2--3",
pages = "139--163",
month = oct,
year = "1987",
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 = "Fachbereich 17, Math./Inf., Univ. Gesamthochschule
Paderborn, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; fairness; formal languages; infinite
length; regular theory; words",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Rindone:1987:CFC,
author = "G. Rindone",
title = "Construction of a family of codes associated with
certain finite groups",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "2--3",
pages = "165--179",
month = oct,
year = "1987",
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 = "B6120B (Codes); C1260 (Information theory)",
corpsource = "Lab. d'Inf., Fac. des Sci., Mont-Saint Aignan,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "codes; conjecture of Perrin; family of codes; finite
abelian groups; finite groups; free monoid; Schreier
formula",
language = "French",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Brandstadt:1987:DPP,
author = "A. Brandstadt and D. Kratsch",
title = "On domination problems for permutation and other
graphs",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "2--3",
pages = "181--198",
month = oct,
year = "1987",
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 = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Sektion Math., Friedrich-Schiller-Univ., Jena, East
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "domination problems; graph theory; graphs; NP-complete
graph; permutation; polynomial time solution; weighted
feedback vertex set problem",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Szalas:1987:CAC,
author = "A. Szalas",
title = "A complete axiomatic characterization of first-order
temporal logic of linear time",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "2--3",
pages = "199--214",
month = oct,
year = "1987",
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)",
corpsource = "Inst. of Inf., Warsaw Univ., Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complete axiomatic characterization; first-order
temporal logic; formal logic; infinitary proof system;
linear time",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Cockett:1987:DDT,
author = "J. R. B. Cockett",
title = "Discrete decision theory: manipulations",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "2--3",
pages = "215--236",
month = oct,
year = "1987",
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 = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Comput. Sci., Tennessee Univ., Knoxville, TN,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "coalgebras; decision trees; discrete decision theory;
irreducible form; manipulations; simply reduced form;
trees (mathematics)",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Bertolazzi:1987:MAR,
author = "P. Bertolazzi and A. Sassano",
title = "An {O}(mn) algorithm for regular set-covering
problems",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "2--3",
pages = "237--247",
month = oct,
year = "1987",
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 = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics); C4230 (Switching theory)",
corpsource = "Istituto di Analisi dei Sistemi e Inf., CNR, Roma,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "combinatorial mathematics; ground set; regular
clutter; regular set-covering problems; set theory;
switching functions",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Watanabe:1987:CPT,
author = "O. Watanabe",
title = "A comparison of polynomial time completeness notions",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "2--3",
pages = "249--265",
month = oct,
year = "1987",
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 = "C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Tokyo Inst. of Technol.,
Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; polynomial time completeness notions;
polynomial time reductions; theorem proving",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Muller:1987:AAI,
author = "D. E. Muller and P. E. Schupp",
title = "Alternating automata on infinite trees",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "2--3",
pages = "267--276",
month = oct,
year = "1987",
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 = "C1160 (Combinatorial mathematics); C4220 (Automata
theory)",
corpsource = "Dept. of Math., Illinois Univ., Urbana, IL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alternation automata; automata theory; infinite trees;
trees (mathematics)",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Fauconnier:1987:ASI,
author = "H. Fauconnier",
title = "Asynchronous semantics and infinite behaviour in
{CSP}",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "2--3",
pages = "277--298",
month = oct,
year = "1987",
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 = "C4220 (Automata theory); C4230D (Sequential
switching theory)",
corpsource = "Lab. Inf. Theor. et Programmation, Paris Univ.,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "asynchronous semantics; automata theory; communicating
sequential processes; commutation relation; CSP
program; infinitary language; infinite behaviour;
sequential switching",
language = "French",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Ginsburg:1987:CFI,
author = "S. Ginsburg and Chang-jie Tang",
title = "Canonical forms for interval functions",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "2--3",
pages = "299--313",
month = oct,
year = "1987",
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 = "C4250 (Database theory)",
corpsource = "Dept. of Comput. Sci., Univ. of Southern California,
Los Angeles, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "canonical forms; database theory; interval functions;
nonnegative integer; real number",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Sado:1987:FEC,
author = "K. Sado and Y. Igarashi",
title = "A function for evaluating the computing time of a
bubbling system",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "2--3",
pages = "315--324",
month = oct,
year = "1987",
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 = "C4220 (Automata theory); C6130 (Data handling
techniques)",
corpsource = "Dept. of Comput. Sci., Gunma Univ., Kiryu, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; bubbling system; computing time;
dynamical system; equilibrium configuration; sorting",
pubcountry = "Netherlands A11",
treatment = "T Theoretical or Mathematical",
}
@Article{Iwata:1987:SPT,
author = "S. Iwata and T. Kasai",
title = "Simultaneous (poly-time, log-space) lower bounds",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "2--3",
pages = "325--329",
month = oct,
year = "1987",
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 = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Inf. Sci. Lab., Tokai Univ., Hiratsuka, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "binary storage symbols; halting problem; lower bound;
programming theory; simultaneous complexity; Turing
machine; Turing machines",
pubcountry = "Netherlands A12",
treatment = "T Theoretical or Mathematical",
}
@Article{Liskiewicz:1987:RBA,
author = "M. Liskiewicz and K. Lorys and M. Piotrow",
title = "On reversal bounded alternating {Turing} machines",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "2--3",
pages = "331--339",
month = oct,
year = "1987",
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 = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Inst. of Comput. Sci., Wroclaw Univ., Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; computational power;
nondeterministic Turing machines; regular languages;
reversal bounded alternating Turing machines; Turing
machines",
pubcountry = "Netherlands A13",
treatment = "T Theoretical or Mathematical",
}
@Article{Ko:1987:CFR,
author = "K.-I. Ko",
title = "On the continued fraction representation of computable
real numbers",
journal = j-THEOR-COMP-SCI,
volume = "54",
number = "2--3",
pages = "341--343",
month = oct,
year = "1987",
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 = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Math. Sci. Res. Inst., Berkeley, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "best approximation; computable real numbers; continued
fraction representation; intermediate fraction; number
theory; principal convergent",
pubcountry = "Netherlands A14",
treatment = "T Theoretical or Mathematical",
}
@Article{Peleg:1987:CPS,
author = "D. Peleg",
title = "Concurrent program schemes and their logics",
journal = j-THEOR-COMP-SCI,
volume = "55",
number = "1",
pages = "1--45",
month = nov,
year = "1987",
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); C6150J (Operating systems)",
corpsource = "Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot,
Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "axiomatization; Boolean-variable; concurrent program
schemes; decidability; formal languages; formal logic;
goto schemes; grammars; logics; multiprocessing
programs; propositional levels; regular expressions;
structured schemes; trees",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Seidl:1987:PRH,
author = "H. Seidl",
title = "Parameter-reduction of higher level grammars",
journal = j-THEOR-COMP-SCI,
volume = "55",
number = "1",
pages = "47--85",
month = nov,
year = "1987",
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)",
corpsource = "Fachbereich Inf., Johann Wolfgang Goethe-Univ.,
Frankfurt am Main, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "grammars; higher level grammars; parameter reductions;
parameter-reduced; terminating",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Best:1987:SCB,
author = "E. Best and R. Devillers",
title = "Sequential and concurrent behaviour in {Petri} net
theory",
journal = j-THEOR-COMP-SCI,
volume = "55",
number = "1",
pages = "87--136",
month = nov,
year = "1987",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Oct 26 07:54:23 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Inst. fur Methodische Grundlagen, Gesellschaft fur
Math. und Datenverarbeitung, St Augustin, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arbitrary interleaving; axiomatic approach; concurrent
behaviour; directed graphs; inductive semantics;
occurrence sequences; partial orders; Petri net theory;
sequential behaviour",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Courcelle:1987:ADC,
author = "B. Courcelle",
title = "An axiomatic definition of context-free rewriting and
its application to {NLC} graph grammars",
journal = j-THEOR-COMP-SCI,
volume = "55",
number = "2--3",
pages = "141--181",
month = dec,
year = "1987",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. d'Inf., Bordeaux-I Univ., Talence, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "axiomatic definition; context-free grammars;
context-free rewriting; decidability; graph theory;
monadic second-order theory; NLC graph grammars; trees;
trees (mathematics); words",
pubcountry = "Netherlands A01",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Brandenburg:1987:RLF,
author = "F.-J. Brandenburg",
title = "Representations of language families by homomorphic
equality operations and generalized equality sets",
journal = j-THEOR-COMP-SCI,
volume = "55",
number = "2--3",
pages = "183--263",
month = dec,
year = "1987",
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)",
corpsource = "Lehrstuhl fur Informatik, Passau Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal language theory; formal languages; free
monoids; generalized equality sets; homomorphic
equality operations; language families; Post
Correspondence Problem; recursively enumerable set",
pubcountry = "Netherlands A02",
treatment = "B Bibliography; T Theoretical or Mathematical",
}
@Article{Bartha:1987:EAS,
author = "M. Bartha",
title = "An equational axiomatization of systolic systems",
journal = j-THEOR-COMP-SCI,
volume = "55",
number = "2--3",
pages = "265--289",
month = dec,
year = "1987",
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 = "C6110 (Systems analysis and programming)",
corpsource = "Dept. of Comput. Sci., A. Jozsef Univ., Szeged,
Hungary",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic language; composition; data elements; delay
number; equational axiomatization; feedback operation;
flowchart scheme; flowcharting; iteration; loop-free
schemes; nonnegative integer; pairing; systolic
systems",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Lehmann:1987:UMC,
author = "J.-P. Lehmann",
title = "A universal machine without change of state",
journal = j-THEOR-COMP-SCI,
volume = "55",
number = "2--3",
pages = "291--348",
month = dec,
year = "1987",
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 = "Louis Pasteur Univ., Avignon, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean processing component; distinct theory; formal
logic; notion of symbol; Turing machines; universal
machine",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Armbruster:1988:PDM,
author = "D. Armbruster",
title = "A polynomial determination of the most-recent property
in {Pascal-like} programs",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "1",
pages = "3--15",
month = jan,
year = "1988",
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 = "C4240 (Programming and algorithm theory); C6140D
(High level languages); C6150C (Compilers, interpreters
and other processors)",
corpsource = "Inst. fur Inf., Stuttgart Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "compiler; most-recent property; Pascal; polynomial
time complexity; program compilers; programming theory;
reachability problem; reduced instruction set
computing; RISC; Wirth-Pascal-like programs",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Hankin:1988:SAP,
author = "C. Hankin and G. Burn and S. {Peyton Jones}",
title = "A safe approach to parallel combinator reduction",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "1",
pages = "17--36",
month = jan,
year = "1988",
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 = "C4240 (Programming and algorithm theory); C6150C
(Compilers, interpreters and other processors)",
corpsource = "Dept. of Comput., Imperial Coll. of Sci. and Technol.,
London, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract interpretation; compile-time program
parallelisation; functional language; functional
programs; lazy semantics; parallel combinator
reduction; parallel programming; program compilers;
programming theory; strictness analysis",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Kaplan:1988:RNC,
author = "S. Kaplan",
title = "Rewriting with a nondeterministic choice operator",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "1",
pages = "37--57",
month = jan,
year = "1988",
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); C4240 (Programming and
algorithm theory)",
corpsource = "LRI, Univ. des Sci., Orsay, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebra; algebraic specifications; bounded
nondeterministic choice operator; classical algebra;
equational rewriting; formal languages; formal logic;
programming theory; term-rewriting systems; toy
concurrent language",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Nielson:1988:TLS,
author = "F. Nielson and H. R. Nielson",
title = "Two-level semantics and code generation",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "1",
pages = "59--133",
month = jan,
year = "1988",
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 = "C4240 (Programming and algorithm theory); C6150C
(Compilers, interpreters and other processors)",
corpsource = "Dept. of Comput. Sci., Tech. Univ. of Denmark, Lyngby,
Denmark",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "activation records; code generation; compile-time;
correctness; data flow analysis; Kripke-like relations;
Pascal-like languages; program compilers; program
verification; programming theory; run-time;
stack-machine; syntactic restrictions; two-level
denotational metalanguage; two-level semantics",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Stark:1988:PEB,
author = "E. W. Stark",
title = "Proving entailment between conceptual state
specifications",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "1",
pages = "135--154",
month = jan,
year = "1988",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., State Univ. of New York, Stony
Brook, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "completeness; conceptual state specifications;
entailment proving; expressive power; program
verification; programming theory; simulation between
machines; specification language; specification
languages; temporal logic",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Fachini:1988:CTS,
author = "E. Fachini and M. Napoli",
title = "{C}-tree systolic automata",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "2",
pages = "155--186",
month = feb,
year = "1988",
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 = "C1160 (Combinatorial mathematics); C4220 (Automata
theory)",
corpsource = "Dipartimento Inf. e Applicazioni, Salerno Univ.,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "C-tree systolic automata; finite automata;
homogeneity; Lindenmayer EPT0L languages; sequential
machines; stability; trees (mathematics)",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Marek:1988:NSM,
author = "W. Marek",
title = "A natural semantics for modal logic over databases",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "2",
pages = "187--209",
month = feb,
year = "1988",
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); C4250 (Database theory)",
corpsource = "Dept. of Comput. Sci., Kentucky Univ., Lexington, KY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "database theory; databases; formal logic; modal logic;
model theoretic forcing; natural semantics",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Iliopoulos:1988:CCA,
author = "C. S. Iliopoulos",
title = "On the computational complexity of the {Abelian}
permutation group structure, membership and
intersection problems",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "2",
pages = "211--222",
month = feb,
year = "1988",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abelian permutation group structure; complete
structure; computational complexity; intersection
problems; membership; membership-inclusion testing;
upper bounds; worst-case time complexity",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Sekimoto:1988:OSR,
author = "S. Sekimoto and S. Hirokawa",
title = "One-step recurrent terms in
$\lambda$-$\beta$-calculus",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "2",
pages = "223--231",
month = feb,
year = "1988",
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 = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Comput. Sci., Shizuoka Univ., Hamamatsu,
Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "directed graphs; lambda - beta - calculus; necessary
and sufficient condition; one step recurrent terms",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Carpi:1988:MUC,
author = "A. Carpi",
title = "Multidimensional unrepetitive configurations",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "2",
pages = "233--241",
month = feb,
year = "1988",
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 = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dipartimento di Matematica e Applicazioni, Napoli
Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "biinfinite words; combinatorial mathematics; finite
alphabets; multidimensional unrepetitive
configurations",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Mohrherr:1988:RLP,
author = "J. Mohrherr",
title = "A remark on the length problem",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "2",
pages = "243--248",
month = feb,
year = "1988",
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 = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal logic; length problem; set theory",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Tretkoff:1988:CCG,
author = "C. Tretkoff",
title = "Complexity, combinatorial group theory and the
language of palutators",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "3",
pages = "253--275",
month = mar,
year = "1988",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Brooklyn Coll., NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "combinatorial group theory; combinatorial mathematics;
commutator; computational complexity; group languages;
group theory; palindrome; word problems",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Staples:1988:DUA,
author = "J. Staples",
title = "Delaying unification algorithms for lambda calculi",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "3",
pages = "277--288",
month = mar,
year = "1988",
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 = "C1230 (Artificial intelligence)",
corpsource = "Dept. of Comput. Sci., Queensland Univ., St. Lucia,
Qld., Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "higher-order resolution method; lambda calculi; logic
programming; rewriting systems; theorem proving;
unification algorithms delaying; unification
constraint",
pubcountry = "Netherlands A02",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Gradel:1988:SPA,
author = "E. Gradel",
title = "Subclasses of {Presburger} arithmetic and the
polynomial-time hierarchy",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "3",
pages = "289--301",
month = mar,
year = "1988",
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 = "C1140E (Game theory); C4240 (Programming and
algorithm theory)",
corpsource = "Math. Inst., Basel Univ., Switzerland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "-completeness; addition; alternations; complexity;
computational complexity; decision theory; first-order
theory; natural numbers; polynomial-time hierarchy;
quantifiers; subclasses of Presburger arithmetic",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Martino:1988:QIG,
author = "A. Martino",
title = "A quantitative interpretation of {Girard}'s system
{$F$}",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "3",
pages = "303--320",
month = mar,
year = "1988",
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 = "C4240 (Programming and algorithm theory)",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Girard's system F; nondeterminism; programming theory;
quantitative interpretation; random programs",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Boonyavatana:1988:IPL,
author = "R. Boonyavatana and G. Slutzki",
title = "The interchange or pump ({DI)lemmas} for context-free
languages",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "3",
pages = "321--338",
month = mar,
year = "1988",
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)",
corpsource = "Dept. of Comput. Sci., Iowa State Univ., Ames, IA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; generalized Ogden's condition;
interchange conditions; Ogden's condition; pumping
conditions; Sokolowski-type conditions",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Bruyere:1988:AQA,
author = "V. Bruyere",
title = "An answer to a question about finite maximal prefix
sets of words",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "3",
pages = "339--344",
month = mar,
year = "1988",
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 = "B6120B (Codes); C1260 (Information theory)",
corpsource = "Dept. d'Inf., Etat Univ., Mons, Belgium",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "codes; finite maximal prefix sets; words",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Baader:1988:UCI,
author = "F. Baader and W. Buttner",
title = "Unification in commutative idempotent monoids",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "3",
pages = "345--353",
month = mar,
year = "1988",
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 = "C6120 (File organisation)",
corpsource = "Friedrich-Alexander-Univ., Erlangen, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "associativity; Boolean expressions; commutative
idempotent monoids; commutativity; correctness; data
structure; data structures; resolution-based deduction;
sets embedding; termination; unification; unitary
theory",
pubcountry = "Netherlands A07",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Broy:1988:ESP,
author = "M. Broy",
title = "Equational specification of partial higher-order
algebras",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "1",
pages = "3--45",
month = apr,
year = "1988",
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 = "C6120 (File organisation)",
conflocation = "Bratislava, Czechoslovakia; 25-29 Aug. 1986",
conftitle = "International Symposium on Mathematical Foundations of
Computer Science",
corpsource = "Passau Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic abstract types; data structures; deduction
rules; definedness predicate; equational specification;
partial higher-order algebras; partial
interpretations",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Ibarra:1988:TDI,
author = "O. H. Ibarra and M. A. Palis",
title = "Two-dimensional iterative arrays: characterizations
and applications",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "1",
pages = "47--86",
month = apr,
year = "1988",
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)",
conflocation = "Bratislava, Czechoslovakia; 25-29 Aug. 1986",
conftitle = "International Symposium on Mathematical Foundations of
Computer Science",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cellular arrays; characterizations; sequential machine
characterizations; sequential machines;
space-reduction; Turing machines; two-dimensional
iterative arrays",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Ablyv:1988:CPP,
author = "F. M. Ablyv",
title = "The complexity properties of probabilistic automata
with isolated cut point",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "1",
pages = "87--95",
month = apr,
year = "1988",
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 = "C4220 (Automata theory)",
conflocation = "Bratislava, Czechoslovakia; 25-29 Aug. 1986",
conftitle = "International Symposium on Mathematical Foundations of
Computer Science",
corpsource = "Dept. of Math., Kazan State Univ., USSR",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; bounded error probability; complexity
properties; isolated cut point; probabilistic
automata",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Hromkovic:1988:ANA,
author = "J. Hromkovic",
title = "The advantages of a new approach to defining the
communication complexity for {VLSI}",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "1",
pages = "97--111",
month = apr,
year = "1988",
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 = "B2570 (Semiconductor integrated circuits); C1260
(Information theory); C5620 (Computer networks and
techniques)",
conflocation = "Bratislava, Czechoslovakia; 25-29 Aug. 1986",
conftitle = "International Symposium on Mathematical Foundations of
Computer Science",
corpsource = "Dept. of Theor. Cybern., Komensky Univ., Bratislava,
Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean formula; communication complexity; information
theory; language recognition; protocols;
S-communication complexity; strongest lower bound;
VLSI",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Jukna:1988:ECC,
author = "S. P. Jukna",
title = "Entropy of contact circuits and lower bounds on their
complexity",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "1",
pages = "113--129",
month = apr,
year = "1988",
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)",
conflocation = "Bratislava, Czechoslovakia; 25-29 Aug. 1986",
conftitle = "International Symposium on Mathematical Foundations of
Computer Science",
corpsource = "Inst. of Math., Lithuanian Acad. of Sci., Vilnius,
Lithuanian SSR, USSR",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean functions; contact circuits entropy;
entropy-preserving embeddings; explicitly defined
Boolean functions; finite objects; lower bounds",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Tarhio:1988:GAA,
author = "Jorma Tarhio and Esko Ukkonen",
title = "A greedy approximation algorithm for constructing
shortest common superstrings",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "1",
pages = "131--145",
month = apr,
year = "1988",
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 of Helsinki",
affiliationaddress = "Helsinki, Finl",
classification = "723; 921; B0290F (Interpolation and function
approximation); B6140 (Signal processing and
detection); C1260 (Information theory)C4130
(Interpolation and function approximation)",
conference = "International Symposium on Mathematical Foundations of
Computer Science, MFCS '86",
conflocation = "Bratislava, Czechoslovakia; 25-29 Aug. 1986",
conftitle = "International Symposium on Mathematical Foundations of
Computer Science",
corpsource = "Dept. of Comput. Sci., Helsinki Univ., Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; approximation theory; Computer
Programming; data compression; Greedy Approximation
Algorithm; greedy approximation algorithm; greedy
heuristics; Hamiltonian paths; Knuth-Morris-Pratt
string-matching procedure; Longest Hamiltonian Paths;
Mathematical Techniques --- Graph Theory; Optimization;
Shortest Common Superstrings; shortest common
superstrings; String Compression; String-Matching;
Weighted Graphs; weighted graphs",
meetingaddress = "Bratislava, Czech",
meetingdate = "Aug 25--29 1986",
meetingdate2 = "08/25--29/86",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Kuich:1988:MSP,
author = "W. Kuich",
title = "Matrix systems and principal cones of algebraic power
series",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "1",
pages = "147--152",
month = apr,
year = "1988",
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 = "Technische Univ Wien",
affiliationaddress = "Vienna, Austria",
classification = "721; 921; C1160 (Combinatorial mathematics); C4210
(Formal logic)",
conference = "International Symposium on Mathematical Foundations of
Computer Science, MFCS '86",
conflocation = "Bratislava, Czechoslovakia; 25-29 Aug. 1986",
conftitle = "International Symposium on Mathematical Foundations of
Computer Science",
corpsource = "Inst. f{\"u}r Algebra und Diskrete Math., Tech. Univ.,
Wien, Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algebraic Power Series; algebraic power series;
Automata Theory; Context Free Languages; context-free
languages; Mathematical Techniques --- Algebra; Matrix
Systems; matrix systems; principal cone generator;
Principal Cones; principal cones; series
(mathematics)",
meetingaddress = "Bratislava, Czech",
meetingdate = "Aug 25--29 1986",
meetingdate2 = "08/25--29/86",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Skarbek:1988:GOT,
author = "Wladyslaw Skarbek",
title = "Generating ordered trees",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "1",
pages = "153--159",
month = apr,
year = "1988",
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 = "Alfateh Univ",
affiliationaddress = "Tripoli, Libya",
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
conference = "International Symposium on Mathematical Foundations of
Computer Science, MFCS '86",
conflocation = "Bratislava, Czechoslovakia; 25-29 Aug. 1986",
conftitle = "International Symposium on Mathematical Foundations of
Computer Science",
corpsource = "Dept. of Comput. Sci., Alfateh Univ., Tripoli, Libya",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; combinatorial mathematics; Computer
Programming; Lexicographic Order; Mathematical
Techniques --- Trees; nonrecursive algorithm; Ordered
Trees; ordered trees generation; path compression; Tree
Generation; Tree Transformation; trees (mathematics)",
meetingaddress = "Bratislava, Czech",
meetingdate = "Aug 25--29 1986",
meetingdate2 = "08/25--29/86",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Avron:1988:SPT,
author = "A. Avron",
title = "The semantics and proof theory of linear logic",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "2--3",
pages = "161--184",
month = may,
year = "1988",
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)",
corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal logic; linear logic; parallelism; proof
systems; proof theory; semantics; strong completeness
theorems",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
@Article{Pierre:1988:RIC,
author = "L. Pierre and J.-M. Farinone",
title = "Rational index of context-free languages in {$ \exp
(\Theta (\sqrt [p]{n})) $} and {$ n^{\Theta ((\ln n)^(1
/ p))} $}",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "2--3",
pages = "185--204",
month = may,
year = "1988",
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)",
corpsource = "Paris X Univ., Nanterre, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; rational index; rational
transductions",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{Velinov:1988:ASD,
author = "Y. Velinov",
title = "An algebraic structure for derivations in rewriting
systems",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "2--3",
pages = "205--224",
month = may,
year = "1988",
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)",
corpsource = "Center of Appl. Math., High Inst. of Mech. and Electr.
Eng., Sofia, Bulgaria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic structure; derivations; formal logic;
polycategory structure; rewriting systems; semantics;
syntax",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
@Article{Ibarra:1988:RPC,
author = "O. H. Ibarra and Tao Jiang",
title = "Relating the power of cellular arrays to their closure
properties",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "2--3",
pages = "225--238",
month = may,
year = "1988",
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 = "C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "CA languages; closure properties; finite automata;
one-way data communication; power of cellular arrays",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
@Article{Duchamp:1988:TTP,
author = "G. Duchamp and J. Y. Thibon",
title = "Transfer theorems for partially commutative
polynomials",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "2--3",
pages = "239--249",
month = may,
year = "1988",
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 = "B0290F (Interpolation and function approximation);
C4130 (Interpolation and function approximation)",
corpsource = "Lab. Inf. Th{\'e}orique et Programmation, Paris 7
Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "divisibility; free partially commutative monoids;
K-algebras; polynomials; semiring K; transfer
theorems",
language = "French",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}
@Article{Meyer:1988:ACS,
author = "J.-J. C. Meyer and E. P. {de Vink}",
title = "Applications of compactness in the {Smyth} powerdomain
of streams",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "2--3",
pages = "251--282",
month = may,
year = "1988",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math. and Comput. Sci., Free Univ.,
Amsterdam, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "compactness; continuity; hiding; interleaving;
programming theory; Smyth powerdomain of streams;
stream programming operators; uniform setting",
pubcountry = "Netherlands A06",
treatment = "T Theoretical or Mathematical",
}
@Article{Beal:1988:CCF,
author = "M. P. Beal",
title = "Circular codes, finite automata and entropy",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "2--3",
pages = "283--302",
month = may,
year = "1988",
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 = "C1260 (Information theory); C4220 (Automata
theory)",
corpsource = "Lab. d'Inf. Th{\'e}orique et Programmation, Paris 7
Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arbitrary sequences; circular codes; codes; entropy;
finite automata",
language = "French",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
@Article{Hashiguchi:1988:NCR,
author = "K. Hashiguchi",
title = "Notes on congruence relations and factor pumping
conditions for rational languages",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "2--3",
pages = "303--316",
month = may,
year = "1988",
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)",
corpsource = "Dept. of Inf. and Comput. Sci., Toyohashi Univ. of
Technol., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "congruence relations; factor pumping conditions;
formal languages; rational languages; sufficient
conditions",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}
@Article{Szalas:1988:IFO,
author = "A. Szalas and L. Holenderski",
title = "Incompleteness of first-order temporal logic with
until",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "2--3",
pages = "317--325",
month = may,
year = "1988",
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)",
corpsource = "Inst. of Inf., Warsaw Univ., Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "axiomatizability problem; complete proof system;
discrete time; first-order temporal logic; formal
logic; linear time",
pubcountry = "Netherlands A09",
treatment = "T Theoretical or Mathematical",
}
@Article{Grossman:1988:IIC,
author = "J. W. Grossman and R. S. Zeitman",
title = "An inherently iterative computation of {Ackermann}'s
function",
journal = j-THEOR-COMP-SCI,
volume = "57",
number = "2--3",
pages = "327--330",
month = may,
year = "1988",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Oakland Univ., Rochester, MI, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Ackermann function; computational complexity;
inherently iterative computation; iterative algorithm;
recursive definition; space complexity; time
complexity",
pubcountry = "Netherlands A10",
treatment = "T Theoretical or Mathematical",
}
@Article{Arques:1988:CAC,
author = "D. Arques and J. Francon and M. T. Guichet and P.
Guichet",
title = "Comparison of algorithms controlling concurrent access
to a database: {A} combinatorial approach",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "3--16",
month = jun,
year = "1988",
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 Haute Alsace",
affiliationaddress = "Mulhouse, Fr",
classification = "723; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C4250 (Database
theory)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Inst. des Sci. Exactes et Appl., Univ. de Haute
Alsace, Mulhouse, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "algorithm theory; asymptotic frequencies;
combinatorial approach; combinatorial mathematics;
Computer Programming--Algorithms; Concurrency Control
Algorithms; concurrent access controlling algorithms;
database; Database Access; Database Systems; database
theory; deadlocked executions; Deadlocking; degree of
authorized parallelism; load factor; Serializability;
Timestamp Ordering; timestamp ordering; Two-Phase
Locking; two-phases locking",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Averbuch:1988:CAM,
author = "Amir Averbuch and Zvi Galil and Shmuel Winograd",
title = "Classification of all the minimal bilinear algorithms
for computing the coefficients of the product of two
polynomials modulo a polynomial. {Part I}. The algebra
{$G[u]/<Q(u)^\ell>,\ell>1$}",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "17--56",
month = jun,
year = "1988",
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 = "IBM Thomas J. Watson Research Cent",
affiliationaddress = "Yorktown Heights, NY, USA",
classification = "723; 921; C4240 (Programming and algorithm theory)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; classification; Coefficients of
Polynomials; computational complexity; Computer
Programming; Mathematical Techniques--Polynomials;
Minimal Bilinear Algorithms; minimal bilinear
algorithms; Noncommutative Algorithms; polynomials;
Polynomials Products",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Borodin:1988:TBS,
author = "Allan Borodin and Faith E. Fich and Friedhelm {Meyer
auf der Heide} and Eli Upfal and Avi Wigderson",
title = "A tradeoff between search and update time for the
implicit dictionary problem",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "57--68",
month = jun,
year = "1988",
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 of Toronto",
affiliationaddress = "Toronto, Ont, Can",
classification = "723; C6120 (File organisation); C6160 (Database
management systems (DBMS))",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Comput. Sci., Toronto Univ., Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Data Processing--Data Structures; data structures;
Data Types; database management systems; Database
Searching; Database Systems; Database Update; Implicit
Dictionary Problem; implicit dictionary problem; search
time; update time",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Brandenburg:1988:ISQ,
author = "Franz J. Brandenburg",
title = "On the intersection of stacks and queues",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "69--80",
month = jun,
year = "1988",
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 Passau",
affiliationaddress = "Passau, West Ger",
classification = "721; C4210 (Formal logic); C4220 (Automata theory)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Fakultat f{\"u}r Math. und Inf., Passau Univ., West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; automata theory; Context Free
Language; context-free languages; families of
languages; Formal Languages; formal languages;
intersection; Intersections of Language Families;
Nondeterministic Real Time Machines; nondeterministic
real-time machines; one-reset tape; one-reversal
restrictions; pushdown stack; Pushdown Stacks; Queues;
queues; regular languages; retrieval restriction;
stacks; symmetry",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Choffrut:1988:CRF,
author = "C. Choffrut and M. P. Sch{\"u}tz\-en\-berger",
title = "Counting with rational functions",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "81--101",
month = jun,
year = "1988",
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 Rouen",
affiliationaddress = "Mont-St.-Aignan, Fr",
classification = "721; C4220 (Automata theory)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Fac. des Sci., Rowen Univ., Mont-Saint-Aignan,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; automata theory; Counting Functions;
free cyclic monoid; Free Cyclic Monoids; free monoid;
Free Monoids; integer; Lipschitz Condition; Lipschitz
condition; Lipschitz Functions; Rational Functions;
rational functions counting",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{DeFelice:1988:FBS,
author = "Clelia {De Felice}",
title = "Finite biprefix sets of paths in a graph",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "103--128",
month = jun,
year = "1988",
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 di Napoli",
affiliationaddress = "Naples, Italy",
classification = "723; 921; B0250 (Combinatorial mathematics); B6120B
(Codes); C1160 (Combinatorial mathematics); C1260
(Information theory)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dipartimento di Matematica e Appl., Napoli Univ.,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Cesari-Sch{\"u}tzenberger Algorithm; Codes of Paths in
a Graph; Codes, Symbolic; Computer
Programming--Algorithms; Finite Biprefix Sets; Graph
Theory; Integration of Codes; Mathematical Techniques;
codes; combinatorial theory; decoding; double-infinite
paths; finite biprefix sets; graph; graph theory;
integration; maximal biprefix codes of words",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Hartmanis:1988:CCM,
author = "Juris Hartmanis and Lane A. Hemachandra",
title = "Complexity classes without machines: On complete
languages for {UP}",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "129--142",
month = jun,
year = "1988",
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 = "Cornell Univ",
affiliationaddress = "Ithaca, NY, USA",
classification = "721; 723; C4210 (Formal logic); C4240 (Programming
and algorithm theory)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; Complete Languages; complete
languages; Complexity Classes; complexity classes;
computational complexity; Computer Metatheory;
counting; Counting Class up; counting classes; Formal
Languages; formal languages; intersection classes; np
Languages; probabilistic classes; UP",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Kirschenhofer:1988:FRD,
author = "Peter Kirschenhofer and Helmut Prodinger",
title = "Further results on digital search trees",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "143--154",
month = jun,
year = "1988",
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 = "Technische Univ Wien",
affiliationaddress = "Vienna, Austria",
classification = "723; 921; C1160 (Combinatorial mathematics); C6120
(File organisation)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Inst. f{\"u}r Algebra and Diskrete Math., Tech. Univ.
Wien, Vienna, Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Binary Tries; Calculus of Finite Differences; Computer
Programming--Algorithms; cost of insertion; Data
Processing; Data Structures; data structures; Database
Searching; Database Systems; Digital Search Trees;
digital search trees; distribution results; finite
differences; Insertion Costs; Mathematical
Techniques--Trees; Patricia Tries; Patricia tries;
trees (mathematics)",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Kraus:1988:KBT,
author = "Sarit Kraus and Daniel Lehmann",
title = "Knowledge, belief and time",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "155--174",
month = jun,
year = "1988",
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 = "Hebrew Univ",
affiliationaddress = "Jerusalem, Isr",
classification = "723; 922; C4210 (Formal logic)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Comput. Sci., Hebrew Univ., Jerusalem,
Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Artificial Intelligence; Belief; belief; Cognitive
Systems; completeness result; decision procedure
described; Decision Procedures; Decision Theory and
Analysis; formal logic; Knowledge; knowledge; logical
system; Logical Systems; persistence; Systems Science
and Cybernetics; Time",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Lange:1988:DNR,
author = "Klaus-J{\"o}rn Lange",
title = "Decompositions of nondeterministic reductions",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "175--181",
month = jun,
year = "1988",
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 Hamburg",
affiliationaddress = "Hamburg, West Ger",
classification = "721; C4210 (Formal logic); C4220 (Automata theory)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Fachbereich Inf., Univ. Hamburg, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; automata theory; Conjuctive Turing
Reducibility; decompositions; formal language
operations; Formal Languages; formal languages;
Logarithmic Oracle Hierarchy; logarithmic space bound;
Many-One Reducibility; Nondeterministic Reductions;
nondeterministic reductions; Nonerasing Homomorphisms;
nonerasing homomorphisms; polynomial time bound; Turing
Reducibility",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Lisper:1988:SEC,
author = "Bjorn Lisper",
title = "Synthesis and equivalence of concurrent systems",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "183--199",
month = jun,
year = "1988",
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 = "Royal Inst of Technology",
affiliationaddress = "Stockholm, Swed",
classification = "722; 723; 921; C4130 (Interpolation and function
approximation); C4190 (Other numerical methods); C4290
(Other computer theory)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "NADA, R. Inst. of Technol., Stockholm, Sweden",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "cell action structure; communication structure;
Communication Structures; computational networks;
Computer Programming--Algorithms; Computer Systems,
Digital; concurrent systems; equivalence; fast Fourier
transforms; FFT algorithm; fft Algorithms; framework
for synthesis; Local Memory; local memory; Mathematical
Techniques--Algebra; Mathematical Transformations--Fast
Fourier Transforms; Parallel Processing; parallel
processing; polynomials; specification; Synchronous
Concurrent Systems; target hardware",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Metivier:1988:RSF,
author = "Y. Metivier",
title = "On recognizable subsets of free partially commutative
monoids",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "201--208",
month = jun,
year = "1988",
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 Bordeaux I",
affiliationaddress = "Talence, Fr",
classification = "721; 921; C1160 (Combinatorial mathematics); C4220
(Automata theory)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Bordeaux I Univ., Talence, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "automata theory; Automata Theory; connected
noncommutation graph; Free Partially Abelian Monoids;
free partially commutative monoids; Free Partially
Commutative Monoids; graph theory; iterative factor;
Mathematical Techniques--Graph Theory; Noncommutation
Graph; recognizable subsets; Recognizable Subsets",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Monien:1988:MCN,
author = "B. Monien and I. H. Sudborough",
title = "{Min Cut} is {NP}-complete for edge weighted trees",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "209--229",
month = jun,
year = "1988",
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 Paderborn",
affiliationaddress = "Paderborn, West Ger",
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Fachbereich Math. und Inf., Paderborn Univ., West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Complexity; Computer Metatheory; Edge Weighted Trees;
edge weighted trees; graph theory; Mathematical
Techniques; Min Cut Linear Arrangement Problem;
NP-complete; np-completeness; planar graphs; polynomial
size edge weights; progressive black white pebble
demand; search number; topological bandwidth; Trees;
trees (mathematics); vertex separation",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Pecuchet:1988:ESP,
author = "Jean-Pierre Pecuchet",
title = "Etude syntaxique des parties reconnaissables de mots
infinis. ({French}) [{Syntactic} study of rational
omega-languages of infinite words]",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "231--248",
month = jun,
year = "1988",
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 = "CNRS",
affiliationaddress = "Mont-St.-Aignan, Fr",
classification = "721; C4210 (Formal logic); C4220 (Automata theory)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "CNRS LITP, Lab. d'Inf. de Rouen, Mont-Saint-Aignan,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "automata; automata theory; Automata Theory;
Decidability; formal languages; Formal Languages;
infinite words; locally testable languages; Locally
Testable Languages; piecewise testable languages;
Piecewise Testable Languages; Rational Omega Languages;
rational omega-languages; semigroups; Semigroups;
Syntax",
language = "French",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Reed:1988:TMC,
author = "G. M. Reed and A. W. Roscoe",
title = "A timed model for communicating sequential processes",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "249--261",
month = jun,
year = "1988",
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 = "Oxford Univ",
affiliationaddress = "Oxford, Engl",
classification = "723; C4240 (Programming and algorithm theory); C6140
(Programming languages)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Oxford Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Communicating Sequential Processes; communicating
sequential processes; Computer Programming Languages;
Computer Systems, Digital--Parallel Processing;
concealment; csp; CSP; distributed computing; Models;
nondeterministic choice; parallel composition; Parallel
Languages; programming languages; programming theory;
Real Time Models; recursion; semantic models;
sequential composition; specification; time-critical
processes; timed model; timed stability model; timing
assumptions; verification",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Rosier:1988:CDF,
author = "Louis E. Rosier and Hsu-Chun Yen",
title = "On the complexity of deciding fair termination of
probabilistic concurrent finite-state programs",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "263--324",
month = jun,
year = "1988",
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 of Texas at Austin",
affiliationaddress = "Austin, TX, USA",
classification = "721; 723; 921; C4220 (Automata theory); C4240
(Programming and algorithm theory)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "alternating logspace hierarchy; Automata
Theory--Finite Automata; Complexity; complexity of
deciding; computational complexity; Computer
Metatheory--Programming Theory; Computer Programming;
EXPTIME-complete; Fair Termination; fair termination;
finite automata; Lower Bounds; Mathematical
Techniques--Graph Theory; Probabilistic Concurrent
Finite-State Programs; probabilistic concurrent
finite-state programs; programming theory;
PSPACE-complete; PTIME; Theory; Turing Machines; Upper
Bounds",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Simon:1988:IAT,
author = "Klaus Simon",
title = "An improved algorithm for transitive closure on
acyclic digraphs",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "325--346",
month = jun,
year = "1988",
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 des Saarlandes",
affiliationaddress = "Saarbruecken, West Ger",
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Angewandte Math. und Inf., Univ. des Saarlandes,
Saarbrucken, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Acyclic Digraphs; acyclic digraphs; algorithm;
Algorithms; Chain Decomposition; chain decomposition;
Computer Programming; directed graphs; Mathematical
Techniques--Graph Theory; Topological Sorting;
Transitive Closure; transitive closure; transitive
reduction; Worst Case Space; Worst Case Time;
worst-case runtime",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Stirling:1988:GOG,
author = "Colin Stirling",
title = "A generalization of {Owicki-Gries}'s {Hoare} logic for
a concurrent while language",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "347--359",
month = jun,
year = "1988",
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 of Edinburgh",
affiliationaddress = "Edinburgh, Scotl",
classification = "723; C4210 (Formal logic)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Computer Programming Languages; Computer Systems,
Digital--Parallel Processing; Concurrent While
Language; concurrent while language; first-order
formulas; formal languages; formal logic; Hoare
asserted programs; Hoare Logic; Hoare logic;
Operational Semantics; operational semantics; potential
computations; sets of invariants; syntax-directed
generalization; Theory",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Straubing:1988:SLD,
author = "Howard Straubing",
title = "Semigroups and languages of dot-depth two",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "361--378",
month = jun,
year = "1988",
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 = "Boston Coll",
affiliationaddress = "Chestnut Hill, MA, USA",
classification = "721; C4210 (Formal logic)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Comput. Sci., Boston Coll., Chestnut Hill,
MA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; Dot Depth; dot-depth two; Formal
Languages; formal languages; languages; mathematical
logic; Mathematical Logics; Semigroup Theory;
semigroups; Star Free Languages; star-free language",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Varman:1988:EPA,
author = "Peter Varman and Kshitij Doshi",
title = "An efficient parallel algorithm for updating minimum
spanning trees",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "379--397",
month = jun,
year = "1988",
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 = "Rice Univ",
affiliationaddress = "Houston, TX, USA",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C5320G
(Semiconductor storage)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Electr. and Comput. Eng., George R. Brown
Sch. of Eng., Rice Univ., Houston, TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; Computer Programming; Concurrent Read
Exclusive Write; concurrent-read-exclusive-write
parallel random access machine; graph theory;
Mathematical Techniques--Trees; Minimum Spanning Trees;
n-vertex graph; parallel algorithm; Parallel
Algorithms; parallel algorithms; Parallel Random Access
Machines (prams); random-access storage; Tree Updates;
trees (mathematics); updating minimum spanning trees",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Bosco:1988:NVS,
author = "Pier Giorgio Bosco and Elio Giovannetti and Corrado
Moiso",
title = "Narrowing vs. {SLD}-resolution",
journal = j-THEOR-COMP-SCI,
volume = "59",
number = "1--2",
pages = "3--23",
month = jul,
year = "1988",
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 = "Cent Studi e Lab Telecomunicazioni",
affiliationaddress = "Turin, Italy",
classification = "723; C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
conference = "International Joint Conference on Theory and Practice
of Software Development --- TAPSOFT '87",
conflocation = "Pisa, Italy; 23-27 March 1987",
conftitle = "International Joint Conference on Theory and Practice
of Software Development",
corpsource = "Lab. Telecommun., Turin, Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; Computer Metatheory--Programming Theory;
Computer Programming; Computer Programming
Languages--Theory; E Unification Algorithms;
E-unification; flattening; formal logic; Functional
Programming; functional programming; Logic Programming;
logic programming; narrowing; Narrowing Sequences;
narrowing sequences; programming theory; resolution
sequences; semantic unification; Semantic Unification
Algorithms; sld Resolution; SLD-resolution",
meetingaddress = "Pisa, Italy",
meetingdate = "Mar 23--27 1987",
meetingdate2 = "03/23--27/87",
pubcountry = "Netherlands",
sponsor = "Univ di Pisa, Pisa, Italy; IEI-CNR; CNUCE-CNR; EATS;
AICA",
treatment = "T Theoretical or Mathematical",
}
@Article{Boudol:1988:CA,
author = "G. Boudol and I. Castellani",
title = "Concurrency and atomicity",
journal = j-THEOR-COMP-SCI,
volume = "59",
number = "1--2",
pages = "25--84",
month = jul,
year = "1988",
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 = "INRIA Sophia-Antipolis",
affiliationaddress = "Valbonne, Fr",
classification = "723; C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
conference = "International Joint Conference on Theory and Practice
of Software Development --- TAPSOFT '87",
conflocation = "Pisa, Italy; 23-27 March 1987",
conftitle = "International Joint Conference on Theory and Practice
of Software Development",
corpsource = "INRIA Sophia-Antipolis, Valbonne, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "abstraction mechanism; atomic actions; Atomic Actions;
atomicity; bisimulation; calculus of concurrent
processes; Calculus of Concurrent Processes; Computer
Metatheory; Computer Programming Languages--Theory;
Computer Programming--Theory; concurrency; finite
computation; formal languages; Labeled Posets; labelled
poset; labelled transition relation; Operational
Semantics; parallel programming; programming theory;
Programming Theory; semantics; Semantics of
Concurrency; sequential nondeterminism; single event;
synchronization",
meetingaddress = "Pisa, Italy",
meetingdate = "Mar 23--27 1987",
meetingdate2 = "03/23--27/87",
pubcountry = "Netherlands",
sponsor = "Univ di Pisa, Pisa, Italy; IEI-CNR; CNUCE-CNR; EATS;
AICA",
treatment = "B Bibliography; T Theoretical or Mathematical",
}
@Article{Breazu-Tannen:1988:EMP,
author = "Val Breazu-Tannen and Thierry Coquand",
title = "Extensional models for polymorphism",
journal = j-THEOR-COMP-SCI,
volume = "59",
number = "1--2",
pages = "85--114",
month = jul,
year = "1988",
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 of Pennsylvania",
affiliationaddress = "Philadelphia, PA, USA",
classification = "723; C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
conference = "International Joint Conference on Theory and Practice
of Software Development --- TAPSOFT '87",
conflocation = "Pisa, Italy; 23-27 March 1987",
conftitle = "International Joint Conference on Theory and Practice
of Software Development",
corpsource = "Dept. of Comput. and Inf. Sci., Pennsylvania Univ.,
Philadelphia, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "booleans; Computer Metatheory; Computer Programming
Languages; Data Types; Extensional Models; extensional
models; formal languages; functional languages;
Girard-Reynolds polymorphic lambda calculus; object
oriented languages; Object Oriented Programming
Languages; polymorphic extensional collapse;
polymorphic integers; Polymorphic Lambda Calculus;
Polymorphism; polymorphism; programming theory;
Theory",
meetingaddress = "Pisa, Italy",
meetingdate = "Mar 23--27 1987",
meetingdate2 = "03/23--27/87",
pubcountry = "Netherlands",
sponsor = "Univ di Pisa, Pisa, Italy; IEI-CNR; CNUCE-CNR; EATS;
AICA",
treatment = "B Bibliography; T Theoretical or Mathematical",
}
@Article{Browne:1988:CFK,
author = "M. C. Browne and E. M. Clarke and O. Gr{\"u}mberg",
title = "Characterizing finite {Kripke} structures in
{Propositional Temporal Logic}",
journal = j-THEOR-COMP-SCI,
volume = "59",
number = "1--2",
pages = "115--131",
month = jul,
year = "1988",
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 = "Carnegie Mellon Univ",
affiliationaddress = "Pittsburgh, PA, USA",
classification = "723; C4210 (Formal logic)",
conference = "International Joint Conference on Theory and Practice
of Software Development --- TAPSOFT '87",
conflocation = "Pisa, Italy; 23-27 March 1987",
conftitle = "International Joint Conference on Theory and Practice
of Software Development",
corpsource = "Dept. of Comput. Sci., Carnegie Mellon Univ.,
Pittsburgh, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "bisimulation; Branching Time Logic; Branching Time
Operators; branching-time operators; Computer
Metatheory; Computer Programming--Algorithms; CTL
formula; equivalence; equivalence with respect to
stuttering; Finite Kripke Structures; finite Kripke
structures; Formal Logic; formal logic; infinite
behaviors; linear-time operators; modulo stuttering;
nexttime operator; polynomial algorithm; Propositional
Temporal Logic; propositional temporal logic; synthesis
procedures",
meetingaddress = "Pisa, Italy",
meetingdate = "Mar 23--27 1987",
meetingdate2 = "03/23--27/87",
pubcountry = "Netherlands",
sponsor = "Univ di Pisa, Pisa, Italy; IEI-CNR; CNUCE-CNR; EATS;
AICA",
treatment = "T Theoretical or Mathematical",
}
@Article{Drabent:1988:IAM,
author = "Wlodzimierz Drabent and Jan Maluszynski",
title = "Inductive assertion method for logic programs",
journal = j-THEOR-COMP-SCI,
volume = "59",
number = "1--2",
pages = "133--155",
month = jul,
year = "1988",
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 = "Polish Acad of Sciences",
affiliationaddress = "Warsaw, Pol",
classification = "723; C4240 (Programming and algorithm theory)",
conference = "International Joint Conference on Theory and Practice
of Software Development --- TAPSOFT '87",
conflocation = "Pisa, Italy; 23-27 March 1987",
conftitle = "International Joint Conference on Theory and Practice
of Software Development",
corpsource = "Inst. of Comput. Sci., Polish Acad. of Sci., Warszawa,
Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "arbitrary search strategy; Computer
Metatheory--Programming Theory; Computer Programming;
Declarative Semantics; declarative semantics;
extra-logical built-in procedures; Inductive Assertion;
inductive assertion method; informal reasoning; logic
programming; Logic Programs; logic programs;
OR-parallelism; Partial Correctness; partial
correctness; procedure calls; programming theory;
Prolog backtracking; Prolog Computation Rule; Prolog
computation rule; theorem proving; Theory",
meetingaddress = "Pisa, Italy",
meetingdate = "Mar 23--27 1987",
meetingdate2 = "03/23--27/87",
pubcountry = "Netherlands",
sponsor = "Univ di Pisa, Pisa, Italy; IEI-CNR; CNUCE-CNR; EATS;
AICA",
treatment = "T Theoretical or Mathematical",
}
@Article{Lafont:1988:LAM,
author = "Y. Lafont",
title = "The linear abstract machine",
journal = j-THEOR-COMP-SCI,
volume = "59",
number = "1--2",
pages = "157--180",
month = jul,
year = "1988",
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 = "Imperial Coll",
affiliationaddress = "London, Engl",
classification = "723; C4220 (Automata theory); C4240 (Programming and
algorithm theory); C6110 (Systems analysis and
programming)",
conference = "International Joint Conference on Theory and Practice
of Software Development --- TAPSOFT '87",
conflocation = "Pisa, Italy; 23-27 March 1987",
conftitle = "International Joint Conference on Theory and Practice
of Software Development",
corpsource = "Dept. of Comput., Imperial Coll., London, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "automata theory; clean semantics; Computer
Metatheory--Programming Theory; Computer Programming;
functional programming; Functional Programming;
implementation technique; lazy evaluation; Lazy
Evaluation; linear abstract machine; Linear Abstract
Machine; linear logic; programming; programming theory;
Semantics of Side Effects; side effects; Theory",
meetingaddress = "Pisa, Italy",
meetingdate = "Mar 23--27 1987",
meetingdate2 = "03/23--27/87",
pubcountry = "Netherlands",
sponsor = "Univ di Pisa, Pisa, Italy; IEI-CNR; CNUCE-CNR; EATS;
AICA",
treatment = "T Theoretical or Mathematical",
}
@Article{RonchiDellaRocca:1988:PTS,
author = "Simona {Ronchi Della Rocca}",
title = "Principal type scheme and unification for intersection
type discipline",
journal = j-THEOR-COMP-SCI,
volume = "59",
number = "1--2",
pages = "181--209",
month = jul,
year = "1988",
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 di Torino",
affiliationaddress = "Turin, Italy",
classification = "723; C4210 (Formal logic)",
conference = "International Joint Conference on Theory and Practice
of Software Development --- TAPSOFT '87",
conflocation = "Pisa, Italy; 23-27 March 1987",
conftitle = "International Joint Conference on Theory and Practice
of Software Development",
corpsource = "Dipartimento de Inf. Torino Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Computer Metatheory; Computer Programming Languages;
formal logic; functionality theory; Intersection Type
Discipline; intersection type discipline; lambda
-calculus; Lambda Calculus; lambda calculus; Principal
Type Scheme; principal type scheme; Theory; type
schemes; Unification; unification",
meetingaddress = "Pisa, Italy",
meetingdate = "Mar 23--27 1987",
meetingdate2 = "03/23--27/87",
pubcountry = "Netherlands",
sponsor = "Univ di Pisa, Pisa, Italy; IEI-CNR; CNUCE-CNR; EATS;
AICA",
treatment = "T Theoretical or Mathematical",
}
@Article{Hesselink:1988:IRU,
author = "Wim H. Hesselink",
title = "Interpretations of recursion under unbounded
nondeterminacy",
journal = j-THEOR-COMP-SCI,
volume = "59",
number = "3",
pages = "211--234",
month = aug,
year = "1988",
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 = "Groningen Univ",
affiliationaddress = "Groningen, Neth",
classification = "723; C6120 (File organisation); C6140 (Programming
languages)",
corpsource = "Dept. of Math. and Comput. Sci., Groningen Univ.,
Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "alternatives; arbitrary atomic statements;
composition; Computer Metatheory; Computer Programming
Languages; data structures; Egli-Milner Ordering;
Egli-Milner ordering; mutual recursion; preparator
functions; programming languages; Recursion; recursion
interpretation; Semantics; Theory; Unbounded
Nondeterminacy; unbounded nondeterminacy; Weakest
Liberal Precondition; weakest precondition; Weakest
Precondition",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{Hesselink:1988:DFM,
author = "Wim H. Hesselink",
title = "Deadlock and fairness in morphisms of transition
systems",
journal = j-THEOR-COMP-SCI,
volume = "59",
number = "3",
pages = "235--257",
month = aug,
year = "1988",
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 = "Groningen Univ",
affiliationaddress = "Groningen, Neth",
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math. and Comput. Sci., Groningen Univ.,
Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "bisimilar processes; Computer Metatheory; Computer
Programming Languages; deadlock; execution sequence;
Fair Communicating Merge; fairness; image sequence;
morphisms; Morphisms; programming theory; Theory;
Transition Systems; transition systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hodel:1988:ODE,
author = "A. Scottedward Hodel and Michael C. Loui",
title = "Optimal dynamic embedding of {$X$}-trees into arrays",
journal = j-THEOR-COMP-SCI,
volume = "59",
number = "3",
pages = "259--276",
month = aug,
year = "1988",
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 of Illinois at Urbana-Champaign",
affiliationaddress = "Urbana, IL, USA",
classification = "721; 723; 921; C1160 (Combinatorial mathematics);
C6120 (File organisation)",
corpsource = "Dept. of Electr. and Comput. Eng., Illinois Univ.,
Urbana-Champaign, IL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Arrays; Automata Theory; d-dimensional array; Data
Processing; data structures; File Organization;
multihead bounded activity machine; Optimal Dynamic
Embedding; optimal dynamic embedding; Optimization;
Space Complexity; storage medium; trees (mathematics);
X-Trees; X-trees",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Kalorkoti:1988:TIM,
author = "K. Kalorkoti",
title = "The trace invariant and matrix inversion",
journal = j-THEOR-COMP-SCI,
volume = "59",
number = "3",
pages = "277--286",
month = aug,
year = "1988",
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 of Edinburgh",
affiliationaddress = "Edinburgh, Scotl",
classification = "723; 921; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; Computational Complexity; computational
complexity; Computer Programming; Computer Systems,
Digital--Parallel Processing; Mathematical
Techniques--Matrix Algebra; matrix inversion; matrix
multiplication; nonscalar complexity measure; Parallel
Algorithms; parallel computations; straight-line model;
Trace Invariant; trace invariant",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Schmidt-Schauss:1988:ICU,
author = "Manfred Schmidt-Schauss",
title = "Implication of clauses is undecidable",
journal = j-THEOR-COMP-SCI,
volume = "59",
number = "3",
pages = "287--296",
month = aug,
year = "1988",
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 Kaiserslautern",
affiliationaddress = "Kaiserslautern, West Ger",
classification = "723; C4210 (Formal logic)",
corpsource = "Dept. of Comput. Sci., Kaiserslautern Univ., West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Artificial Intelligence; Automated Deduction Systems;
Automatic Theorem Proving; clause sets; clauses
implication; Computer Metatheory; decidability;
decision problem; finitely generated stable transitive
relations; Implication of Clauses; Undecidability;
undecidable",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Rytter:1988:EPC,
author = "Wojciech Rytter",
title = "On efficient parallel computations for some dynamic
programming problems",
journal = j-THEOR-COMP-SCI,
volume = "59",
number = "3",
pages = "297--307",
month = aug,
year = "1988",
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 = "Warsaw Univ",
affiliationaddress = "Warsaw, Pol",
classification = "921; C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C4240 (Programming and
algorithm theory); C5320G (Semiconductor storage)",
corpsource = "Inst. of Inf., Warsaw Univ., Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Binary Tree Search; Computer Programming--Algorithms;
Computer Systems, Digital--Parallel Processing; CREW
P-RAM; cube-connected computer; dynamic programming;
dynamic programming problems; Mathematical Programming,
Dynamic; Matrix Multiplication; optimal binary search
tree; optimal order; optimal triangulation of polygons;
Parallel Algorithms; parallel algorithms; parallel
computations; parallel random-access machine; parsing;
perfect shuffle computer; Polygon Triangularization;
random-access storage; straight-line programs; trees
(mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Engelfriet:1988:NBN,
author = "Joost Engelfriet and George Leih",
title = "Nonterminal bounded {NLC} graph grammars",
journal = j-THEOR-COMP-SCI,
volume = "59",
number = "3",
pages = "309--315",
month = aug,
year = "1988",
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 of Leiden",
affiliationaddress = "Leiden, Neth",
classification = "721; C1160 (Combinatorial mathematics); C4210
(Formal logic)",
corpsource = "Dept. of Comput. Sci., Leiden Univ., Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; formal languages; Grammars; grammars;
graph languages; graph theory; linear graph grammar;
nce Graph Grammars; neighbourhood controlled embedding;
nlc Graph Grammars; node label controlled graph
grammars; nonterminal bounded; Nonterminal Bounded
Grammars",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Stoughton:1988:SR,
author = "Allen Stoughton",
title = "Substitution revisited",
journal = j-THEOR-COMP-SCI,
volume = "59",
number = "3",
pages = "317--325",
month = aug,
year = "1988",
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 of Sussex",
affiliationaddress = "Brighton, Engl",
classification = "723; C4210 (Formal logic)",
corpsource = "Sch. of Math. and Phys. Sci., Sussex Univ., Brighton,
UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Alpha Congruence; Computer Metatheory; Computer
Programming Languages; Denotational Semantics; formal
languages; formal logic; induction-free proofs; lambda
calculus; Lambda Calculus; Simultaneous Substitution;
simultaneous substitution; structural induction;
Substitution Lemma; Theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Aalbersberg:1988:TT,
author = "I. J. Aalbersberg and G. Rozenberg",
title = "Theory of traces",
journal = j-THEOR-COMP-SCI,
volume = "60",
number = "1",
pages = "1--82",
month = mar,
year = "1988",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Leiden Univ., Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "behavior; concurrent systems; directed graphs; formal
string language theory; labeled acyclic directed
graphs; labeled partial orders; mathematical
description; nonsequential nature of causality;
parallel programming; partial commutativity; Petri
nets; programming theory; sequential nature of
observations; system behavior; theory of traces",
pubcountry = "Netherlands A01",
treatment = "B Bibliography; T Theoretical or Mathematical",
}
@Article{Tiuryn:1988:SRB,
author = "J. Tiuryn and P. Urzyczyn",
title = "Some relationships between logics of programs and
complexity theory",
journal = j-THEOR-COMP-SCI,
volume = "60",
number = "1",
pages = "83--108",
month = mar,
year = "1988",
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); C4240 (Programming and
algorithm theory)",
corpsource = "Inst. of Math., Warsaw Univ., Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arrays; comparative schematology; complexity theory;
computational complexity; computational power;
flow-diagrams; formal logic; logics; programming
theory; recursive procedures",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}
@Article{America:1988:DES,
author = "P. America and J. {De Bakker}",
title = "Designing equivalent semantic models for process
creation",
journal = j-THEOR-COMP-SCI,
volume = "60",
number = "2",
pages = "109--176",
month = sep,
year = "1988",
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)",
corpsource = "Philips Res. Labs., Eindhoven, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "denotational semantic; formal languages; languages;
metric structures; operational semantics; parallel
object-oriented languages; POOL; process creation;
semantic models",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Roscoe:1988:LOP,
author = "A. W. Roscoe and C. A. R. Hoare",
title = "The laws of occam programming",
journal = j-THEOR-COMP-SCI,
volume = "60",
number = "2",
pages = "177--229",
month = sep,
year = "1988",
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 = "C4240 (Programming and algorithm theory); C6140D
(High level languages)",
corpsource = "Comput. Lab., Oxford Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic laws; high level languages; normal form;
occam; occam programming; programming theory;
semantics; WHILE- free programs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Eilam-Tzoreff:1988:MPS,
author = "Tali Eilam-Tzoreff and Uzi Vishkin",
title = "Matching patterns in strings subject to multi-linear
transformations",
journal = j-THEOR-COMP-SCI,
volume = "60",
number = "3",
pages = "231--254",
month = dec,
year = "1988",
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 = "Tel Aviv Univ",
affiliationaddress = "Tel Aviv, Isr",
classification = "723; C4200 (Computer theory)",
corpsource = "Dept. of Comput. Sci., Sch. of Math. Sci., Tel Aviv
Univ., Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; computation theory; Computer Metatheory;
Computer Programming; Minimum Distance Problems;
multi-linear transformations; Multilinear
Transformations; pattern matching; Pattern Matching;
pattern recognition; strings; Strings of Real Numbers",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Duval:1988:GSC,
author = "Jean-Pierre Duval",
title = "{G}{\'e}n{\'e}ration d'une section des classes de
conjugaison et arbre des mots de {Lyndon} de longueur
born{\'e}e. ({French}) [{Generation} of a section of
conjugation classes and tree of {Lyndon} words of
limited length]",
journal = j-THEOR-COMP-SCI,
volume = "60",
number = "3",
pages = "255--283",
month = dec,
year = "1988",
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 Rouen",
affiliationaddress = "Mont-St.-Aignan, Fr",
classification = "723; C4210 (Formal logic)",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Computer Metatheory; Computer Programming--Algorithms;
conjugation class; Conjugation Classes; formal
languages; lexicographical ordering; Lexicographical
Ordering; linear time; Lyndon word; Lyndon Words;
ordered alphabet; primitive word",
language = "French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Carpi:1988:SUA,
author = "Arturo Carpi",
title = "On synchronizing unambiguous automata",
journal = j-THEOR-COMP-SCI,
volume = "60",
number = "3",
pages = "285--296",
month = dec,
year = "1988",
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 di Napoli",
affiliationaddress = "Naples, Italy",
classification = "721; C4220 (Automata theory)",
corpsource = "Dipartimento di Matematica e Applicazioni, Naples
Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; automata theory; polynomial upper
bound; Polynomial Upper Bounds; Shortest Word of
Minimal Rank; synchronizing; Synchronizing Pairs;
Synchronizing Unambiguous Automata; transition monoid;
unambiguous automata; Unambiguous Relations",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Beeson:1988:TCS,
author = "Michael J. Beeson",
title = "Towards a computation system based on set theory",
journal = j-THEOR-COMP-SCI,
volume = "60",
number = "3",
pages = "297--340",
month = dec,
year = "1988",
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 = "San Jose State Univ",
affiliationaddress = "San Jose, CA, USA",
classification = "723; 921; C1160 (Combinatorial mathematics); C4200
(Computer theory)",
corpsource = "Dept. of Math. and Comput. Sci., San Jose State Univ.,
CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "axiomatic theory; computation system; Computation
Systems; computation theory; Computer Metatheory;
Computer Programming Languages; Data Processing--Data
Structures; data structures; denotational semantics;
Lambda Calculus; Mathematical Techniques--Set Theory;
polymorphic set theory; recursion-theoretic model;
recursive operations; set theory; set-theoretic model;
Theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Spehner:1988:RFL,
author = "Jean-Claude Spehner",
title = "La reconnaissance des facteurs d'un langage fini dans
un texte en temps lin{\'e}aire. ({French}) [{The}
recognition of the factors of a finite language in a
text in linear time]",
journal = j-THEOR-COMP-SCI,
volume = "60",
number = "3",
pages = "341--381",
month = dec,
year = "1988",
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 Haute Alsace",
affiliationaddress = "Mulhouse, Fr",
classification = "721; 723; C4210 (Formal logic); C4220 (Automata
theory)",
corpsource = "Dept. de Math. et Informatique, Fac. des Sci. et
Tech., Univ. de Haute Alsace, Mulhouse, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "automata theory; Automata Theory; Computer
Programming--Algorithms; Factor Transducers; family of
identifiers; finite language; Finite Languages; formal
languages; Formal Languages; Language Factors; partial
automaton; transducer",
language = "French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Shallit:1988:GAS,
author = "J. Shallit",
title = "A generalization of automatic sequences",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "1",
pages = "1--16",
month = oct,
year = "1988",
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 = "C4220 (Automata theory)",
corpsource = "Dept. of Math. and Comput. Sci., Dartmouth Coll.,
Hanover, NH, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic equation; automatic sequences; finite
automata; finite automation; generalization; infinite
Fibonacci word; k-uniform homomorphisms; uniform tag
sequences",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Domosi:1988:CCP,
author = "P. Domosi and Z. Esik",
title = "Critical classes for the $\alpha_0$-product",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "1",
pages = "17--24",
month = oct,
year = "1988",
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)",
corpsource = "Inst. of Math., Lajos Kossuth Univ., Debrecen,
Hungary",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alpha /sub 0/-product; automata; automata theory;
completeness; counters; Krohn-Rhodes Decomposition
Theorem; necessary conditions; two-state reset
automaton",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Meznik:1988:SIR,
author = "I. Meznik",
title = "On a subclass of infinity -regular languages",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "1",
pages = "25--32",
month = oct,
year = "1988",
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)",
corpsource = "Dept. of Math., Turku Univ., Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic version; finite sequences; formal
languages; G- machines; G-languages; infinite
sequences; infinity -regular languages; subclass",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{He:1988:NOP,
author = "Xin He",
title = "A nearly optimal parallel algorithm for constructing
maximal independent set in planar graphs",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "1",
pages = "33--47",
month = oct,
year = "1988",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ.,
Columbus, OH, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "graph theory; maximal independent set; nearly optimal
parallel algorithm; parallel algorithms; planar graphs;
PRAM; subroutine",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Seger:1988:OTS,
author = "C.-J. Seger and J. A. Brzozowski",
title = "An optimistic ternary simulation of gate races",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "1",
pages = "49--66",
month = oct,
year = "1988",
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 = "B1265B (Logic circuits); C5210B (Computer-aided
logic design)C4210 (Formal logic)",
corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "almost-equal-delay race model; critical races; digital
networks; gate races; hazards; logic CAD; optimistic
ternary simulation; ternary logic; ternary model;
timing problems",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{vandenBroek:1988:CTG,
author = "P. M. {van den Broek}",
title = "Comparison of two graph-rewrite systems",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "1",
pages = "67--81",
month = oct,
year = "1988",
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)",
corpsource = "Dept. of Inf., Twente Univ., Enschede, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "common domain; graph-rewrite systems; rewriting
systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Thatte:1988:IFO,
author = "S. Thatte",
title = "Implementing first-order rewriting with constructor
systems",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "1",
pages = "83--92",
month = oct,
year = "1988",
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)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Michigan
Univ., Ann Arbor, MI, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arbitrary call-by-value confluent systems; canonical
systems; constructor systems; defining characteristics;
first-order rewriting; rewriting systems; semiregular
systems; translation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Cori:1988:AA,
author = "R. Cori and E. Sopena and M. Latteux and Y. Roos",
title = "2-asynchronous automata",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "1",
pages = "93--102",
month = oct,
year = "1988",
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 = "C4220 (Automata theory)",
corpsource = "Lab. de Math. et Inf., Bordeaux I Univ., Talence,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "2-asynchronous automata; communication problem;
concurrent processes; finite automata; mailboxes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Book:1988:SGC,
author = "Ronald V. Book and Ding-Zhu Du",
title = "The structure of generalized complexity cores",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "2--3",
pages = "103--119",
month = nov,
year = "1988",
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 of California",
affiliationaddress = "Santa Barbara, CA, USA",
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math., California Univ., Santa Barbara, CA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "C-levelable; computational complexity; Computer
Metatheory; countable class; finite union; finite
variation; Generalized Complexity Cores; generalized
complexity cores; Proper Hard Cores; Recursive Sets;
Sets of Strings; Structural Properties; structure",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Dahlhaus:1988:PCP,
author = "Elias Dahlhaus and Marek Karpinski",
title = "Parallel construction of perfect matchings and
{Hamiltonian} cycles on dense graphs",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "2--3",
pages = "121--136",
month = nov,
year = "1988",
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 of Bonn",
affiliationaddress = "Bonn, West Ger",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C5320G
(Semiconductor storage)",
corpsource = "Dept. of Comput. Sci., Bonn Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; communications; Computer Programming;
Computer Systems, Digital--Parallel Processing;
Concurrent Read-Exclusive Write; CREW-PRAM; dense graph
combinatorics; dense graphs; Dense Graphs; distributed
algorithms; graph theory; Hamiltonian cycles;
Hamiltonian Cycles; Mathematical Techniques--Graph
Theory; parallel algorithms; Parallel Algorithms;
parallel algorithms; parallel construction; Parallel
Random Access Machines; perfect matchings; Perfect
Matchings; random-access storage; routing",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Moriya:1988:ACA,
author = "Tetsuo Moriya and Hideki Yamasaki",
title = "Accepting conditions for automata on
$\omega$-languages",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "2--3",
pages = "137--147",
month = nov,
year = "1988",
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 = "Kokushikan Univ",
affiliationaddress = "Tokyo, Jpn",
classification = "721; C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Center for Inf. Sci., Kokushikan Univ., Tokyo, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Accepting Conditions; Automata Theory; conditions
acceptance; finite automata; Finite Automata; finite
automata; formal languages; Inclusion Relations;
Nondeterministic Finite Automata; omega-languages;
Omega-Languages; Omega-Regular Languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{King:1988:AMF,
author = "K. N. King",
title = "Alternating multihead finite automata",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "2--3",
pages = "149--174",
month = nov,
year = "1988",
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 = "Georgia State Univ",
affiliationaddress = "Atlanta, GA, USA",
classification = "721; C4220 (Automata theory)",
corpsource = "Dept. of Math. and Comput. Sci., Georgia State Univ.,
Atlanta, GA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "alternating multihead finite automata; Alternating
Multihead Finite Automata; alternating Turing machine
model; Alternating Turing Machine Model; Automata
Theory; Deterministic Multihead Finite Automata; finite
automata; Finite Automata; languages; Nondeterministic
Multihead Finite Automata; Pushdown Automata; upper
bounds",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{DiBattista:1988:APR,
author = "Giuseppe {Di Battista} and Roberto Tamassia",
title = "Algorithms for plane representations of acyclic
digraphs",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "2--3",
pages = "175--198",
month = nov,
year = "1988",
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 of Rome 'La Sapienza'",
affiliationaddress = "Rome, Italy",
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dipartimento di Inf. e Sistemistica, Rome Univ.,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Acyclic Digraphs; acyclic digraphs; Algorithms;
Computer Programming; Digraphs of Lattices; directed
graphs; family trees; Graph Algorithms; Grid Drawings;
grid drawings; Hasse diagrams; hierarchical structures;
ISA hierarchies; knowledge representation diagrams;
Mathematical Techniques--Graph Theory; organization
charts; PERT networks; plane representations; straight
drawings; Straight Drawings; subroutine-call graphs;
time complexity; trees (mathematics); Visibility
Representations; visibility representations",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Gischer:1988:ETP,
author = "Jay L. Gischer",
title = "The equational theory of pomsets",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "2--3",
pages = "199--224",
month = nov,
year = "1988",
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 = "Coll of William \& Mary",
affiliationaddress = "Williamsburg, VA, USA",
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Coll. of William and Mary,
Williamsburg, VA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "algebraic properties; Axiomatic Properties; axiomatic
properties; closure operations; Computer Metatheory;
Computer Systems, Digital--Parallel Processing;
concatenation; equational theory; Equational Theory of
Pomsets; generalization of strings; Ideals of Pomsets;
model of concurrency; parallel composition; Partial
Orders; pomsets; programming theory; Semantics of
Parallel Programs; Sets of Pomsets; theory of
languages; union",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Alexi:1988:EVP,
author = "Werner Alexi",
title = "Extraction and verification of programs by analysis of
formal proofs",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "2--3",
pages = "225--258",
month = nov,
year = "1988",
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,
classification = "723; C4240 (Programming and algorithm theory);
C6150G (Diagnostic, testing, debugging and evaluating
systems)",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "analysis of formal proofs; Computer
Metatheory--Programming Theory; Computer Programming;
constructions of objects; Correctness; correctness;
Formal Proofs; graphs; mathematical tool; program
statements; Program Synthesis Algorithm; Program
Verification; program verification; programming theory;
programs extraction; programs verification; symbols;
termination; Termination; Theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Gargov:1988:DLC,
author = "George Gargov and Solomon Passy",
title = "Determinism and looping in combinatory {PDL}",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "2--3",
pages = "259--277",
month = nov,
year = "1988",
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 = "Sofia Univ",
affiliationaddress = "Sofia, Bulg",
classification = "723; C4240 (Programming and algorithm theory); C6110
(Systems analysis and programming)",
corpsource = "Fac. of Math., Sofia Univ., Bulgaria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "atomic formulae; combinatory PDL; Combinatory pdl;
Computer Metatheory--Programming Theory; Computer
Programming; CPDL; decidability; Determinism;
finite-model property results; Infinite Repeating
Construct; logic programming; Looping; programming
theory; propositional dynamic logic; Propositional
Modal Logics of Programs; propositional modal logics of
programs; Theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Staiger:1988:SEU,
author = "Ludwig Staiger",
title = "{Ein Satz {\"u}ber die Entropie von Untermonoiden}.
({German}) [{A} theorem on the entropy of submonoids]",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "2--3",
pages = "279--282",
month = nov,
year = "1988",
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 = "Akad der Wissenschaften",
affiliationaddress = "Berlin, West Ger",
classification = "721; C4210 (Formal logic)",
corpsource = "Karl-Weierstrass-Inst. fur Math., Akad. der
Wissenschaften, Berlin, East Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; entropy of submonoids; Entropy of
Submonoids; Finite Alphabets; formal languages; Formal
Languages; language; radius of convergence; structure
generating function; theorem",
language = "German",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kretschmer:1988:CPR,
author = "Thomas Kretschmer",
title = "A closure property of regular languages",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "2--3",
pages = "283--287",
month = nov,
year = "1988",
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 des Saarlandes",
affiliationaddress = "Saarbruecken, West Ger",
classification = "721; C4210 (Formal logic)",
corpsource = "Univ. des Saarlandes Fachbereich Inf., Saarbrucken,
West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; Closure Property; closure property;
formal languages; Formal Languages; Inverse Image;
inverse image; Powerset; regular languages; Regular
Languages; semigroup homomorphism; Semigroup
Homomorphism",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Arnold:1988:LDF,
author = "Andre Arnold",
title = "Logical definability of fixed points",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "2--3",
pages = "289--297",
month = nov,
year = "1988",
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 Bordeaux I",
affiliationaddress = "Talence, Fr",
classification = "721; 921; C4210 (Formal logic); C4220 (Automata
theory)",
corpsource = "Lab. d'Inf., Bordeaux Univ., Talence, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "automata; automata theory; Automata Theory;
decidability; Fixed Points; least fixed points; Logical
Definability; Mathematical Techniques--Trees; Monotonic
Functions; monotonic functions; Tree Automata; trees",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Belaga:1988:BMR,
author = "Edward G. Belaga",
title = "Bilinear mincing rank",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "2--3",
pages = "299--306",
month = nov,
year = "1988",
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 = "CNRS",
affiliationaddress = "Strasbourg, Fr",
classification = "921; C4240 (Programming and algorithm theory)",
corpsource = "IRMA-CNRS Univ. Louis Pasteur, Strasbourg, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Bilinear Circuit-Size Complexity; bilinear
circuit-size complexity; bilinear form; Bilinear Form;
Bilinear Mincing Rank; bilinear mincing rank;
characteristic zero; computational complexity; lower
bound; Lower Bounds; Mathematical Techniques",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Megiddo:1988:FMD,
author = "Nimrod Megiddo and Uzi Vishkin",
title = "On finding a minimum dominating set in a tournament",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "2--3",
pages = "307--316",
month = nov,
year = "1988",
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 = "IBM",
affiliationaddress = "San Jose, CA, USA",
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "IBM Almaden Res. Center, San Jose, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; Boolean Formulas; boolean formulas;
Computer Programming; conjunctive normal form; directed
graph; directed graphs; Mathematical Techniques--Set
Theory; Minimum Dominating Set; minimum dominating set;
polynomial-time algorithm; Polynomial-Time Algorithm;
polynomial-time algorithm; Satisfiability Problem;
satisfiability problem; tournament; Tournament",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kennaway:1988:GR,
author = "R. Kennaway",
title = "On 'On graph rewritings'",
journal = j-THEOR-COMP-SCI,
volume = "61",
number = "2--3",
pages = "317--320",
month = nov,
year = "1988",
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 = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Sch. of Inf. Syst., East Anglia Univ., Norwich, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "graph rewritings; graph theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Abiteboul:1988:RHD,
author = "Serge Abiteboul and R. Hull",
title = "Restructuring hierarchical database objects",
journal = j-THEOR-COMP-SCI,
volume = "62",
number = "1--2",
pages = "3--38",
month = dec,
year = "1988",
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 = "INRIA",
affiliationaddress = "Le Chesnay, Fr",
classification = "723; C4250 (Database theory); C6160 (Database
management systems (DBMS))",
conference = "Selected Papers presented at the First International
Conference on Database Theory",
corpsource = "INRIA, Le Chesnay, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Complex Objects; Data Processing--Data Structures;
data structures; database management systems; Database
Systems; database systems; database theory;
Hierarchical Data Structures; hierarchical database
objects; Hierarchical Database Objects; hierarchical
structures; Office Automation; Office Information
Systems; Rewrite Operations; rewrite rules; structural
transformations; Theory",
meetingaddress = "Rome, Italy",
meetingdate = "Sep 1986",
meetingdate2 = "09/86",
pubcountry = "Netherlands",
sponsor = "European Assoc for Theoretical Computer Science",
treatment = "T Theoretical or Mathematical",
}
@Article{Atzeni:1988:SCI,
author = "Paolo Atzeni and D. Stott Parker",
title = "Set containment inference and syllogisms",
journal = j-THEOR-COMP-SCI,
volume = "62",
number = "1--2",
pages = "39--65",
month = dec,
year = "1988",
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 = "CNR",
affiliationaddress = "Rome, Italy",
classification = "723; C4210 (Formal logic); C6170 (Expert systems)",
conference = "Selected Papers presented at the First International
Conference on Database Theory",
corpsource = "IASI-CNR, Roma, Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Computer Metatheory--Formal Logic; consistency;
containment statements; Database Systems; formal
languages; formal logic; inference; intractability;
knowledge representation; Knowledge Representation;
negative information; Set Containment Inference;
Syllogisms; syllogisms; Theory; Type Hierarchies; Type
Inclusion Inference",
meetingaddress = "Rome, Italy",
meetingdate = "Sep 1986",
meetingdate2 = "09/86",
pubcountry = "Netherlands",
sponsor = "European Assoc for Theoretical Computer Science",
treatment = "T Theoretical or Mathematical",
}
@Article{Chan:1988:DAB,
author = "Edward P. F. Chan and Hector J. Hernandez",
title = "On the desirability of $\gamma$-acyclic {BCNF}
database schemes",
journal = j-THEOR-COMP-SCI,
volume = "62",
number = "1--2",
pages = "67--104",
month = dec,
year = "1988",
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 of Alberta",
affiliationaddress = "Edmonton, Alberta, Can",
classification = "723; C4250 (Database theory)",
conference = "Selected Papers presented at the First International
Conference on Database Theory",
corpsource = "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.,
Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Bounded Database Schemes; Boyce-Codd Normal Form
Database Schemes; Computer Programming--Algorithms;
connection-trap-free; Database Systems; database
theory; desirability; functional dependencies;
Functional Dependencies; gamma -acyclic BCNE database
schemes; Query Processing; query processing;
Relational; representative instance; semantics;
Updates; updates; X- total projection",
meetingaddress = "Rome, Italy",
meetingdate = "Sep 1986",
meetingdate2 = "09/86",
pubcountry = "Netherlands",
sponsor = "European Assoc for Theoretical Computer Science",
treatment = "T Theoretical or Mathematical",
}
@Article{Lakshmanan:1988:SFM,
author = "V. S. Lakshmanan",
title = "Split-freedom and {MVD}-intersection: {A} new
characterization of multivalued dependencies having
conflict-free covers",
journal = j-THEOR-COMP-SCI,
volume = "62",
number = "1--2",
pages = "105--122",
month = dec,
year = "1988",
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 = "Indian Inst of Science",
affiliationaddress = "Bangalore, India",
classification = "723; C4250 (Database theory); C6160D (Relational
DBMS)",
conference = "Selected Papers presented at the First International
Conference on Database Theory",
corpsource = "Dept. of Comput. Sci. and Autom., Indian Inst. of
Sci., Bangalore, India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Computer Programming--Algorithms; conflict-free
covers; Database Systems; database theory; multivalued
dependencies; Multivalued Dependencies;
MVD-intersection; Polynomial Time Algorithms;
Relational; relational databases; Split Free Sets;
split-free sets",
meetingaddress = "Rome, Italy",
meetingdate = "Sep 1986",
meetingdate2 = "09/86",
pubcountry = "Netherlands",
sponsor = "European Assoc for Theoretical Computer Science",
treatment = "T Theoretical or Mathematical",
}
@Article{Lynch:1988:ITN,
author = "Nancy Lynch and Michael Merritt",
title = "Introduction to the theory of nested transactions",
journal = j-THEOR-COMP-SCI,
volume = "62",
number = "1--2",
pages = "123--185",
month = dec,
year = "1988",
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 = "MIT",
affiliationaddress = "Cambridge, MA, USA",
classification = "721; 723; C4220 (Automata theory); C4240
(Programming and algorithm theory)",
conference = "Selected Papers presented at the First International
Conference on Database Theory",
corpsource = "MIT, Cambridge, MA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; automata theory; Computer
Programming--Algorithms; Concurrency; concurrency;
concurrency control; correctness; Database Systems;
locking algorithm; Locking Algorithms; nested
transactions; Nested Transactions; Resiliency;
resiliency properties; Theory; transaction processing",
meetingaddress = "Rome, Italy",
meetingdate = "Sep 1986",
meetingdate2 = "09/86",
pubcountry = "Netherlands",
sponsor = "European Assoc for Theoretical Computer Science",
treatment = "T Theoretical or Mathematical",
}
@Article{Sacca:1988:GCM,
author = "Domenico Sacca and Carlo Zaniolo",
title = "The generalized counting method for recursive logic
queries",
journal = j-THEOR-COMP-SCI,
volume = "62",
number = "1--2",
pages = "187--220",
month = dec,
year = "1988",
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 della Calabria",
affiliationaddress = "Rende, Italy",
classification = "723; C4250 (Database theory); C6160 (Database
management systems (DBMS)); C6170 (Expert systems)",
conference = "Selected Papers presented at the First International
Conference on Database Theory",
corpsource = "Dipartimento di Sistemi, Univ. della Calabria, Rende,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Artificial Intelligence; backward chaining;
binding-passing behavior; Database Systems; database
theory; Fixpoint Computations; forward chaining;
Forward Chaining; function symbols; Generalized
Counting Method; generalized counting method; Horn
Clauses; Horn clauses queries; Logic Programming; logic
programming; query languages; recursive logic queries;
Recursive Logic Queries; safety; termination; Theory",
meetingaddress = "Rome, Italy",
meetingdate = "Sep 1986",
meetingdate2 = "09/86",
pubcountry = "Netherlands",
sponsor = "European Assoc for Theoretical Computer Science",
treatment = "P Practical",
}
@Article{vanGucht:1988:IFM,
author = "Dirk {van Gucht}",
title = "Interaction-free multivalued dependency sets",
journal = j-THEOR-COMP-SCI,
volume = "62",
number = "1--2",
pages = "221--233",
month = dec,
year = "1988",
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 = "Indiana Univ",
affiliationaddress = "Bloomington, IN, USA",
classification = "723; 921; C4250 (Database theory)",
conference = "Selected Papers presented at the First International
Conference on Database Theory",
corpsource = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Acyclic Join Dependencies; acyclic join dependency;
conflict-free MVD set; database design problems;
Database Systems; database theory; dependency theory;
Interaction Free Multivalued Dependency Sets;
interaction-free MVD set; join dependencies;
Mathematical Techniques--Set Theory; Multivalued
Dependencies; set theory; syntactic characterization;
Theory",
meetingaddress = "Rome, Italy",
meetingdate = "Sep 1986",
meetingdate2 = "09/86",
pubcountry = "Netherlands",
sponsor = "European Assoc for Theoretical Computer Science",
treatment = "T Theoretical or Mathematical",
}
@Article{Geffert:1988:RRE,
author = "Viliam Geffert",
title = "A representation of a recursively enumerable languages
by two homomorphisms and a quotient",
journal = j-THEOR-COMP-SCI,
volume = "62",
number = "3",
pages = "235--249",
month = dec,
year = "1988",
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 of P. J. Safarik",
affiliationaddress = "Kosice, Czech",
classification = "721; 921; C4210 (Formal logic)",
corpsource = "Dept. of Comput. Sci., Univ. of P. J. Safarik, Kosice,
Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; Formal Languages; formal languages;
Homomorphisms; homomorphisms; Mathematical
Techniques--Set Theory; quotient; Quotient Operation;
Recursively Enumerable Languages; recursively
enumerable languages; Right Overflow Languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
xxtitle = "Representation of a recursively enumerable languages
by two homomorphisms and a quotient",
xxtitle = "A presentation of a recursively enumerable languages
by two homomorphisms and a quotient",
}
@Article{Rao:1988:ACA,
author = "Nageswara S. V. Rao and S. S. Iyengar and R. L.
Kashyap",
title = "An average-case analysis of {MAT} and inverted file",
journal = j-THEOR-COMP-SCI,
volume = "62",
number = "3",
pages = "251--266",
month = dec,
year = "1988",
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 = "Louisiana State Univ",
affiliationaddress = "Baton Rouge, LA, USA",
classification = "723; 903; 921; 922; C6120 (File organisation); C6160
(Database management systems (DBMS))",
corpsource = "Dept. of Comput. Sci., Louisiana State Univ., Baton
Rouge, LA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "average-case analysis; Data Processing; data space;
data structures; database management systems; Database
Systems; file organisation; File Organization;
Information Science--Information Retrieval; inverted
file; Inverted Files; MAT; Mathematical
Techniques--Trees; multiple attribute tree; Multiple
Attribute Trees; Partial Match Queries; partial-match
queries; Probability; trees (mathematics); uniform
probabilistic model; Worst Case Complexity; worst-case
complexities",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Salomaa:1988:PRC,
author = "Kai Salomaa",
title = "A pumping result for $2$-context-free languages",
journal = j-THEOR-COMP-SCI,
volume = "62",
number = "3",
pages = "267--287",
month = dec,
year = "1988",
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 of Turku",
affiliationaddress = "Turku, Finl",
classification = "721; C4210 (Formal logic)",
corpsource = "Dept. of Math., Turku Univ., Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "2-Context-Free Languages; 2-context-free languages;
Automata Theory; Context Free Languages; context-free
grammars; context-free languages; K-Context-Free
Languages; k-parallel derivations; Pattern Selectors;
Pumping Properties; pumping result; Scheduling--Theory;
Selector Languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Zeugmann:1988:PRO,
author = "Thomas Zeugmann",
title = "On the Power of Recursive Optimizers",
journal = j-THEOR-COMP-SCI,
volume = "62",
number = "3",
pages = "289--310",
month = dec,
year = "1988",
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;
ftp://ftp.math.utah.edu/pub/bibnet/authors/z/zeugmann-thomas-u.bib;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Humboldt Univ Berlin",
affiliationaddress = "Berlin, East Ger",
classification = "723; C4210 (Formal logic)",
corpsource = "Dept. of Math., Humboldt Univ., Berlin, East Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "arbitrary program; Computer Metatheory; Computer
Programming--Theory; Existence Problem; fastest
programs; Inductive Inference; power; Program
Synthesis; Programming Theory; recursive functions;
recursive optimizers; Recursive Optimizers",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Buss:1988:RPG,
author = "Samuel R. Buss and Gyorgy Turan",
title = "Resolution proofs on generalized pigeonhole
principles",
journal = j-THEOR-COMP-SCI,
volume = "62",
number = "3",
pages = "311--317",
month = dec,
year = "1988",
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 of California",
affiliationaddress = "San Diego, CA, USA",
classification = "723; C4200 (Computer theory)",
corpsource = "Dept. of Math., California Univ., San Diego, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "computation theory; Computer Metatheory;
constant-formula-depth Frege proof systems; encoding;
exponential lower bound; Exponential Lower Bounds;
Frege Proof Systems; Generalized Pigeonhole Principles;
generalized pigeonhole principles; propositional
formulas; Propositional Formulas; resolution proofs;
Resolution Proofs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
xxtitle = "Resolution proofs of generalized pigeonhole
principles",
}
@Article{Meinel:1988:PNP,
author = "Christoph Meinel",
title = "The power of nondeterminism in polynomial-size
bounded-width branching programs",
journal = j-THEOR-COMP-SCI,
volume = "62",
number = "3",
pages = "319--325",
month = dec,
year = "1988",
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 = "Akad der Wissenschaften",
affiliationaddress = "Berlin, East Ger",
classification = "721; 723; C4240 (Programming and algorithm theory)",
corpsource = "Karl-Weierstrass-Inst. fur Math., Akad. der
Wissenschaften, Berlin, East Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory--Turing Machines; computational
complexity; computational tool; Computer Metatheory;
Computer Programming--Theory; Nondeterministic
Branching Programs; Polynomial Size; polynomial-size
bounded-width branching programs; power of
nondeterminism; programming theory; Programming
Theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Schmidt:1989:APT,
author = "Ursula Schmidt",
title = "Avoidable patterns on two letters",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "1",
pages = "1--17",
month = jan,
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 Freiburg",
affiliationaddress = "Freiburg, West Ger",
classification = "723; C1250 (Pattern recognition)",
corpsource = "Inst. fur Inf., Freiburg Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Avoidable Patterns; avoidable patterns; Computer
Metatheory; Computer Programming Languages--Theory;
minimal alphabet; Minimal Alphabets; pattern
recognition; Thue--Morse; Two Letter Alphabets",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Livesey:1989:SFB,
author = "M. Livesey",
title = "Stable families of behavioural equivalences",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "1",
pages = "19--41",
month = jan,
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 of St. Andrews",
affiliationaddress = "St. Andrews, Scotl",
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., St. Andrews Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Behavioral Equivalences; behavioural equivalences;
Computer Metatheory; Computer Programming--Theory;
preorders; programming theory; Programming Theory;
quotient system; Stability of Equivalences; stable
families; Stable Family of Preorders; transition
system; Transition Systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ambos-Spies:1989:RCH,
author = "Klaus Ambos-Spies",
title = "On the relative complexity of hard problems for
complexity classes without complete problems",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "1",
pages = "43--61",
month = jan,
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 Oldenburg",
affiliationaddress = "Oldenburg, West Ger",
classification = "723; 921; C4240 (Programming and algorithm theory)",
corpsource = "Fachbereich Inf., Oldenburg Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "complexity classes; computational complexity;
Computational Complexity; Computer Metatheory; hard
problems; Mathematical Techniques--Set Theory; natural
closure properties; np Completeness; Partial Ordering;
Polynomial Time Reducibility; polynomial time
reducibility notions; recursive sequence; Recursive
Sets; recursive sets; relative complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ginsburg:1989:COH,
author = "Seymour Ginsburg and Chang-jie Tang",
title = "Cohesion of object histories",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "1",
pages = "63--90",
month = jan,
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 of Southern California",
affiliationaddress = "Los Angeles, CA, USA",
classification = "723; 921; C4250 (Database theory); C6160D
(Relational DBMS)",
corpsource = "Dept. of Comput. Sci., Univ. of Southern California,
Los Angeles, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "algebraically-oriented; cohesion; Database Systems;
database theory; Distributed; event-driven model;
Historical Data; historical data for objects;
Mathematical Techniques--Set Theory; Object Histories;
object histories; record-based; relational databases",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Johnson:1989:UFD,
author = "J. Howard Johnson",
title = "A unified framework for disambiguating finite
transductions",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "1",
pages = "91--111",
month = jan,
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 of Waterloo",
affiliationaddress = "Waterloo, Ont, Can",
classification = "723; 903; C4210 (Formal logic)",
corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Computer Metatheory; correctness proofs;
disambiguating finite transductions; finite state
transduction; Finite Transductions; formal languages;
genealogical minimum; Information Retrieval
Systems--Online Searching; Language Processing; Lexical
Analysis; lexicographic minimum; multiple output
values; natural languages; Text Processing; unified
framework",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Hagiya:1989:GPP,
author = "Masami Hagiya",
title = "Generalization from partial parametrization in
higher-order type theory",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "2",
pages = "113--139",
month = feb,
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 = "Kyoto Univ",
affiliationaddress = "Kyoto, Jpn",
classification = "723; C4240 (Programming and algorithm theory); C6120
(File organisation)",
corpsource = "Res. Inst. for Math. Sci., Kyoto Univ., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Computer Metatheory; Computer Programming--Theory;
constructive type theory; data structures;
formulae-as-types notion; generalizing a program;
Higher Order Type Theory; higher-order type theory;
largest sum segment problem; longest up segment
problem; Partial Parametrization; partial
parametrization; programming theory; Programming
Theory",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Birget:1989:CIT,
author = "Jean-Camille Birget",
title = "Concatenation of inputs in a two-way automaton",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "2",
pages = "141--156",
month = feb,
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 of Nebraska",
affiliationaddress = "Lincoln, NE, USA",
classification = "721; C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Nebraska Univ., Lincoln, NE,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; concatenation; Concatenation of
Inputs; crossing sequence; Finite Automata; finite
automata; Input Strings; partial functions; quadruple;
Two Way Finite Automata; two-way automaton",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{deFelice:1989:CFF,
author = "Clelia {de Felice}",
title = "Construction of a family of finite maximal codes",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "2",
pages = "157--184",
month = feb,
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 = "723; B6120B (Codes); C1260 (Information theory)",
corpsource = "Paris VII Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "algorithm; codes; Codes, Symbolic; Computer
Programming--Algorithms; Construction; Factorization;
finite maximal code; Finite Maximal Codes; finite
maximal codes; Two Letter Alphabets; Variable Length
Codes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Pelc:1989:SKE,
author = "Andrzej Pelc",
title = "Searching with known error probability",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "2",
pages = "185--202",
month = feb,
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 du Quebec a Hull",
affiliationaddress = "Hull, Que, Can",
classification = "723; 922; C1260 (Information theory)",
corpsource = "Dept. d'Inf., Quebec Univ., Hull, Que., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; comparison queries; Computer Programming;
Continuous Search; discrete bounded; Discrete Bounded
Search; Discrete Unbounded Search; Error Probability;
information theory; Interactive Searching; interactive
searching; probability; Probability; Reliability;
Search Algorithms; searching algorithm",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hromkovic:1989:TLR,
author = "Juraj Hromkovic",
title = "Tradeoffs for language recognition on alternating
machines",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "2",
pages = "203--221",
month = feb,
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 = "Comenius Univ",
affiliationaddress = "Bratislava, Czech",
classification = "721; 723; C4220 (Automata theory)",
corpsource = "Dept. of Theor. Cybernet. and Math. Inf., Comenius
Univ., Bratislava, Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "alternating machine; Alternating Machines; Automata
Theory; complexity measure; Complexity Measures;
Computational Complexity; Computer Metatheory; Computer
Systems, Digital; finite automata; input tape; Language
Recognition; nondeterministic machines; optimal lower
bounds; parallel computing model; Parallel Random
Access Machines; read-only heads",
pubcountry = "Netherlands",
treatment = "B Bibliography; T Theoretical or Mathematical",
}
@Article{Saito:1989:SBE,
author = "Takashi Saito and Hidenosuke Nishio",
title = "Structural and behavioral equivalence relations in
automata networks",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "2",
pages = "223--237",
month = feb,
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 = "Kyoto Univ",
affiliationaddress = "Kyoto, Jpn",
classification = "721; 921; C1160 (Combinatorial mathematics); C4220
(Automata theory)",
corpsource = "Dept. of Biophys., Kyoto Univ., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Networks; automata networks; Automata Theory;
Behavioral Equivalence; behavioural equivalence
relations; Directed Graphs; directed graphs;
edge-label; finite automata; Finite Automata; finite
automaton; Mathematical Techniques--Graph Theory;
Structural Equivalence; structural equivalence;
vertex-labeled directed graph",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
xxtitle = "Structural and behavioural equivalence relations in
automata networks",
}
@Article{Du:1989:ISC,
author = "Ding-Zhu Du and Ronald V. Book",
title = "On inefficient special cases of {NP}-complete
problems",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "3",
pages = "239--252",
month = mar,
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 = "Acad Sinica",
affiliationaddress = "Beijing, China",
classification = "723; 921; C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Appl. Math., Acad. Sinica., Beijing, China",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "computability; computational complexity; Computer
Metatheory; inefficient special cases; intractable set;
Intractable Sets; Mathematical Techniques--Set Theory;
np Complete Problems; NP-complete problems; polynomial
complexity core",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Gardarin:1989:TLP,
author = "Georges Gardarin and Irene Guessarian and Christophe
{de Maindreville}",
title = "Translation of logic programs into functional fixpoint
equations",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "3",
pages = "253--274",
month = mar,
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 Paris VI",
affiliationaddress = "Le Chesnay, Fr",
classification = "723; 921; C4240 (Programming and algorithm theory);
C6150C (Compilers, interpreters and other processors)",
corpsource = "LITP, Paris VI Univ., Le Chesnay, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "binary rules; Computer Metatheory; Computer
Programming--Theory; cyclic rules; Database
Systems--Theory; DATALOG; function symbols; Functional
Fixpoint Equations; functional fixpoint equations;
functional programming; Horn Clause Programs; logic
programming; logic programs; Logic Programs; MAGIC;
magic function method; Magic Function Method;
Mathematical Techniques--Graph Theory; optimized
relational algebra programs; PROBLEM predicates;
program compilers; Programming Theory; programming
theory; Query Compilation; recursive function free Horn
clause programs; reviews; rule redundancy elimination",
pubcountry = "Netherlands",
treatment = "G General Review; T Theoretical or Mathematical",
}
@Article{Benson:1989:FPF,
author = "David B. Benson and Jerzy Tiuryn",
title = "Fixed points in free process algebras, part {I}",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "3",
pages = "275--294",
month = mar,
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 = "Washington State Univ",
affiliationaddress = "Pullman, WA, USA",
classification = "723; 921; C4210 (Formal logic)",
corpsource = "Dept. of Comput. Sci., Washington State Univ.,
Pullman, WA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Computer Metatheory; distributive lattice; fixed point
solutions; formal languages; Free Process Algebras;
free process algebras; iterative equation; Iterative
Equations; iterative methods; linear left simple
polynomials; Linear Polynomials; Mathematical
Techniques; polynomials; Polynomials; silent action;
sum operator",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lingas:1989:SIB,
author = "Andrzej Lingas",
title = "Subgraph isomorphism for biconnected outerplanar
graphs in cubic time",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "3",
pages = "295--302",
month = mar,
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 = "Link{\"o}ping Univ",
affiliationaddress = "Link{\"o}ping, Swed",
classification = "921; C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. and Inf. Sci., Linkoping Univ.,
Sweden",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "algorithm theory; Biconnected Outerplanar Graphs;
biconnected outerplanar graphs; Computer
Programming--Algorithms; cubic time; dynamic
programming; dynamic programming algorithm; graph
theory; Mathematical Programming, Dynamic; Mathematical
Techniques--Graph Theory; Subgraph Isomorphism",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bloom:1989:ELC,
author = "Stephen L. Bloom and Zoltan Esik",
title = "Equational logic of circular data type specification",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "3",
pages = "303--331",
month = mar,
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 = "Stevens Inst of Technology",
affiliationaddress = "Hoboken, NJ, USA",
classification = "723; C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Stevens Inst. of Technol.,
Hoboken, NJ, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Circular Data Type Specification; circular data type
specification; Computer Metatheory; Computer
Programming--Theory; data structures; disjoint union;
Equational Logic; equational properties; fixed points;
flowchart algorithms; Flowchart Algorithms; formal
logic; Iteration Theories; iteration theories;
iterative methods; Programming Theory; programming
theory; singleton set; stacks; strong behaviours",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{deLuca:1989:SCP,
author = "Aldo {de Luca} and Stefano Varricchio",
title = "Some combinatorial properties of the {Thue--Morse}
sequence and a problem in semigroups",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "3",
pages = "333--348",
month = mar,
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 di Roma La Sapienza",
affiliationaddress = "Rome, Italy",
classification = "723; C1160 (Combinatorial mathematics); C4210
(Formal logic)",
corpsource = "Dipartimento di Matematica, Roma Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "combinatorial properties; Computer Metatheory; formal
languages; group theory; Semigroups; semigroups;
Special Factors; Thue--Morse Sequence; Thue--Morse
sequence; two-letter alphabet",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Stoss:1989:RRF,
author = "Hans-J{\"o}rg Stoss",
title = "On the representation of rational functions of bounded
complexity",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "1",
pages = "1--13",
month = apr,
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 Konstanz",
affiliationaddress = "Konstanz, West Ger",
classification = "723; 921; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math., Konstanz Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "bounded complexity; Complexity Bounds; complexity
measure; computational complexity; Computer Metatheory;
Lower Bounds; Mathematical Techniques--Algebra;
Rational Functions; rational functions representation;
Representation Theorem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Stoss:1989:LBC,
author = "Hans-J{\"o}rg Stoss",
title = "Lower bounds for the complexity of polynomials",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "1",
pages = "15--23",
month = apr,
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 Konstanz",
affiliationaddress = "Konstanz, West Ger",
classification = "723; 921; B0290F (Interpolation and function
approximation); C4130 (Interpolation and function
approximation)",
corpsource = "Dept. of Math., Konstanz Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "arbitrary field; Complexity Bounds; complexity of
polynomials; Computer Metatheory; divisors; Lower
Bounds; lower bounds; Mathematical
Techniques--Polynomials; polynomials; Representation
Theorem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Jojczyk:1989:IBP,
author = "K. Jojczyk and J. Konieczny and T. Kuzak",
title = "On interleaving behaviour of {PT-nets}",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "1",
pages = "25--38",
month = apr,
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 = "Jagiellonian Univ",
affiliationaddress = "Cracow, Pol",
classification = "721; 723; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Comput. Sci., Jagiellonian Univ., Krakow,
Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory--Formal Languages; Computer
Metatheory; interleaving behaviour; Petri nets; Petri
Nets; Place/Transition nets; Place/Transition Nets;
predicate expression; Predicate Expressions (Prex);
prex; PT-nets; Sequence of Predicates;
synchronization",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Tomita:1989:DBA,
author = "Etsuji Tomita and Kazushi Seino",
title = "A direct branching algorithm for checking the
equivalence of two deterministic pushdown transducers,
one of which is real-time strict",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "1",
pages = "39--53",
month = apr,
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 of Electro-Communications",
affiliationaddress = "Chofu, Jpn",
classification = "721; 723; C4220 (Automata theory)",
corpsource = "Dept. of Commun. Eng., Univ. of Electro-Commun.,
Tokyo, Japan",
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 Pushdown
Automata; Deterministic Pushdown Transducers;
deterministic pushdown transducers; direct branching
algorithm; Direct Branching Algorithm; equivalence;
real-time strict",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Sato:1989:CBC,
author = "Hiroyuki Sato",
title = "{E-CCC}: between {CCC} and {TOPOS}",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "1",
pages = "55--66",
month = apr,
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 of Tokyo",
affiliationaddress = "Tokyo, Jpn",
classification = "723; C4200 (Computer theory)",
corpsource = "Dept. of Inf. Sci., Tokyo Univ., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Cartesian Closed Category; cartesian closed category;
CCC; computation theory; Computer Metatheory; E-CCC;
extended abstract data type theory; Lambda Calculus;
Topos; TOPOS; typed lambda - calculus",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hung:1989:SCP,
author = "Dang Van Hung and Elod Knuth",
title = "Semi-commutations and {Petri} nets",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "1",
pages = "67--81",
month = apr,
year = "1989",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Oct 26 07:54:00 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Hungarian Acad of Sciences",
affiliationaddress = "Budapest, Hung",
classification = "723; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Comput. and Autom. Inst., Hungarian Acad. of Sci.,
Budapest, Hungary",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Asynchronous Cooperative Processes; Computer
Metatheory; Computer Systems, Digital--Distributed;
generalization; partial commutation; Partial
Commutations; Petri Nets; Petri nets; Semicommutations;
semicommutations; traces",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
xxauthor = "Dang {van Hung} and Elod Knuth",
}
@Article{Shamir:1989:CAN,
author = "Eli Shamir and Assaf Schuster",
title = "Communication aspects of networks based on geometric
incidence relations",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "1",
pages = "83--96",
month = apr,
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 = "Hebrew Univ",
affiliationaddress = "Jerusalem, Isr",
classification = "722; 723; 921; C4230 (Switching theory); C4240
(Programming and algorithm theory)",
corpsource = "Leibniz Center for Res. in Comput. Sci., Hebrew Univ.,
Jerusalem, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "communication properties; Computer
Programming--Algorithms; Computer Systems, Digital;
geometric incidence relations; Geometric Incidence
Relations; Interconnection Networks; lower bound;
Mathematical Techniques--Graph Theory; multiprocessor
interconnection networks; natural routing scheme;
network theory; optimal complexity; Parallel
Algorithms; parallel algorithms; Parallel Processing;
parallel-routing algorithm; projective space; Routing
Algorithms",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hindley:1989:BCL,
author = "J. Roger Hindley",
title = "{B}{CK}-combinators and linear \$lambda@-terms have
types",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "1",
pages = "97--105",
month = apr,
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 Coll",
affiliationaddress = "Swansea, Wales",
classification = "723; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Div. of Math., Univ. Coll. Swansea, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "bck Combinators; BCK-combinators; combinatorial
mathematics; Computer Metatheory; Lambda Terms; linear
lambda -terms; nonstratification; primitive linear
logic; Type Assignment",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Galil:1989:SDP,
author = "Zvi Galil and Raffaele Giancarlo",
title = "Speeding up dynamic programming with applications to
molecular biology",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "1",
pages = "107--118",
month = apr,
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 = "Columbia Univ",
affiliationaddress = "New York, NY, USA",
classification = "723; 921; B0260 (Optimisation techniques); C1180
(Optimisation techniques); C7330 (Biology and
medicine)",
corpsource = "Dept. of Comput. Sci., Columbia Univ., NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Computer Programming--Algorithms; Concave Problems;
Convex Problems; DNA; DNA sequences; Dual Problems;
dynamic programming; geology; Inverse Quadrangle
Inequality; Mathematical Programming, Dynamic; medical
computing; molecular biology; Quadrangle Inequality;
speech recognition",
pubcountry = "Netherlands",
treatment = "A Application; P Practical; T Theoretical or
Mathematical",
}
@Article{Protasi:1989:NAO,
author = "Marco Protasi and Maurizio Talamo",
title = "On the number of arithmetical operations for finding
{Fibonacci} numbers",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "1",
pages = "119--124",
month = apr,
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 di Roma Tor Vergata",
affiliationaddress = "Rome, Italy",
classification = "723; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dipartimento di Matematica, Roma Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; algorithms; arithmetical operations;
Arithmetical Operations; average case; Computational
Complexity; Computer Metatheory; Computer Programming;
Fibonacci Numbers; finding Fibonacci numbers; number
theory; worst case",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Korach:1989:OLB,
author = "E. Korach and S. Moran and S. Zaks",
title = "Optimal lower bounds for some distributed algorithms
for a complete network of processors",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "1",
pages = "125--132",
month = apr,
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 = "Technion - Israel Inst of Technology",
affiliationaddress = "Haifa, Isr",
classification = "723; 921; C4230 (Switching theory)",
corpsource = "Dept. of Comput. Sci., Technion-Israel Inst. of
Technol., Haifa, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; complete network of processors; Complete
Networks; Computer Programming; Computer Systems,
Digital--Distributed; distributed algorithms;
Distributed Algorithms; distributed processing; Global
Algorithms; Hamiltonian circuit; leader; Lower Bounds;
Matching Algorithms; Mathematical Techniques--Graph
Theory; maximal matching; multiprocessor
interconnection networks; optimal lower bounds;
spanning tree; synchronous networks",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kruskal:1989:TPM,
author = "Clyde P. Kruskal and Larry Rudolph and Marc Snir",
title = "Techniques for parallel manipulation of sparse
matrices",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "2",
pages = "135--157",
day = "7",
month = may,
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 of Maryland",
affiliationaddress = "College Park, MD, USA",
classification = "722; 723; 921; C4140 (Linear algebra); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Inst. for Adv. Comput. Studies,
Maryland Univ., College Park, MD, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "column permutation; computational complexity; Computer
Systems, Digital; Gaussian Elimination; Gaussian
elimination; Mathematical Techniques--Matrix Algebra;
Matrix Addition; matrix addition; matrix algebra;
Matrix Multiplication; matrix multiplication; matrix
transpose; matrix vector multiplication; Matrix Vector
Multiplication; mimd Computers; MIMD computers;
parallel algorithms; parallel manipulation; Parallel
Processing; raw permutation; sparse matrices; Sparse
Matrices",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Robert:1989:OSA,
author = "Yves Robert and Denis Trystram",
title = "Optimal scheduling algorithms for parallel {Gaussian}
elimination",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "2",
pages = "159--173",
day = "7",
month = may,
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 = "CNRS",
affiliationaddress = "Grenoble, Fr",
classification = "723; 921; C1160 (Combinatorial mathematics); C4140
(Linear algebra); C4240 (Programming and algorithm
theory)",
corpsource = "Lab. TIM3, INPG, CNRS, Grenoble, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; Asymptotically Optimal Algorithms;
asymptotically optimal algorithms; computational
complexity; Computer Programming; Computer Systems,
Digital--Parallel Processing; Gaussian Elimination;
graph theory; linear algebra; Mathematical
Techniques--Graph Theory; Optimal Scheduling
Algorithms; optimisation; Parallel Algorithms; parallel
algorithms; parallel Gaussian elimination; parallelism;
Scheduling; scheduling; scheduling algorithms; shared
memory system; simd/mimd Computers",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lyon:1989:DFP,
author = "Gordon Lyon",
title = "Design factors for parallel processing benchmarks",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "2",
pages = "175--189",
day = "7",
month = may,
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 = "Natl Inst of Standards \& Technology",
affiliationaddress = "Gaithersburg, MD, USA",
classification = "722; 723; C5440 (Multiprocessor systems and
techniques); C5470 (Performance evaluation and
testing)",
corpsource = "Nat. Comput. Syst. Lab., Nat. Inst. of Stand. and
Technol., Gaithersburg, MD, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "application benchmarks; architectural clusters;
Computer Systems, Digital; Computers,
Digital--Performance; economic compatibility; mimd
Computers; parallel architectures; parallel machines;
Parallel Processing; parallel processing benchmarks;
Parallel Processing Benchmarks; performance evaluation;
Process Communication",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{Bermond:1989:ICE,
author = "J. C. Bermond and J. M. Fourneau",
title = "Independent connections: An easy characterization of
baseline-equivalent multistage interconnection
networks",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "2",
pages = "191--201",
day = "7",
month = may,
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 = "CNRS",
affiliationaddress = "Paris, Fr",
classification = "723; C1160 (Combinatorial mathematics); C4230
(Switching theory); C5220 (Computer architecture)",
corpsource = "Univ. Paris Sud, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Banyan Networks; Banyan networks; Baseline network;
baseline-equivalent multistage interconnection
networks; binary string; bit directed routing; Computer
Networks; Computer Systems, Digital--Parallel
Processing; graph characterization; graph theory;
Independent Connections; independent connections; index
digit; multiprocessor interconnection networks;
Multistage Interconnection Networks; network topology;
parallel architectures; PIPID permutation; pipid
Permutation; switching cells; switching theory;
topological properties",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Akyildiz:1989:ESO,
author = "I. F. Akyildiz and H. {von Brand}",
title = "Exact solutions for open, closed and mixed queueing
networks with rejection blocking",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "2",
pages = "203--219",
day = "7",
month = may,
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 = "Georgia Inst of Technology",
affiliationaddress = "Atlanta, GA, USA",
classification = "723; 922; B0240C (Queueing theory)C4230 (Switching
theory); B6150 (Communication system theory); C1140C
(Queueing theory)",
corpsource = "Sch. of Inf. and Comput. Sci., Georgia Inst. of
Technol., Atlanta, GA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "blocking network; Blocking Networks; class membership;
closed queueing networks; Computer Systems,
Digital--Performance; equilibrium state probabilities;
exponential distribution; mixed queueing networks;
multiple job classes; open queueing networks;
Probability; probability; product form; Queueing
Networks; queueing theory; Queueing Theory; rejection
blocking; Rejection Blocking; reversible routing;
scheduling; service requirement distributions;
switching theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Stark:1989:CTS,
author = "Eugene W. Stark",
title = "Concurrent transition systems",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "3",
pages = "221--269",
day = "29",
month = may,
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 = "State Univ of New York at Stony Brook",
affiliationaddress = "Stony Brook, NY, USA",
classification = "722; 723; C4220 (Automata theory); C4240
(Programming and algorithm theory)",
corpsource = "State Univ. of New York, Stony Brook, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "abstractions; automata theory; computation category;
computation diagram; Computer Metatheory; Computer
Systems, Digital; Concurrent Computation; concurrent
computation; concurrent transition systems; Concurrent
Transition Systems; Dataflow Models; dataflow-like
model; Distributed; fair computation sequence;
feedback; fixed-point principle; functional
input/output behavior; machines; maximal ideals;
nondeterministic transition systems; Observable
Equivalence; observable equivalence; parallel product;
parallel programming; programming theory; residual
operations; sequential machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Therien:1989:PAM,
author = "Denis Therien",
title = "Programs over aperiodic monoids",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "3",
pages = "271--280",
day = "29",
month = may,
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 = "McGill Univ",
affiliationaddress = "Montreal, Que, Can",
classification = "721; 723; C4220 (Automata theory); C4240
(Programming and algorithm theory)",
corpsource = "Sch. of Comput. Sci., Mcgill Univ., Montreal, Que.,
Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Aperiodic Monoids; aperiodic monoids; Automata
Theory--Finite Automata; Boolean Circuits; boolean
circuits; Computer Metatheory; Computer
Programming--Theory; Computer Systems,
Digital--Parallel Processing; finite automata; finite
monoid; Finite Monoids; finite state automata; modulo
p; parallel computing; parallel programming; program;
programming theory; Programming Theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Mazurkiewicz:1989:CSI,
author = "Antoni Mazurkiewicz and Edward Ochmanski and Wojciech
Penczek",
title = "Concurrent systems and inevitability",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "3",
pages = "281--304",
day = "29",
month = may,
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 = "Polish Acad of Sciences",
affiliationaddress = "Warsaw, Pol",
classification = "722; 723; C4220 (Automata theory)",
corpsource = "Inst. of Comput. Sci., Polish Acad. of Sci., Warszawa,
Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "automata theory; Computer Metatheory; Computer
Systems, Digital; Concurrent Systems; concurrent
systems; Distributed; fair executable sequences;
inevitability; Inevitability Property; partial order
framework; Partially Ordered Sets; partially ordered
sets of states; system states",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Howell:1989:PCF,
author = "Rodney R. Howell and Louis E. Rosier",
title = "Problems concerning fairness and temporal logic for
conflict-free {Petri} nets",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "3",
pages = "305--329",
day = "29",
month = may,
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 of Texas at Austin",
affiliationaddress = "Austin, TX, USA",
classification = "723; C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "complexity; Computer Metatheory; Computer
Programming--Theory; conflict-free Petri nets;
Conflict-Free Petri Nets; decidability; Fair
Nontermination Problem; fair nontermination problem;
fairness; finite state systems; formal logic; model
checking problem; NLOGSPACE; NP; parallel programming;
Petri nets; Programming Theory; programming theory;
PTIME; Temporal Logic; temporal logic; undecidable",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Alon:1989:NTB,
author = "Noga Alon and Uri Zwick",
title = "On {Neciporuk}'s theorem for branching programs",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "3",
pages = "331--342",
day = "29",
month = may,
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 = "Tel-Aviv Univ",
affiliationaddress = "Tel-Aviv, Isr",
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math. and Comput. Sci., Sackler Fac. of Exact
Sci., Tel-Aviv Univ., Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Boolean Functions; Boolean functions; branching
programs; Branching Programs; Computer Metatheory;
Computer Programming--Theory; explicit formulae; lower
bounds; monotone non-decreasing functions; Neciporuk
theorem; Neciporuk's Theorem; Programming Theory;
programming theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{KleineBuning:1989:PVA,
author = "Hans {Kleine B{\"u}ning} and Theodor Lettmann and
Ernst W. Mayr",
title = "Projections of vector addition system reachability
sets are semilinear",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "3",
pages = "343--350",
day = "29",
month = may,
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 Karlsruhe",
affiliationaddress = "Karlsruhe, West Ger",
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Karlsruhe Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Computer Metatheory; Computer Programming--Algorithms;
decidability; decidable; inclusion problem;
one-dimensional projection; programming theory;
Reachability Sets; vector addition system reachability
sets; Vector Addition Systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Enjalbert:1989:MRC,
author = "Patrice Enjalbert and Luis {Farinas del Cerro}",
title = "Modal resolution in clausal form",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "1",
pages = "1--33",
day = "15",
month = jun,
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 Caen",
affiliationaddress = "Caen, Fr",
classification = "723; C1230 (Artificial intelligence); C6110 (Systems
analysis and programming)",
corpsource = "Lab. d'Informatique, Caen Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automated Deduction Methods; automated deduction
methods; clausal form; Completeness Proof; completeness
proof technique; Computer Metatheory; Computer
Programming--Algorithms; Deletion Strategy; deletion
strategy; Formal Logic; logic programming; Modal Logic;
modal logic; modal resolution; Modal Resolution;
Robinson resolution method; Subsumption Relation;
subsumption relation; tableau method",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Abadi:1989:PTP,
author = "Martin Abadi",
title = "The power of temporal proofs",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "1",
pages = "35--83",
day = "15",
month = jun,
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 = "Stanford Univ",
affiliationaddress = "Stanford, CA, USA",
classification = "723; C6110 (Systems analysis and programming)",
corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Auxiliary Predicates; completeness results; Computer
Metatheory; concurrent programs; Formal Logic; hardware
devices; nonstandard soundness; parallel programming;
power; reasoning; Temporal Logic; temporal proofs;
Temporal Proofs",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Thatte:1989:FAL,
author = "Satish R. Thatte",
title = "Full abstraction and limiting completeness in
equational languages",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "1",
pages = "85--119",
day = "15",
month = jun,
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 of Michigan",
affiliationaddress = "Ann Arbor, MI, USA",
classification = "723; C4210 (Formal logic)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Michigan
Univ., Ann Arbor, MI, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "coherent computable models; Computer Metatheory;
Computer Programming Languages; design principle;
Equational Languages; equational languages; formal
languages; full abstraction; Full Abstraction; fully
abstract model; information systems; limiting
completeness; Limiting Completeness; regular systems;
Semantics; Theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Anonymous:1989:CAC,
author = "Anonymous",
title = "{Conference on Arithmetics and Coding Systems}",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "2",
pages = "??--??",
day = "28",
month = jun,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1260
(Information theory); C4240 (Programming and algorithm
theory)",
conflocation = "Marseille-Luminy, France; 9-13 June 1989",
conftitle = "Conference on Arithmetics and Coding Systems",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arithmetic sequences; arithmetics; beta -expansions;
classification; coding systems; combinatorial
mathematics; computational complexity; diagonal
continued fraction; encoding; ergodic properties;
finitely generated sofic systems; formal logic; fractal
functions; Fredholm determinant; fuller identities;
geometry; infinite words; labelled subtrees; linear
subword complexity; piecewise linear transformation;
q-adic spectral analysis; randomly labelled tree;
rational functions; rational probability measures;
real-time constructed sequences; sequence; skew
products; statistic; symbolic dynamics; Weyl sums",
pubcountry = "Netherlands",
}
@Article{Allouche:1989:SRF,
author = "Jean-Paul Allouche",
title = "On a sequence of rational functions",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "2",
pages = "123--130",
day = "28",
month = jun,
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 = "CNRS",
affiliationaddress = "Talence, Fr",
classification = "721; 723; 921; C4220 (Automata theory)",
conference = "Conference on Arithmetics and Coding Systems",
conflocation = "Marseille-Luminy, France; 9-13 June 1989",
conftitle = "Conference on Arithmetics and Coding Systems",
corpsource = "Dept. of Math. et Inf., Bordeaux Univ., Talence,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory--Finite Automata; Computer Metatheory;
finite automata; finite automaton; Iterative Problems;
Mathematical Techniques; Number Theory; Rational
Functions; rational functions; sequence; Sequences",
meetingaddress = "Marseille, Fr",
meetingdate = "Jun 9--13 1987",
meetingdate2 = "06/09--13/87",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Blanchard:1989:BES,
author = "F. Blanchard",
title = "\$beta@-expansions and symbolic dynamics",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "2",
pages = "131--141",
day = "28",
month = jun,
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 Paris",
affiliationaddress = "Paris, Fr",
classification = "721; 723; 921; C4210 (Formal logic)",
conference = "Conference on Arithmetics and Coding Systems",
conflocation = "Marseille-Luminy, France; 9-13 June 1989",
conftitle = "Conference on Arithmetics and Coding Systems",
corpsource = "Lab. de Probabilities, Paris 6 Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory--Formal Languages; beta -expansion;
Beta Expansions; Beta Shifts; Computer Metatheory;
formal languages; formal logic; integer coefficients;
language theory; Mathematical Techniques; negative
powers; Number Theory; Symbolic Dynamics; symbolic
dynamics",
meetingaddress = "Marseille, Fr",
meetingdate = "Jun 9--13 1987",
meetingdate2 = "06/09--13/87",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bleuzen-Guernalec:1989:PCR,
author = "Noelle Bleuzen-Guernalec",
title = "On a possible classification of real-time constructed
sequences",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "2",
pages = "143--148",
day = "28",
month = jun,
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 = "Faculte des Sciences de Luminy",
affiliationaddress = "Marseille, Fr",
classification = "721; 723; 921; C1260 (Information theory); C4240
(Programming and algorithm theory)",
conference = "Conference on Arithmetics and Coding Systems",
conflocation = "Marseille-Luminy, France; 9-13 June 1989",
conftitle = "Conference on Arithmetics and Coding Systems",
corpsource = "Dept. de Math., Fac. des Sci. de Luminy, Marseille,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; complexity; computational complexity;
Computer Metatheory; encoding; finite alphabet; Finite
Alphabets; fixed-point generation; Infinite Sequences;
infinite sequences; iterative productibility;
Mathematical Techniques--Number Theory; possible
classification; real-time constructed sequences;
Realtime Producible Sequences",
meetingaddress = "Marseille, Fr",
meetingdate = "Jun 9--13 1987",
meetingdate2 = "06/09--13/87",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Dekking:1989:POL,
author = "F. M. Dekking",
title = "On the probability of occurrence of labelled subtrees
of a randomly labelled tree",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "2",
pages = "149--152",
day = "28",
month = jun,
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 = "Delft Univ of Technology",
affiliationaddress = "Delft, Neth",
classification = "723; 921; 922; B0240 (Probability and statistics);
B0250 (Combinatorial mathematics); C1140 (Probability
and statistics); C1160 (Combinatorial mathematics)",
conference = "Conference on Arithmetics and Coding Systems",
conflocation = "Marseille-Luminy, France; 9-13 June 1989",
conftitle = "Conference on Arithmetics and Coding Systems",
corpsource = "Dept. of Math., Delft Univ. of Technol., Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Binary Trees; Computer Metatheory; Labeled Subtrees;
labelled subtrees; Mathematical Techniques;
Probability; probability; probability of occurrence;
proofs; proposition; Randomly Labeled Trees; randomly
labelled tree; theorem; Trees; trees (mathematics)",
meetingaddress = "Marseille, Fr",
meetingdate = "Jun 9--13 1987",
meetingdate2 = "06/09--13/87",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Dumont:1989:SNR,
author = "J.-M. Dumont and Alain Thomas",
title = "Syst{\'e}mes de num\-{\'e}\-ra\-tion et fonction
fractales relatifs aux substitutions. ({French})
[{Systems} of numeration and fractal functions relative
to substitutions]",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "2",
pages = "153--169",
day = "28",
month = jun,
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 = "Dumont, Jean-Marie",
affiliationaddress = "Faculte des Sciences de Luminy, Marseille, Fr",
classification = "723; 921; B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
conference = "Conference on Arithmetics and Coding Systems",
conflocation = "Marseille-Luminy, France; 9-13 June 1989",
conftitle = "Conference on Arithmetics and Coding Systems",
corpsource = "Dept. de Math., Fac. des Sci. de Luminy, Marseille,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "asymptotic formula; Computer Metatheory; finite
alphabet; Fractal Functions; fractal functions;
integers; Mathematical Techniques; Number Theory;
number theory; numeration systems; real numbers;
Self-Affine Functions; self-affine functions;
Substitutions; substitutions",
language = "French",
meetingaddress = "Marseille, Fr",
meetingdate = "Jun 9--13 1987",
meetingdate2 = "06/09--13/87",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hansel:1989:RPM,
author = "G. Hansel and D. Perrin",
title = "Rational probability measures",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "2",
pages = "171--188",
day = "28",
month = jun,
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 Rouen",
affiliationaddress = "Mont-Saint-Aignan, Fr",
classification = "721; 723; 922; C1140 (Probability and statistics);
C1260 (Information theory); C4220 (Automata theory)",
conference = "Conference on Arithmetics and Coding Systems",
conflocation = "Marseille-Luminy, France; 9-13 June 1989",
conftitle = "Conference on Arithmetics and Coding Systems",
corpsource = "LITP, Rouen Univ., Mount-Saint-Aignan, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; automata theory; Bernoulli measure;
Codes, Symbolic--Encoding; coding; encoding; Finite
Automata; finite automata; free submonoid;
Multiplicative Measures; Probability; probability;
Probability Measures on Words; probability theory;
Rational Probability Measures; rational probability
measures; Tower Construction",
meetingaddress = "Marseille, Fr",
meetingdate = "Jun 9--13 1987",
meetingdate2 = "06/09--13/87",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hellekalek:1989:WSS,
author = "P. Hellekalek and G. Larcher",
title = "On {Weyl} sums and skew products over irrational
rotations",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "2",
pages = "189--196",
day = "28",
month = jun,
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 Salzburg",
affiliationaddress = "Salzburg, Austria",
classification = "723; 921; A0520 (Statistical mechanics)",
conference = "Conference on Arithmetics and Coding Systems",
conflocation = "Marseille-Luminy, France; 9-13 June 1989",
conftitle = "Conference on Arithmetics and Coding Systems",
corpsource = "Inst. f{\"u}r Math., Salzburg Univ., Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "boundness; Computer Metatheory; ergodicity; Irrational
Rotations; irrational rotations; limit points;
Lipschitz-continuous derivative; Mathematical
Techniques; Number Theory; skew product; Skew Products;
statistical mechanics; Well Sums; Weyl sums",
meetingaddress = "Marseille, Fr",
meetingdate = "Jun 9--13 1987",
meetingdate2 = "06/09--13/87",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kraaikamp:1989:SEP,
author = "Cor Kraaikamp",
title = "Statistic and ergodic properties of {Minkowski}'s
diagonal continued fraction",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "2",
pages = "197--212",
day = "28",
month = jun,
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 = "Amsterdam Univ",
affiliationaddress = "Amsterdam, Neth",
classification = "723; 921; 922; A0520 (Statistical mechanics)",
conference = "Conference on Arithmetics and Coding Systems",
conflocation = "Marseille-Luminy, France; 9-13 June 1989",
conftitle = "Conference on Arithmetics and Coding Systems",
corpsource = "Inst. of Math., Amsterdam Univ., Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Computer Metatheory; Continued Fraction Expansions;
DCF; Ergodic Properties; ergodic properties;
Mathematical Techniques; Minkowski's Diagonal Continued
Fraction; Minkowski's diagonal continued fraction;
Number Theory; S Expansions; statistic properties;
statistical mechanics",
meetingaddress = "Marseille, Fr",
meetingdate = "Jun 9--13 1987",
meetingdate2 = "06/09--13/87",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{MendesFrance:1989:GEI,
author = "M. {Mendes France} and A. J. {van der Poorten}",
title = "From geometry to {Euler} identities",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "2",
pages = "213--220",
day = "28",
month = jun,
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 Bordeaux 1",
affiliationaddress = "Talence, Fr",
classification = "723; 921; C4190 (Other numerical methods)",
conference = "Conference on Arithmetics and Coding Systems",
conflocation = "Marseille-Luminy, France; 9-13 June 1989",
conftitle = "Conference on Arithmetics and Coding Systems",
corpsource = "UER Math. et Inf., Bordeaux Univ., Talence, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "computational geometry; Computer Metatheory; Euler
Identities; fuller identities; geometry; Geometry;
Mathematical Techniques; Number Theory; Rational
Functions; two-dimensional dynamical systems",
meetingaddress = "Marseille, Fr",
meetingdate = "Jun 9--13 1987",
meetingdate2 = "06/09--13/87",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Mignosi:1989:IWL,
author = "Filippo Mignosi",
title = "Infinite words with linear subword complexity",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "2",
pages = "221--242",
day = "28",
month = jun,
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 of Palermo",
affiliationaddress = "Palermo, Italy",
classification = "721; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
conference = "Conference on Arithmetics and Coding Systems",
conflocation = "Marseille-Luminy, France; 9-13 June 1989",
conftitle = "Conference on Arithmetics and Coding Systems",
corpsource = "Dept. of Comput. Sci., Palermo Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; bounded partial quotients;
combinational properties; combinatorial mathematics;
computational complexity; continued fraction expansion;
Formal Languages; Infinite Words; infinite words;
Linear Subword Complexity; linear subword complexity;
Mathematical Techniques--Combinatorial Mathematics;
permutation property; real number; Sturmian Infinite
Words",
meetingaddress = "Marseille, Fr",
meetingdate = "Jun 9--13 1987",
meetingdate2 = "06/09--13/87",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Mori:1989:FDP,
author = "Makoto Mori",
title = "On the {Fredholm} determinant of a piecewise linear
transformation",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "2",
pages = "243--248",
day = "28",
month = jun,
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 = "National Defence Acad",
affiliationaddress = "Yokosuka, Jpn",
classification = "723; 921; B0290H (Linear algebra); C4140 (Linear
algebra)",
conference = "Conference on Arithmetics and Coding Systems",
conflocation = "Marseille-Luminy, France; 9-13 June 1989",
conftitle = "Conference on Arithmetics and Coding Systems",
corpsource = "Dept. of Math., Nat. Defence Acad., Kanagawa, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Computer Metatheory; eigenvalues and eigenfunctions;
finite-dimensional matrix; Fredholm Determinant;
Fredholm determinant; integral equations; Mathematical
Transformations; Perron--Frobenius operator; piecewise
linear transformation; Piecewise Linear
Transformations; piecewise-linear techniques; renewal
equation; Signed Symbolic Dynamics; signed symbolic
dynamics; zeta function; Zeta Functions",
meetingaddress = "Marseille, Fr",
meetingdate = "Jun 9--13 1987",
meetingdate2 = "06/09--13/87",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Mosse:1989:QAS,
author = "Brigitte Mosse",
title = "{Q}-Adic spectral analysis of some arithmetic
sequences",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "2",
pages = "249--263",
day = "28",
month = jun,
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 = "CNRS",
affiliationaddress = "Marseille, Fr",
classification = "723; 921; B6140 (Signal processing and detection);
C1260 (Information theory)",
conference = "Conference on Arithmetics and Coding Systems",
conflocation = "Marseille-Luminy, France; 9-13 June 1989",
conftitle = "Conference on Arithmetics and Coding Systems",
corpsource = "CNRS, UFR de Math., Univ. de Provence, Marseille,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Arithmetic Sequences; arithmetic sequences; Computer
Metatheory; Mathematical Techniques; metric group
action; Multiplicative Sequences; multiplicative
sequences; Number Theory; q-adic spectral analysis;
spectral analysis; Spectrum Analysis; Walsh
Correlations; Walsh functions; Walsh Spectral Measures;
Walsh spectral measures",
meetingaddress = "Marseille, Fr",
meetingdate = "Jun 9--13 1987",
meetingdate2 = "06/09--13/87",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Restivo:1989:FGS,
author = "Antonio Restivo",
title = "Finitely generated sofic systems",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "2",
pages = "265--270",
day = "28",
month = jun,
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 di Palermo",
affiliationaddress = "Palermo, Italy",
classification = "723; 921; C4210 (Formal logic)",
conference = "Conference on Arithmetics and Coding Systems",
conflocation = "Marseille-Luminy, France; 9-13 June 1989",
conftitle = "Conference on Arithmetics and Coding Systems",
corpsource = "Dipartimento di Matematica ed Applicazioni, Palermo
Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory--Computability and Decidability;
Codes, Symbolic; Computer Metatheory; Decidability;
decidability; decidable; Finite Sequences; finitely
generated sofic systems; Mathematical
Techniques--Number Theory; transitive sofic system;
Transitive Sofic Systems",
meetingaddress = "Marseille, Fr",
meetingdate = "Jun 9--13 1987",
meetingdate2 = "06/09--13/87",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Yokouchi:1989:CRT,
author = "Hirofumi Yokouchi",
title = "{Church--Rosser} theorem for a rewriting system on
categorical combinators",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "3",
pages = "271--290",
day = "17",
month = jul,
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 = "IBM",
affiliationaddress = "Tokyo, Jpn",
classification = "723; C4210 (Formal logic)",
corpsource = "Tokyo Res. Lab., IBM Res., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Categorical Combinators; CCL hierarchy; Church--Rosser
Theorem; Church--Rosser theorem; Computer Metatheory;
Computer Programming Languages; reduction strategy;
Rewriting System; rewriting system; rewriting systems;
Theory; type-free categorical combinations",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hardin:1989:CRP,
author = "Therese Hardin",
title = "Confluence results for the pure strong categorical
logic {CCL} \$lambda@-calculi as subsystems of {CCL}",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "3",
pages = "291--342",
day = "17",
month = jul,
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 = "INRIA",
affiliationaddress = "Le Chesnay, Fr",
classification = "723; C4210 (Formal logic)",
corpsource = "Project FORMEL, INRIA, Le Chesnay, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "beta - derivations; CCL; Computer Metatheory; Computer
Programming Languages; Confluence; formal logic;
interpretation method; Lambda Calculus; projection
rules; pure strong categorical logic; rewriting
systems; Rewriting Systems; Strong Categorical
Combinatory Logic; Theory; untyped Lambda-calculi",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Shepherdson:1989:SCS,
author = "J. C. Shepherdson",
title = "A sound and complete semantics for a version of
negation as failure",
journal = j-THEOR-COMP-SCI,
volume = "65",
number = "3",
pages = "343--371",
day = "17",
month = jul,
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 of Bristol",
affiliationaddress = "Bristol, Engl",
classification = "723; C4210 (Formal logic)",
corpsource = "Dept. of Math., Bristol Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "3- valued logic; completeness; Computer Metatheory;
consequence relation; declarative semantics; formal
logic; Intuitionistic Logic; intuitionistic logic;
Logic Programming; negation as failure; Negation as
Failure; Programming Theory; Semantics;
SLDNF-resolution; soundness; Three Valued Logic",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lehmkuhl:1989:OAA,
author = "T. Lehmkuhl and T. Lickteig",
title = "On the order of approximation in approximative triadic
decompositions of tensors",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "1",
pages = "1--14",
day = "2",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Math. Inst., Tubingen Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic border rank; algebraically closed ground
fields; approximative triadic decompositions;
computational complexity; equivalence; order of
approximation; real closed fields; tensors; topological
border rank; upper bound",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Dunne:1989:MSN,
author = "P. E. Dunne",
title = "On monotone simulations of nonmonotone networks",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "1",
pages = "15--25",
day = "2",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Comput. Sci., Liverpool Univ., UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean functions; monotone simulations; nonmonotone
networks",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Piperno:1989:APC,
author = "A. Piperno",
title = "Abstraction problems in combinatory logic: a
compositive approach",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "1",
pages = "27--43",
day = "2",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dipartimento di Matematica, Rome Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstraction problems; cardinality; combinatorial
mathematics; combinatory logic; compact code;
compositive approach; formal logic; functional
languages; lambda -terms; translation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kari:1989:OCP,
author = "J. Kari",
title = "Observations concerning a public-key cryptosystem
based on iterated morphisms",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "1",
pages = "45--53",
day = "2",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); C6130 (Data handling techniques)",
corpsource = "Dept. of Math., Turku Univ., Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cryptography; cryptotext; decryption key; iterated
morphisms; NP-hard problem; plaintext; public-key
cryptosystem; substitutions",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{Xin:1989:EAD,
author = "Zhang Luo Xin",
title = "An efficient algorithm to decide whether a monoid
presented by a regular {Church--Rosser Thue} system is
a group",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "1",
pages = "55--63",
day = "2",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Lanzhou Univ., China",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm; cardinality; decidability; decidable;
group; monoid; regular Church--Rosser Thue system",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{opdenAkker:1989:LGL,
author = "R. {op den Akker}",
title = "On {LC(0)} grammars and languages",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "1",
pages = "65--85",
day = "2",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Comput. Sci., Twente Univ., Enschede,
Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic languages; formal languages; grammars;
languages; left-corner grammars; LL(1) languages; LR(0)
languages; LR(k) grammars",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Urquhart:1989:CGS,
author = "A. Urquhart",
title = "The complexity of {Gentzen} systems for propositional
logic",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "1",
pages = "87--97",
day = "2",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Philos., Toronto Univ., Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "biconditional; complexity; computational complexity;
exponentially long proofs; formal logic; Gentzen
systems; polynomial size proofs; propositional logic;
valid sequents",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Statman:1989:SSC,
author = "R. Statman",
title = "On sets of solutions to combinator equations",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "1",
pages = "99--104",
day = "2",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1250 (Pattern
recognition)",
corpsource = "Dept. of Math., Carnegie-Mellon Univ., Pittsburgh, PA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "beta -conversion; combinator equations; combinatorial
mathematics; pattern matching; pattern recognition;
sets of solutions",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Pelc:1989:WAC,
author = "A. Pelc",
title = "Weakly adaptive comparison searching",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "1",
pages = "105--111",
day = "2",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. d'Inf., Quebec Univ., Que., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "comparison queries; complexity; computational
complexity; discrete search; error bound; weakly
adaptive comparison searching; worst-case optimal
algorithm",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Mundici:1989:FCM,
author = "D. Mundici",
title = "Functions computed by monotone {Boolean} formulas with
no repeated variables",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "1",
pages = "113--114",
day = "2",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dipartimento Sci. Inf., Milan Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean functions; matroid theory; monotone Boolean
formulas; necessary condition; prime clause; prime
implicant; singleton",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Diekert:1989:KBC,
author = "Volker Diekert",
title = "On the {Knuth--Bendix} completion for concurrent
processes",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "2",
pages = "117--136",
day = "20",
month = aug,
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 = "Technische Univ Muenchen",
affiliationaddress = "Munich, West Ger",
classification = "721; 723; C4210 (Formal logic); C4240 (Programming
and algorithm theory)",
conference = "14th International Colloquium on Automata, Languages
and Programming",
conflocation = "Karlsruhe, West Germany; 13-17 July 1987",
conftitle = "Fourteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Inst. f{\"u}r Informatik, Tech. Univ. Munchen, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; computability; computable; Computer
Systems, Digital--Parallel Processing; Concurrent
Processes; concurrent processes; critical pairs; finite
trace replacement; formal languages; Free Partially
Communicative Monoids; group theory; Knuth--Bendix
Completion; Knuth--Bendix completion procedure;
monoids; parallel algorithms; replacement systems;
semi-Thue systems; vector replacement systems",
meetingaddress = "Karlsruhe, West Ger",
meetingdate = "Jun 1987",
meetingdate2 = "06/87",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput.Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Dietzfelbinger:1989:LBS,
author = "Martin Dietzfelbinger",
title = "Lower bounds for sorting of sums",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "2",
pages = "137--155",
day = "20",
month = aug,
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 Dortmund",
affiliationaddress = "Dortmund, West Ger",
classification = "723; 921; C4240 (Programming and algorithm theory);
C6130 (Data handling techniques)",
conference = "14th International Colloquium on Automata, Languages
and Programming",
conflocation = "Karlsruhe, West Germany; 13-17 July 1987",
conftitle = "Fourteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Lehrstuhl Informatik II, Dortmund Univ., West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "comparison tree; complexity of sorting; Computational
Complexity; computational complexity; Computer Systems
Programming; lower bound; Lower Bounds; Mathematical
Techniques--Trees; optimal; Sorting; sorting; Sorting
of Sums; sums",
meetingaddress = "Karlsruhe, West Ger",
meetingdate = "Jun 1987",
meetingdate2 = "06/87",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput.Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Edelsbrunner:1989:TNC,
author = "Herbert Edelsbrunner and Guenter Rote and Ermo Welzl",
title = "Testing the necklace condition for shortest tours and
optimal factors in the plane",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "2",
pages = "157--180",
day = "20",
month = aug,
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 of Illinois at Urbana-Champaign",
affiliationaddress = "Urbana, IL, USA",
classification = "723; 921; C1160 (Combinatorial mathematics); C1290
(Applications of systems theory); C4240 (Programming
and algorithm theory)",
conference = "14th International Colloquium on Automata, Languages
and Programming",
conflocation = "Karlsruhe, West Germany; 13-17 July 1987",
conftitle = "Fourteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "combinatorial analysis; complexity results;
computational complexity; Computer
Programming--Algorithms; graph theory; intersection
graphs; Mathematical Programming; Necklace Condition;
necklace condition; operations research; Optimal
Factors; optimal factors; Shortest Tours; shortest
tours; Traveling Salesman Problem; traveling salesman
tour",
meetingaddress = "Karlsruhe, West Ger",
meetingdate = "Jun 1987",
meetingdate2 = "06/87",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput.Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Levcopoulos:1989:HOB,
author = "Christos Levcopoulos and Andrzej Lingas and Jorg-R. R.
Sack",
title = "Heuristics for optimum binary search trees and minimum
weight triangulation problems",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "2",
pages = "181--203",
day = "20",
month = aug,
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 = "Link{\"o}ping Univ",
affiliationaddress = "Link{\"o}ping, Swed",
classification = "723; 921; C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
conference = "14th International Colloquium on Automata, Languages
and Programming",
conflocation = "Karlsruhe, West Germany; 13-17 July 1987",
conftitle = "Fourteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Comput. and Inf. Sci., Linkoping Univ.,
Sweden",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Amortization Argument; binary search trees; Computer
Programming--Algorithms; Data Processing; Data
Structures; duality; greedy heuristics; linear-time
heuristic; Mathematical Techniques--Trees; Minimum
Weight Triangulation; minimum weight triangulation;
Optimum Binary Search Trees; optimum binary search
trees; search problems; search trees; trees
(mathematics)",
meetingaddress = "Karlsruhe, West Ger",
meetingdate = "Jun 1987",
meetingdate2 = "06/87",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput.Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{NaitAbdallah:1989:LAA,
author = "M. A. {Nait Abdallah}",
title = "A logico-algebraic approach to the model theory of
knowledge",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "2",
pages = "205--232",
day = "20",
month = aug,
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 of Western Ontario",
affiliationaddress = "London, Ont, Can",
classification = "723; 921; C1230 (Artificial intelligence); C4210
(Formal logic); C4240 (Programming and algorithm
theory)",
conference = "14th International Colloquium on Automata, Languages
and Programming",
conflocation = "Karlsruhe, West Germany; 13-17 July 1987",
conftitle = "Fourteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "Dept. of Comput. Sci., Univ. of Western Ontario,
London, Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algebraic Semantics; algebraic semantics; Computer
Metatheory; Computer Programming; first-order logic
programming; formal languages; knowledge engineering;
Logic Programming; logic programming; logic programming
framework; logico-algebraic approach; Mathematical
Techniques--Algebra; Model Theory of Knowledge; model
theory of knowledge",
meetingaddress = "Karlsruhe, West Ger",
meetingdate = "Jun 1987",
meetingdate2 = "06/87",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput.Sci",
treatment = "T Theoretical or Mathematical",
}
@Article{Weil:1989:IMD,
author = "P. Weil",
title = "Inverse monoids of dot-depth two",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "3",
pages = "233--245",
day = "26",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "LITP, Paris, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "dot-depth two; formal languages; inverse generators;
inverse monoids; necessary condition; star-free regular
language; syntactic monoid",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Yamasaki:1989:LTR,
author = "H. Yamasaki",
title = "Language-theoretical representations of
$Gw$-languages",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "3",
pages = "247--254",
day = "26",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Math., Hitotsubashi Univ., Tokyo, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite automata; formal languages; Gw-languages;
language theoretical representations; prefix-free
finite languages; prefix-free regular languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Angluin:1989:TS,
author = "D. Angluin and W. I. Gasarch and C. H. Smith",
title = "Training sequences",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "3",
pages = "255--272",
day = "26",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence)",
corpsource = "Dept. of Comput. Sci., Yale Univ., New Haven, CT,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite sequence; inference mechanisms; learning
systems; recursion theoretic framework; recursive
functions; simultaneous inference of programs; training
sequences",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Ito:1989:DTD,
author = "A. Ito and K. Inoue and I. Takanami",
title = "Deterministic two-dimensional on-line tessellation
acceptors are equivalent to two-way two-dimensional
alternating finite automata through 180
degrees-rotation",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "3",
pages = "273--287",
day = "26",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Yamaguchi Univ., Ube, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "2D deterministic online tesselation acceptor; finite
automata; two-way two-dimensional alternating finite
automaton",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Jacopini:1989:GIF,
author = "G. Jacopini and P. Mentrasti",
title = "Generation of invertible functions",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "3",
pages = "289--297",
day = "26",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dipartimento di Matematica, Rome Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal logic; functional composition; functional
iteration; invertible one-variable partial recursive
functions; reversible iteration; Turing machines;
Turning machine",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Makowsky:1989:WSO,
author = "J. A. Makowsky and I. Sain",
title = "Weak second order characterizations of various program
verification systems",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "3",
pages = "299--321",
day = "26",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6150G
(Diagnostic, testing, debugging and evaluating
systems)",
corpsource = "Dept. of Comput. Sci., Technion-Israel Inst. of
Technol., Haifa, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "comprehension axiom; Floyd-Hoare Logic; logic
programming; nonstandard logics of programs; program
verification; program verification systems; weak second
order characterisations",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Mezghiche:1989:PCB,
author = "M. Mezghiche",
title = "On pseudo-c beta normal form in combinatory logic",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "3",
pages = "323--331",
day = "26",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Inst. Nat. d'Inf., Tizi-Ouzou, Algeria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "CL-term; combinatorial mathematics; combinatory logic;
formal logic; lambda beta -normal form; pseudo-c beta
normal form",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Tiomkin:1989:PTV,
author = "M. Tiomkin",
title = "Probabilistic termination versus fair termination",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "3",
pages = "333--340",
day = "26",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6150G
(Diagnostic, testing, debugging and evaluating
systems)",
corpsource = "Dept. of Comput. Sci., Technion-Israel Inst. of
Technol., Haifa, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; concurrent programs; fair termination;
probabilistic termination; program verification;
recursive ordinals",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{Honkala:1989:NCR,
author = "J. Honkala",
title = "A necessary condition for the rationality of the zeta
function of a regular language",
journal = j-THEOR-COMP-SCI,
volume = "66",
number = "3",
pages = "341--347",
day = "26",
month = aug,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Turku Univ., Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cyclic languages; formal languages; generating
function; necessary condition; rationality; regular
language; zeta function",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Swart:1989:IS,
author = "Charles Swart and Dana Richards",
title = "On the inference of strategies",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "1",
pages = "5--18",
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 = "Oregon State Univ",
affiliationaddress = "Corvallis, OR, USA",
classification = "721; 921; 922; C1140E (Game theory); C4220 (Automata
theory)",
corpsource = "Dept. of Comput. Sci., Oregon State Univ., Corvallis,
OR, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; automata theory; counter machine;
Counter Machine Strategies; decidability; finite-state
strategies; game theory; Game Theory; graph traversal
techniques; Graph Traversal Techniques; inference
mechanisms; Inference of Strategies; inference of
strategies; infinite tournaments; Mathematical
Techniques--Graph Theory; optimal defense; Prisoner's
Dilemma; Probability; Turing machine; Turing Machine
Strategies; Turing machines; two-person games",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Otto:1989:DCF,
author = "Friedrich Otto",
title = "On deciding confluence of finite string-rewriting
systems modulo partial commutativity",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "1",
pages = "19--35",
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 = "State Univ of New York",
affiliationaddress = "Albany, NY, USA",
classification = "721; 723; C4210 (Formal logic)",
corpsource = "Dept. of Comput. Sci., State Univ. of New York,
Albany, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; Computer Metatheory; Confluence;
confluence; Congruence; congruence; decidability;
decidable; finite string-rewriting systems; Formal
Languages; partial commutativity relation; partially
commutative alphabets; Partially Commutative Monoids;
rewriting systems; String Rewriting Systems;
string-rewriting systems; term-rewriting systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Martin:1989:GAM,
author = "Ursula Martin",
title = "A geometrical approach to multiset orderings",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "1",
pages = "37--54",
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 of London",
affiliationaddress = "London, Engl",
classification = "921; C4290 (Other computer theory)",
corpsource = "Dept. of Comput. Sci., R. Holloway and Bedford New
Coll., London Univ., Egham, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "computational geometry; Dominance Ordering; dominance
ordering; geometrical approach; Mathematical
Techniques; multiset ordering; Multiset Orderings;
multiset orderings; multisets; set theory; Set Theory;
Tame Orderings",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Clausen:1989:FGF,
author = "Michael Clausen",
title = "Fast generalized {Fourier} transforms",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "1",
pages = "55--63",
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 Karlsruhe",
affiliationaddress = "Karlsruhe, West Ger",
classification = "921; C4190 (Other numerical methods); C4240
(Programming and algorithm theory)",
corpsource = "Fakultat fur Informatik, Karlsruhe Univ., West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "computational complexity; fast Fourier transforms;
Fast Generalized Fourier Transforms; finite group;
Finite Groups; Fourier transforms; Fourier Transforms;
group theory; Linear Complexity; linear complexity;
Mathematical Transformations; subgroups; Symmetric
Groups; trivial upper bound; Wedderburn Transform;
Wedderburn transform",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@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",
}
@Article{Moriya:1989:GCA,
author = "Etsuro Moriya",
title = "A grammatical characterization of alternating pushdown
automata",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "1",
pages = "75--85",
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 = "Tokyo Woman's Christian Univ",
affiliationaddress = "Tokyo, Jpn",
classification = "721; C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Math., Tokyo Woman's Christian Univ., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "alternating context-free languages; alternating
pushdown automata; Alternating Pushdown Automata;
Automata Theory; automata theory; class of languages;
Context Free Grammars; Context Free Languages;
context-free grammar; context-free grammars;
context-free languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Marongiu:1989:CBT,
author = "G. Marongiu and S. Tulipani",
title = "On a conjecture of {Bergstra} and {Tucker}",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "1",
pages = "87--97",
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 of Bologna",
affiliationaddress = "Bologna, Italy",
classification = "723; C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math., Bologna Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "abstract data type; Abstract Data Types; algebra
semantics; computability; Computer Metatheory; Computer
Programming Languages; data structures; data type;
nontrivial case; proof techniques; semicomputable data
type; Semicomputable Data Types; Theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Inoue:1989:LSH,
author = "Katsushi Inoue and Itsuo Takanami and Juraj
Hromkovic",
title = "Leaf-size hierarchy of two-dimensional alternating
{Turing} machines",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "1",
pages = "99--110",
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 = "Yamaguchi Univ",
affiliationaddress = "Ube, Jpn",
classification = "721; C4220 (Automata theory)",
corpsource = "Dept. of Electron., Yamaguchi Univ., Ube, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "alternating; Alternating Turing Machines; Automata
Theory; complexity classes; complexity measure;
Complexity Measures; computational complexity;
leaf-size bounded computations; leaf-size hierarchy;
Turing Machines; Turing machines; two-dimensional",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Pardubska:1989:NMM,
author = "Dana Pardubska and Ivana Stefanekova",
title = "Nondeterministic multicounter machines and
complementation",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "1",
pages = "111--113",
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 = "Comenius Univ",
affiliationaddress = "Bratislava, Czech",
classification = "721; 921; C4210 (Formal logic); C4220 (Automata
theory)",
corpsource = "Dept. of Theor. Cybernetics, Comenius Univ.,
Bratislava, Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; automata theory; complementation;
family of languages; Formal Languages; formal
languages; Mathematical Techniques--Polynomials;
multicounter machines; Nondeterministic Multicounter
Machines; nondeterministic multicounter machines;
polynomial function; Polynomial Functions",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Cosnard:1989:CSX,
author = "M. Cosnard and J. Duprat and A. Ferreira",
title = "Complexity of selection in {X} + {Y}",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "1",
pages = "115--120",
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 = "ENS",
affiliationaddress = "Lyon, Fr",
classification = "723; 921; C4240 (Programming and algorithm theory)",
corpsource = "LIP-IMAG, ENS-Lyon, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "algorithm; Algorithms; complexity; Complexity of
Selection; computational complexity; Computer
Programming; lower bound; Mathematical
Techniques--Matrix Algebra; matrices; searching;
sorting",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Petuaud:1989:ETS,
author = "Catherine Petuaud",
title = "Entropie topologique des syst{\`e}mes specifi{\'e}s.
({French}) [{Topological} entropy of specified
systems]",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "1",
pages = "121--128",
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 = "Lycee Hoche",
affiliationaddress = "Versailles, Fr",
classification = "721; C4210 (Formal logic)",
corpsource = "Lycee Hoche, Versailles, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; finite alphabet; formal languages;
Formal Languages; sofic systems; specification
property; Specification Property; topological
entropies; Topological Entropy",
language = "French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{PinoPerez:1989:DRE,
author = "Ramon {Pino Perez}",
title = "Decidability of the restriction equational theory in
the partial lambda calculus",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "1",
pages = "129--139",
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 = "Liens",
affiliationaddress = "Paris, Fr",
classification = "723; C4210 (Formal logic)",
corpsource = "Liens, Paris, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Computer Metatheory--Programming Theory; Computer
Programming; Decidability; decidability; decidable;
equational theory; Partial Lambda Calculus; partial
lambda calculus; partiality; Restriction Equational
Theory; Theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Madlener:1989:ADP,
author = "K. Madlener and F. Otto",
title = "About the descriptive power of certain classes of
finite string-rewriting systems",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "2--3",
pages = "143--172",
day = "3",
month = oct,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
conflocation = "Bordeaux, France; 25-27 May 1987",
conftitle = "Second International Conference on Rewriting
Techniques and Applications 'RTA-87'",
corpsource = "Fachbereich Inf., Kaiserslautern Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic characterizations; classes; complexity;
computational complexity; decidability; decision
problems; descriptive power; finite canonical
string-rewriting systems; groups; monoids; rewriting
systems; undecidable",
pubcountry = "Netherlands",
sponsororg = "Univ. Bordeaux 1; Univ. Nancy 1; City of Bordeaux;
Greco Math. Inf.; Greco Programmation",
treatment = "B Bibliography; T Theoretical or Mathematical",
}
@Article{Bachmair:1989:CRM,
author = "L. Bachmair and N. Dershowitz",
title = "Completion for rewriting modulo a congruence",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "2--3",
pages = "173--201",
day = "3",
month = oct,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C4210 (Formal
logic)",
conflocation = "Bordeaux, France; 25-27 May 1987",
conftitle = "Second International Conference on Rewriting
Techniques and Applications 'RTA-87'",
corpsource = "Dept. of Comput. Sci., State Univ. of New York, Stony
Brook, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "completion modulo a congruence; correctness proving;
equational inference system; equational theory;
inference mechanisms; Jouannaud-Kirchner procedure;
Peterson-Stickel; rewrite system; rewriting; rewriting
systems; theorem proving; unique normal forms",
pubcountry = "Netherlands",
sponsororg = "Univ. Bordeaux 1; Univ. Nancy 1; City of Bordeaux;
Greco Math. Inf.; Greco Programmation",
treatment = "T Theoretical or Mathematical",
}
@Article{Gallier:1989:CST,
author = "J. H. Gallier and W. Snyder",
title = "Complete sets of transformations for general
{E}-unification",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "2--3",
pages = "203--260",
day = "3",
month = oct,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
intelligence); C4210 (Formal logic)",
conflocation = "Bordeaux, France; 25-27 May 1987",
conftitle = "Second International Conference on Rewriting
Techniques and Applications 'RTA-87'",
corpsource = "Dept. of Comput. and Inf. Sci., Pennsylvania Univ.,
Philadelphia, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arbitrary equational theories; complete; complete set;
completeness; critical pairs; equational proofs;
general E-unification; narrowing; prove; rewriting
systems; set theory; sound; surreduction; systems of
terms; theorem proving; transformations; trees; trees
(mathematics); unfailing completion",
pubcountry = "Netherlands",
sponsororg = "Univ. Bordeaux 1; Univ. Nancy 1; City of Bordeaux;
Greco Math. Inf.; Greco Programmation",
treatment = "T Theoretical or Mathematical",
}
@Article{Choppy:1989:CAT,
author = "C. Choppy and S. Kaplan and M. Soria",
title = "Complexity analysis of term-rewriting systems",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "2--3",
pages = "261--282",
day = "3",
month = oct,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
conflocation = "Bordeaux, France; 25-27 May 1987",
conftitle = "Second International Conference on Rewriting
Techniques and Applications 'RTA-87'",
corpsource = "Lab. de Recherche en Inf., CNRS, Univ. de Paris-Sud,
Orsay, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic specification; asymptotic evaluation;
complexity analysis; computational complexity; cost
series; enumerative series; operator complexity;
regular rewriting systems; rewriting systems;
term-rewriting systems",
pubcountry = "Netherlands",
sponsororg = "Univ. Bordeaux 1; Univ. Nancy 1; City of Bordeaux;
Greco Math. Inf.; Greco Programmation",
treatment = "T Theoretical or Mathematical",
}
@Article{Baeten:1989:TRS,
author = "J. C. M. Baeten and J. A. Bergstra and J. W. Klop and
W. P. Weijland",
title = "Term-rewriting systems with rule priorities",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "2--3",
pages = "283--301",
day = "3",
month = oct,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
conflocation = "Bordeaux, France; 25-27 May 1987",
conftitle = "Second International Conference on Rewriting
Techniques and Applications 'RTA-87'",
corpsource = "Amsterdam Univ., Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded systems; class; partial ordering; rewriting
systems; rule priorities; semantics; term-rewriting
systems",
pubcountry = "Netherlands",
sponsororg = "Univ. Bordeaux 1; Univ. Nancy 1; City of Bordeaux;
Greco Math. Inf.; Greco Programmation",
treatment = "T Theoretical or Mathematical",
}
@Article{Kirchner:1989:SIS,
author = "H. Kirchner",
title = "Schematization of infinite sets of rewrite rules
generated by divergent completion processes",
journal = j-THEOR-COMP-SCI,
volume = "67",
number = "2--3",
pages = "303--332",
day = "3",
month = oct,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
conflocation = "Bordeaux, France; 25-27 May 1987",
conftitle = "Second International Conference on Rewriting
Techniques and Applications 'RTA-87'",
corpsource = "Loria and Crin, Vandoeuvre-les-Nancy, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complete; decidability; divergent completion
processes; equation; equational theory; infinite sets;
rewrite rules; rewriting systems; rules;
satisfiability; schematization; set theory; sound;
validity",
pubcountry = "Netherlands",
sponsororg = "Univ. Bordeaux 1; Univ. Nancy 1; City of Bordeaux;
Greco Math. Inf.; Greco Programmation",
treatment = "B Bibliography; T Theoretical or Mathematical",
}
@Article{Kirschenhofer:1989:BPP,
author = "P. Kirschenhofer and H. Prodinger and W. Szpankowski",
title = "On the balance property of {Patricia} trees: external
path length viewpoint",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "1",
pages = "1--17",
day = "16",
month = oct,
year = "1989",
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/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4130
(Interpolation and function approximation); C4210
(Formal logic)",
corpsource = "Inst fur Algebra and Diskrete Math., Tech. Univ. Wien,
Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "approximation theory; asymptotic approximations;
balance property; exact approximations; external path
length; Patricia trees; probability; trees
(mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Chang:1989:ESS,
author = "J. H. Chang and O. H. Ibarra and M. A. Palis",
title = "Efficient simulations of simple models of parallel
computation by time-bounded {ATMs} and space-bounded
{TMs}",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "1",
pages = "19--36",
day = "16",
month = oct,
year = "1989",
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/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis,
MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alternating Turing machines; boolean circuits;
computational complexity; finite automata; finite-state
machines; interconnected networks; one-way
conglomerates; parallel computation; simple models;
simulations; space-bounded TMs; time-bounded ATMs;
Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Droste:1989:ESD,
author = "M. Droste",
title = "Event structures and domains",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "1",
pages = "37--47",
day = "16",
month = oct,
year = "1989",
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/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Essen Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic complete partial order; computational
processes; concrete data structures; data structures;
denotational semantics; event domain; event
structures",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{Hofer:1989:LIR,
author = "G. Hofer",
title = "Left ideals and reachability in machines",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "1",
pages = "49--56",
day = "16",
month = oct,
year = "1989",
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/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Math., Linz Univ., Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; automation; input set; leftideals;
mappings; near-rings; state set; syntactic near-rings;
zero-symmetric part",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Gambosi:1989:WCA,
author = "G. Gambosi and G. F. Italiano and M. Talamo",
title = "Worst-case analysis of the set-union problem with
extended backtracking",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "1",
pages = "57--70",
day = "16",
month = oct,
year = "1989",
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/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6120
(File organisation)",
corpsource = "Inst. di Analisi dei Sistemi ed Informatica-CNR, Rome,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; data structure; data
structures; extended backtracking; set-union problem;
space complexity; time complexity; worst case
analysis",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Huckenbeck:1989:EGT,
author = "U. Huckenbeck",
title = "{Euclidian} geometry in terms of automata theory",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "1",
pages = "71--87",
day = "16",
month = oct,
year = "1989",
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/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Lehrstuhl fur Informatik I, Wurzburg Univ., West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract automata; automata theory; elementary
geometric problems; Euclidian operations; jumps; oracle
sets",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Karloff:1989:NAB,
author = "H. J. Karloff",
title = "An {NC} algorithm for {Brooks}' theorem",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "1",
pages = "89--103",
day = "16",
month = oct,
year = "1989",
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/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Chicago Univ., IL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Brooks' theorem; coloring; graph; graph colouring; NC
algorithm",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Josephs:1989:SLF,
author = "M. B. Josephs",
title = "The semantics of lazy functional languages",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "1",
pages = "105--111",
day = "16",
month = oct,
year = "1989",
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/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "IBM Res. Div., Yorktown Heights, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "lambda -calculus; lazy functional languages;
programming theory; semantics",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Chlebus:1989:HPH,
author = "B. S. Chlebus",
title = "A hierarchy of propositional {Horn} formulas",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "1",
pages = "113--119",
day = "16",
month = oct,
year = "1989",
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/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Inf., Warsaw Univ., Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded-depth circuits; computational complexity;
equivalent formulas; game; hierarchy; propositional
Horn formulas; satisfiability",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Arvind:1989:SBR,
author = "V. Arvind and S. Biswas",
title = "On some bandwidth restricted versions of the
satisfiability problem of propositional {CNF}
formulas",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "2",
pages = "123--134",
day = "30",
month = oct,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
(Programming and algorithm theory)",
conflocation = "Pune, India; 17-19 Dec. 1987",
conftitle = "Seventh Conference on Foundations of Software
Technology and Theoretical Computer Science",
corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of
Technol., Delhi, India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bandwidth restricted versions; complexity;
computational complexity; corresponding languages;
decision problems; formal logic; kernel
constructibility; logics; proof; propositional CNF
formulas; satisfiability problem; satisfiable
propositional CNF formulas; self-reducibility property;
Turing machine acceptance problems; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Blair:1989:PLP,
author = "H. A. Blair and V. S. Subrahmanian",
title = "Paraconsistent logic programming",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "2",
pages = "135--154",
day = "30",
month = oct,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C4210 (Formal
logic)",
conflocation = "Pune, India; 17-19 Dec. 1987",
conftitle = "Seventh Conference on Foundations of Software
Technology and Theoretical Computer Science",
corpsource = "Sch. of Comput. and Inf. Sci., Syracuse Univ., NY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Horn clauses; inconsistency; literal; logic
programming; many-valued logics; paraconsistent logic
programming; robust semantics; sets; syntactic form;
two-valued logic; very large knowledge bases",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lingas:1989:PCS,
author = "A. Lingas and A. Proskurowski",
title = "On parallel complexity of the subgraph homeomorphism
and the subgraph isomorphism problem for classes of
planar graphs",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "2",
pages = "155--173",
day = "30",
month = oct,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
conflocation = "Pune, India; 17-19 Dec. 1987",
conftitle = "Seventh Conference on Foundations of Software
Technology and Theoretical Computer Science",
corpsource = "Dept. of Comput. and Inf. Sci., Linkoping Univ.,
Sweden",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded number; closed; computational complexity;
disjoint connecting paths; fixed pattern; forbidden
minor characterization; graph theory; NC algorithm;
nontrivial graph family; parallel algorithms; parallel
complexity; planar graphs; polynomial; recognition;
restriction; Robertson; Seymour; subgraph
homeomorphism; subgraph isomorphism problem; terminal
pairs; two-connected outerplanar graphs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Parrow:1989:SCE,
author = "J. Parrow",
title = "Submodule construction as equation solving in {CCS}",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "2",
pages = "175--202",
day = "30",
month = oct,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "B6110 (Information theory); B6150 (Communication
system theory); C1260 (Information theory); C4240
(Programming and algorithm theory)",
conflocation = "Pune, India; 17-19 Dec. 1987",
conftitle = "Seventh Conference on Foundations of Software
Technology and Theoretical Computer Science",
corpsource = "Swedish Inst. of Comput. Sci., Kista, Sweden",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alternating bit protocol; automatic generation; CCS;
channels; equation; equation solving; information
theory; parallel; parallel algorithms; programming
theory; protocols; receivers; semiautomatic program;
submodules; successive transformation; system
specifications; top-down design methodologies",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ramanujam:1989:SDD,
author = "R. Ramanujam",
title = "Semantics of distributed definite clause programs",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "2",
pages = "203--220",
day = "30",
month = oct,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C4240 (Programming
and algorithm theory)",
conflocation = "Pune, India; 17-19 Dec. 1987",
conftitle = "Seventh Conference on Foundations of Software
Technology and Theoretical Computer Science",
corpsource = "Inst. of Math. Sci., CIT Campus, Madras, India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "definite Horn clause program; distributed definite
clause programs; distributed refutations; fixed finite
number; least fixed-point characterization; logic
programming; process model; programming theory;
semantics; sites",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Coquand:1989:CE,
author = "T. Coquand",
title = "Categories of embeddings",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "3",
pages = "221--237",
day = "12",
month = nov,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "INRIA, Le Chesnay, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cartesian closed categories of domains; category
theory; domain theory; exponentiation; formal logic;
polymorphism; set theory; types",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Gutbrod:1989:TSG,
author = "R. Gutbrod",
title = "A transformation system for generating description
languages of chain code pictures",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "3",
pages = "239--252",
day = "12",
month = nov,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4290 (Other computer
theory)",
corpsource = "Lehrstuhl fur Inf., Wurzburg Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cartesian plane; chain code pictures; computational
geometry; connected picture; description languages;
formal languages; geometric information; picture
languages; regular language",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Blanchard:1989:CSS,
author = "F. Blanchard",
title = "Certain sofic systems engendered codes",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "3",
pages = "253--265",
day = "12",
month = nov,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes); C1160 (Combinatorial mathematics);
C4210 (Formal logic)",
corpsource = "Lab. de Probabilit{\'e}s, Paris 6 Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "circular codes; codes; concatenation; encoding; finite
deciphering delay; first return code; local codes;
rational code; right-resolving cover; set theory; sofic
system; state space; unique splitting",
language = "French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Immerman:1989:RRC,
author = "N. Immerman and S. R. Mahaney",
title = "Relativizing relativized computations",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "3",
pages = "267--276",
day = "12",
month = nov,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Comput. and Inf. Sci., Massachusetts Univ., Amherst,
MA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability; decidability; NP- complete problems;
oracle; polynomial-size circuits; polynomial-time
many-one reductions; polynomial-time programs;
relativizable proof techniques; relativized
computations",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hortala-Gonzalez:1989:HLN,
author = "M. T. Hortala-Gonzalez and M. Rodriguez-Artalejo",
title = "{Hoare}'s logic for nondeterministic regular programs:
a nonstandard approach",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "3",
pages = "277--302",
day = "12",
month = nov,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. de Inf. y Autom., Fac. de Matematicas, Univ.
Complutense de Madrid, Spain",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "completeness theorem; continuous semantics; formal
logic; Hoare logic; infinitely long computations;
nondeterministic regular programs; nondeterministic
systems; nonstandard dynamic logic; normal form;
program verification; regular programs; unbounded
nondeterminism",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bracho:1989:CGF,
author = "F. Bracho",
title = "Continuously generated fixed points",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "3",
pages = "303--317",
day = "12",
month = nov,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. de Investigaciones en Matematicas Aplicadas y en
Sistemas, Univ. Nacional Autonoma de Mexico, Mexico
City, Mexico",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "continuous fixed-point operator; continuous function;
domain equations; formal logic; least fixed-point
operator; recursive functions; recursively defined
functions; types",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Narendran:1989:SPT,
author = "P. Narendran and F. Otto",
title = "Some polynomial-time algorithms for finite monadic
{Church--Rosser Thue} systems",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "3",
pages = "319--332",
day = "12",
month = nov,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "General Electric Co., Schenectady, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "decidability; finite monadic Church--Rosser Thue
systems; monadic Thue systems; polynomial time
decidable; polynomial-time algorithms; reduction
sequences; rewriting systems; undecidable; uniform
conjugacy problem; uniform decision problems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Solitro:1989:TCB,
author = "U. Solitro",
title = "A typed calculus based on a fragment of linear logic",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "3",
pages = "333--342",
day = "12",
month = nov,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dipartimento di Scienze dell'Inf., Milano Univ.,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "canonical proof representation; Church--Rosser
properties; cut-elimination; deduction system; formal
logic; linear logic; multiplicative second order
subsystem; negation; nu -calculus; strong
normalization; typed calculus",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Gafni:1989:SEC,
author = "E. Gafni and J. Naor and P. Ragde",
title = "On separating the {EREW} and {CREW PRAM} models",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "3",
pages = "343--346",
day = "12",
month = nov,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., California Univ., Los Angeles,
CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; CREW PRAM; decidability;
decision tree problem; EREW PRAM; parallel processing;
partial function; search problems; Selection Problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Rupert:1989:CRF,
author = "C. P. Rupert",
title = "Comment on a remark of Forys",
journal = j-THEOR-COMP-SCI,
volume = "68",
number = "3",
pages = "347--348",
day = "12",
month = nov,
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 = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C1160 (Combinatorial mathematics);
C4210 (Formal logic)",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alphabetic morphisms; cardinality; factorization;
fixed point languages; formal logic; group theory;
rational transduction",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Vieille:1989:RQP,
author = "L. Vieille",
title = "Recursive query processing: the power of logic",
journal = j-THEOR-COMP-SCI,
volume = "69",
number = "1",
pages = "1--53",
day = "5",
month = dec,
year = "1989",
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/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4250 (Database theory); C6160Z (Other DBMS); C6170
(Expert systems)",
corpsource = "Eur. Comput.-Ind. Res. Centre GmbH, Muenchen, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract search spaces; computational model; database
management systems; database theory; deductive
databases; function-free clauses; global optimization
technique; knowledge based systems; logic; logic
programming; logic programs; QoSaQ; query answering
procedures; query languages; resolution",
pubcountry = "Netherlands",
treatment = "B Bibliography; T Theoretical or Mathematical",
}
@Article{Kerisit:1989:RAL,
author = "J.-M. Kerisit",
title = "A relational approach to logic programming: the
extended {Alexander} method",
journal = j-THEOR-COMP-SCI,
volume = "69",
number = "1",
pages = "55--68",
day = "5",
month = dec,
year = "1989",
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/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6110
(Systems analysis and programming); C6170 (Expert
systems)",
corpsource = "BULL CEDIAG, Louveciennes, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "completeness; extended Alexander method; forward
chaining; logic programming; logic resolution;
programming theory; relational approach; relational
calculus; soundness",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Kaplan:1989:ASC,
author = "S. Kaplan",
title = "Algebraic specification of concurrent systems",
journal = j-THEOR-COMP-SCI,
volume = "69",
number = "1",
pages = "69--115",
day = "5",
month = dec,
year = "1989",
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/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6110
(Systems analysis and programming)",
corpsource = "Dept. of Comput. Sci., Hebrew Univ., Jerusalem,
Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic specifications; application operator;
complex specification; concurrent systems; formal
specification; hierarchical layers; implementation;
methodological issues; observational congruence;
parallel programming; process specifications;
semantics; serializability proof; stepwise
development",
pubcountry = "Netherlands",
treatment = "B Bibliography; T Theoretical or Mathematical",
}
@Article{Nielson:1989:TLS,
author = "F. Nielson",
title = "Two-level semantics and abstract interpretation",
journal = j-THEOR-COMP-SCI,
volume = "69",
number = "2",
pages = "117--242",
day = "11",
month = dec,
year = "1989",
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/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6150G
(Diagnostic, testing, debugging and evaluating
systems)",
corpsource = "Dept. of Comput. Sci., Tech. Univ. of Denmark, Lyngby,
Denmark",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract interpretation; binding time; collecting
semantics; compile-time; correctness; data flow
analysis; denotational semantics; implementable
analysis; most precise analysis; partial evaluation;
program analysis; program verification; run-time;
static semantics",
pubcountry = "Netherlands",
treatment = "B Bibliography; P Practical; T Theoretical or
Mathematical",
}
@Article{Felleisen:1989:STS,
author = "M. Felleisen and D. P. Friedman",
title = "A syntactic theory of sequential state",
journal = j-THEOR-COMP-SCI,
volume = "69",
number = "3",
pages = "243--287",
day = "18",
month = dec,
year = "1989",
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/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "assignment statement; consistency; equational lambda
-calculus-theory; functionally oriented programming
languages; imperative-functional programs; programming
languages; programming theory; reasoning; sequential
state; side-effects; standardization theorems; state
variables; syntactic proof system; syntactic theory;
theorem proving",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Falaschi:1989:DMO,
author = "M. Falaschi and G. Levi and C. Palamidessi and M.
Martelli",
title = "Declarative modeling of the operational behavior of
logic languages",
journal = j-THEOR-COMP-SCI,
volume = "69",
number = "3",
pages = "289--318",
day = "18",
month = dec,
year = "1989",
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/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dipartimento di Inf., Pisa Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "completeness; computational linguistics; computed
answer substitutions; declarative semantics; fixpoint
characterization; Herbrand model semantics;
interpretations; logic languages; logic programming;
logic programs; non-ground atoms; operational behavior;
programming theory; SLD-resolution; soundness",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Baker:1989:GPA,
author = "K. A. Baker and G. F. McNulty and W. Taylor",
title = "Growth problems for avoidable words",
journal = j-THEOR-COMP-SCI,
volume = "69",
number = "3",
pages = "319--345",
day = "18",
month = dec,
year = "1989",
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/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Math., California Univ., Los Angeles, CA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alphabet size; avoidable words; existence; formal
languages; free semigroups; group theory; growth
problems; homomorphism; polynomial bound; square-free
words",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Chrobak:2003:EFA,
author = "Marek Chrobak",
title = "Errata to: {``Finite Automata and Unary Languages''}:
{[Theoret. Comput. Sci. 47 (1986) 149--158]}",
journal = j-THEOR-COMP-SCI,
volume = "302",
number = "1--3",
pages = "497--498",
day = "13",
month = jun,
year = "2003",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Nov 5 08:45:40 MST 2003",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
note = "See \cite{Chrobak:1986:FAU}.",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
@Proceedings{Gruska:1988:ISM,
editor = "Josef Gruska",
booktitle = "International symposium on mathematical foundations of
computer science, {MFCS} '86",
title = "International symposium on mathematical foundations of
computer science, {MFCS} '86",
volume = "57(1)",
publisher = pub-NH,
address = pub-NH:adr,
pages = "3--159",
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Nov 21 19:02:53 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
series = j-THEOR-COMP-SCI,
acknowledgement = ack-nhfb,
classification = "714; 721; 723; 921",
conference = "International Symposium on Mathematical Foundations of
Computer Science, MFCS '86",
conferenceyear = "1988",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; Complexity; Computer Metatheory;
Computer Programming --- Algorithms; Computer Systems,
Digital --- Parallel Processing; Integrated Circuits,
vlsi; Iterative Arrays; Mathematical Techniques;
Ordered Trees; Probabilistic Automata; Shortest Common
Superstrings",
meetingaddress = "Bratislava, Czech",
meetingdate = "Aug 25--29 1986",
meetingdate2 = "08/25--29/86",
}
@Proceedings{Kott:1988:TIC,
editor = "Laurent Kott",
booktitle = "{Thirteenth international colloquium on automata,
languages and programming}",
title = "{Thirteenth international colloquium on automata,
languages and programming}",
volume = "58(1--3)",
publisher = pub-NH,
address = pub-NH:adr,
pages = "3--397",
month = jun,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Nov 21 19:02:53 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
series = j-THEOR-COMP-SCI,
acknowledgement = ack-nhfb,
classification = "721; 723; 921",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conferenceyear = "1988",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory--Formal Languages; Complexity;
Computer Metatheory; Computer Programming
Languages--Theory; Computer Programming--Algorithms;
Concurrent Programming; Data Processing--Data
Structures; Database Access; Distributed Computing;
Mathematical Techniques--Graph Theory; Parallel
Algorithms",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
}
@Proceedings{Levi:1988:IJC,
editor = "Georgio Levi and Ugo Montanari",
booktitle = "International joint conference on theory and practice
of software development --- {TAPSOFT} '87",
title = "International joint conference on theory and practice
of software development --- {TAPSOFT} '87",
volume = "59(1--2)",
publisher = pub-NH,
address = pub-NH:adr,
pages = "3--209",
month = jul,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Nov 21 19:02:53 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
series = j-THEOR-COMP-SCI,
acknowledgement = ack-nhfb,
classification = "723",
conference = "International Joint Conference on Theory and Practice
of Software Development --- TAPSOFT '87",
conferenceyear = "1988",
journalabr = "Theor Comput Sci",
keywords = "Computer Metatheory; Computer Programming
Languages--Theory; Computer Programming--Theory;
Computer Software; Concurrency; Linear Abstract
Machine; Logic Programs; Temporal Logic; Theory;
Unification",
meetingaddress = "Pisa, Italy",
meetingdate = "Mar 23--27 1987",
meetingdate2 = "03/23--27/87",
sponsor = "Univ di Pisa, Pisa, Italy; IEI-CNR; CNUCE-CNR; EATS;
AICA",
}
@Proceedings{Ausiello:1988:SPP,
editor = "Giorgio Ausiello",
booktitle = "Selected papers presented at the first international
conference on database theory",
title = "Selected papers presented at the first international
conference on database theory",
volume = "62(1--2)",
publisher = pub-NH,
address = pub-NH:adr,
pages = "3--233",
month = dec,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Nov 21 19:02:53 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
series = j-THEOR-COMP-SCI,
acknowledgement = ack-nhfb,
classification = "721; 723",
conference = "Selected Papers presented at the First International
Conference on Database Theory",
conferenceyear = "1988",
journalabr = "Theor Comput Sci",
keywords = "Artificial Intelligence; Automata Theory; bcnf
Database Schemes; Computer Metatheory--Formal Logic;
Computer Programming--Algorithms; Data Processing--Data
Structures; Database Systems; Hierarchical Database
Objects; Multivalued Dependencies; Nested Transactions;
Recursive Logic Queries; Theory",
meetingaddress = "Rome, Italy",
meetingdate = "Sep 1986",
meetingdate2 = "09/86",
sponsor = "European Assoc for Theoretical Computer Science",
}
@Proceedings{Liardet:1989:CAC,
editor = "P. Liardet and G. Rauzy",
booktitle = "{Conference on Arithmetics and Coding Systems}",
title = "{Conference on Arithmetics and Coding Systems}",
volume = "65(2)",
publisher = pub-NH,
address = pub-NH:adr,
pages = "123--270",
month = jun,
year = "1989",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Nov 21 19:02:53 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
series = j-THEOR-COMP-SCI,
acknowledgement = ack-nhfb,
classification = "721; 723; 921; 922",
conference = "Conference on Arithmetics and Coding Systems",
conferenceyear = "1989",
journalabr = "Theor Comput Sci",
keywords = "Arithmetic; Automata Theory; Codes, Symbolic; Computer
Metatheory; Euler Identities; Mathematical
Techniques--Number Theory; Probability; Rational
Functions; Sequences; Sofic Systems",
meetingaddress = "Marseille, Fr",
meetingdate = "Jun 9--13 1987",
meetingdate2 = "06/09--13/87",
}
@Proceedings{Ottmann:1989:ICA,
editor = "Thomas Ottmann",
booktitle = "14th International Colloquium on Automata, Languages
and Programming",
title = "14th International Colloquium on Automata, Languages
and Programming",
volume = "66(2)",
publisher = pub-NH,
address = pub-NH:adr,
pages = "117--232",
month = aug,
year = "1989",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Fri Nov 21 19:02:53 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
series = j-THEOR-COMP-SCI,
acknowledgement = ack-nhfb,
classification = "721; 723; 921",
conference = "14th International Colloquium on Automata, Languages
and Programming",
conferenceyear = "1989",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; Binary Search Trees; Computer
Metatheory; Computer Programming; Computer Systems,
Digital--Parallel Processing; Concurrent Processes;
Data Processing--Data Structures; Mathematical
Techniques; Model Theory of Knowledge; Shortest Tours;
Sorting of Sums",
meetingaddress = "Karlsruhe, West Ger",
meetingdate = "Jun 1987",
meetingdate2 = "06/87",
}
