@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
}" #
"\ifx \undefined \ocirc \def \ocirc #1{{\accent'27#1}}\fi" #
"\ifx \undefined \r \let \r = \ocirc \fi"
}
@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@ieee.org| (Internet),
URL: \path|http://www.math.utah.edu/~beebe/|"}
@String{j-THEOR-COMP-SCI = "Theoretical Computer Science"}
@Article{Schnorr:1980:ACP,
author = "C. P. Schnorr and J. P. {Van de Wiele}",
title = "On the additive complexity of polynomials",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "1",
pages = "1--18",
month = jan,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory)",
corpsource = "Fachbereich Math., Univ. Frankfurt, Frankfurt, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "additive complexity; algebraically independent
coefficients; computational complexity; lower bounds;
polynomials",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Brzozowski:1980:ERL,
author = "J. A. Brzozowski and E. Leiss",
title = "On equations for regular languages, finite automata,
and sequential networks",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "1",
pages = "19--35",
month = jan,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean automaton; Boolean functions; empty set; empty
word; finite automata; formal languages;
nondeterministic automaton; regular languages;
sequential networks; underlying alphabet",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kurka:1980:APC,
author = "P. K{\r{u}}rka",
title = "Applicability of a production in a categorical
grammar",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "1",
pages = "37--44",
month = jan,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Center of Biomath., Acad. of Sci., Praha,
Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "categorical grammar; grammars; production; topological
condition",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrenfeucht:1980:ETE,
author = "A. Ehrenfeucht and G. Rozenberg",
title = "Every two equivalent {D0L} systems have a regular true
envelope",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "1",
pages = "45--52",
month = jan,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder,
CO, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "equivalent D0L systems; formal languages; regular true
envelope",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hartmann:1980:MCS,
author = "W. Hartmann and P. Schuster",
title = "Multiplicative complexity of some rational functions",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "1",
pages = "53--61",
month = jan,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory)",
corpsource = "Seminar fur Angewandte Math., Univ. Zurich, Zurich,
Switzerland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "compositions; computational complexity; continued
fractions; multiplicative complexity; polynomials;
products; quotients; rational functions; sharp bounds;
Strassen's theorem; substitution method",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Zaks:1980:LGO,
author = "S. Zaks",
title = "Lexicographic generation of ordered trees",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "1",
pages = "63--82",
month = jan,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Illinois, Urbana, IL,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal logic; generating algorithm; internal nodes;
lexicographic generation; ordered trees; ranking
function; regular binary trees; trees (mathematics);
unranking procedure",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Schnorr:1980:LBN,
author = "C. P. Schnorr",
title = "A $3n$-lower bound on the network complexity of
{Boolean} functions",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "1",
pages = "83--92",
month = jan,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Fachbereich Math., Univ. Frankfurt, Frankfurt, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "3n lower bound; Boolean functions; computational
complexity; network complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Biskup:1980:IMD,
author = "J. Biskup",
title = "Inferences of multivalued dependencies in fixed and
undetermined universes",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "1",
pages = "93--105",
month = jan,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6160D (Relational
databases)",
corpsource = "Lehrstuhl fur Angewandte Mathematik, Tech. Hochschule
Aachen, Aachen, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complementation rule; completeness; database
management systems; database relations; DBMS; fixed
universes; formal logic; inference rules; multivalued
dependencies; subset rule; undetermined universes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Prodinger:1980:IDS,
author = "H. Prodinger",
title = "On the interpolation of {D0L-sequences}",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "1",
pages = "107--108",
month = jan,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. fur Math. Logik und Formale Sprachen, Tech. Univ
Wien, Wien, Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "D0L sequences; formal languages; interpolation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Fortune:1980:DSH,
author = "S. Fortune and J. Hopcroft and J. Wyllie",
title = "The directed subgraph homeomorphism problem",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "2",
pages = "111--121",
month = feb,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "directed acyclic graph; directed graphs; directed
subgraph homeomorphism problem; NP completeness;
pattern graphs; polynomial time algorithm",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lieberherr:1980:POH,
author = "K. Lieberherr",
title = "{P}-optimal heuristics",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "2",
pages = "123--131",
month = feb,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques)",
corpsource = "Dept. of Math., Florida State Univ., Tallahassee, FL,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "invariant problem; linear inequalities; optimal
solution; optimisation; P-optimal heuristics;
transformations",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Wiedmer:1980:CIO,
author = "E. Wiedmer",
title = "Computing with infinite objects",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "2",
pages = "133--155",
month = feb,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Abteilung fuer Forschung und Studien, Hasler AG, Bern,
Switzerland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability; computability and decidability;
computable function; infinite length; infinite objects;
parallel processes; real numbers; topology",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{deLuca:1980:SPV,
author = "A. {de Luca} and A. Restivo",
title = "On some properties of very pure codes",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "2",
pages = "157--170",
month = feb,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B6120B (Codes)",
corpsource = "Lab. di Cibernetica, CNR, Naples, Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "codes; maximality; synchronization; very pure codes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Staples:1980:CGL,
author = "J. Staples",
title = "Computation on graph-like expressions",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "2",
pages = "171--185",
month = feb,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math. and Computer Sci., Queensland Inst. of
Technol., Brisbane, Qld., Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "commutativity; computational steps; graph theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Havel:1980:BL,
author = "I. M. Havel",
title = "On branching and looping. {I}",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "2",
pages = "187--220",
month = feb,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Acad. of Sci., Prague, Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "branching; discrete processes; finite branching
automata; formal languages; languages; looping",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kozen:1980:CBA,
author = "D. Kozen",
title = "Complexity of {Boolean} algebras",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "3",
pages = "221--247",
month = mar,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; Berman complexity class; Boolean
algebra; Boolean algebras; computational complexity;
Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Cohen:1980:COT,
author = "R. Cohen and A. Gold",
title = "On the complexity of omega-type {Turing} acceptors",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "3",
pages = "249--272",
month = mar,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Toronto, Toronto,
Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; Turing acceptors; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Havel:1980:BLI,
author = "I. M. Havel",
title = "On branching and looping. {II}",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "3",
pages = "273--295",
month = mar,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Acad. of Sci., Prague, Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "branching; finite automata; finite branching
automation; looping",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Staples:1980:OEG,
author = "J. Staples",
title = "Optimal evaluation of graph-like expressions",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "3",
pages = "297--316",
month = mar,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math. and Computer Sci., Queensland Inst. of
Technol., Brisbane, Qld., Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "evaluation algorithm; formal logic; graph like
expressions; graph theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{King:1980:ITF,
author = "K. N. King",
title = "Iteration theorems for families of strict
deterministic languages",
journal = j-THEOR-COMP-SCI,
volume = "10",
number = "3",
pages = "317--333",
month = mar,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Electrical Engng. and Computer Sci., Univ. of
California, Berkeley, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic languages; formal languages; iteration
theorems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Dobkin:1980:CLP,
author = "D. P. Dobkin and S. P. Reiss",
title = "The complexity of linear programming",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "1",
pages = "1--18",
month = may,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4240 (Programming
and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Arizona, Tucson, AZ,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; computational complexity; convex hulls of
polytopes; linear programming; LP completeness",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Staples:1980:SSR,
author = "J. Staples",
title = "Speeding up subtree replacement systems",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "1",
pages = "39--47",
month = may,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Math. and Computer Sci., Queensland Inst. of
Technol., Brisbane, Qld., Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "correctness; graph like expressions; graph theory;
optimal evaluation algorithms; subtree replacement
systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Berman:1980:CLT,
author = "L. Berman",
title = "The complexity of logical theories",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "1",
pages = "71--77",
month = may,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Computer 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 = "alternating TM; complexity; computational complexity;
decision procedures; decision theory and analysis;
Ehrenfencht games; encoding; formal logic; logical
theories",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kucera:1980:CDT,
author = "L. Kucera and J. Nesetril and A. Pultr",
title = "Complexity of dimension three and some related
edge-covering characteristics of graphs",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "1",
pages = "93--106",
month = may,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics); C4240 (Programming and
algorithm theory)",
corpsource = "Charles Univ., Prague, Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; dimension three; edge
covering characteristics; graph theory; graphs; NP
completeness; polynomial time",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hotz:1980:NIC,
author = "G. Hotz",
title = "A new invariant for context free languages",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "1",
pages = "107--116",
month = may,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Fachbereich Math. und Informatik, Univ. des
Saarlandes, Saarbrucken, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context free grammars; context free languages;
context-free grammars; context-free languages;
grammar",
language = "German",
pubcountry = "Netherlands",
treatment = "N New Development; T Theoretical or Mathematical",
}
@Article{Harary:1980:GTM,
author = "F. Harary",
title = "Graph theoretic models",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "2",
pages = "117--121",
month = jun,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Math., Univ. of Michigan, Ann Arbor, MI,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "graph theoretic models; graph theory",
pubcountry = "Netherlands",
treatment = "G General Review",
}
@Article{Borger:1980:RPP,
author = "E. Borger and H. {Kleine Buning}",
title = "The reachability problem for {Petri} nets and decision
problems for {Skolem} arithmetic",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "2",
pages = "123--143",
month = jun,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Jul 20 12:57:21 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Lehrstuhl Informatik II, Univ. Dortmund, Dortmund,
West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "binary disjunctions; decision problems; formal logic;
graph theory; Horn formulae; monadic predicate symbols;
Petri nets; prenex conjunctive normal form; quantifier
free matrix; reachability problem; Skolem arithmetic",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Rosenberg:1980:UDE,
author = "A. L. Rosenberg and L. J. Stockmeyer and L. Snyder",
title = "Uniform data encodings",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "2",
pages = "145--165",
month = jun,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6130 (Data handling
techniques)",
corpsource = "Math. Sci. Dept., IBM Thomas J. Watson Res. Center,
Yorktown Heights, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "data encodings; data structure; data structures; edge
dilation; edge labelled graphs; encoding; graph theory;
nonpolynomial; vertices",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{Beynon:1980:SFF,
author = "W. M. Beynon",
title = "On the structure of free finite state machines",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "2",
pages = "167--180",
month = jun,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Warwick, Coventry,
UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Abelian groups; disjoint copies; finite automata;
finite semigroups; free finite state machines;
necessary and sufficient conditions; transition monoid
machine; universal presentation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Arnold:1980:MII,
author = "A. Arnold and M. Nivat",
title = "Metric interpretations of infinite trees and semantics
of nondeterministic recursive programs",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "2",
pages = "181--205",
month = jun,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Lab. d'Informatique, Univ. de Poitiers, Poitiers,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "infinite computations; infinite trees; non
deterministic recursive programs; programming theory;
semantics; trees (mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bougaut:1980:EAP,
author = "B. Bougaut",
title = "An explicit algorithm for {PGCD} research in certain
principal rings between groups of numbers",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "2",
pages = "207--220",
month = jun,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. Nat. des Sci. Appl., Rennes, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computation; division algorithm; Euclid algorithm;
group theory; integers; number fields; rings",
language = "French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hennessy:1980:MSN,
author = "M. C. B. Hennessy and E. A. Ashcroft",
title = "A mathematical semantics for a nondeterministic typed
$\lambda$-calculus",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "3",
pages = "227--245",
month = jul,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Univ. Federal de Pernambuco, Pernambuco, Brazil",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic language; formal languages; lambda
calculus; mathematical semantics; nondeterministic
algorithms",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrig:1980:PCG,
author = "H. Ehrig and B. K. Rosen",
title = "Parallelism and concurrency of graph manipulations",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "3",
pages = "247--275",
month = jul,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Fachbereich Informatik, Tech. Univ. Berlin, Berlin,
West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Church Rosser theorem; concurrency; grammars; graph
derivation sequence; graph grammar theory; graph
manipulations; graph theory; parallelism; pullback
lemmas; sequential independence",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{Kozen:1980:ISC,
author = "D. Kozen",
title = "Indexings of subrecursive classes",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "3",
pages = "277--301",
month = jul,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "combinatorial completeness; deciding halting; deciding
membership; diagonalization; formal languages; Godel
numbering; lambda calculus; programming language;
Rice's theorem; subrecursive classes; subrecursive
indexing",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{Blum:1980:ANR,
author = "N. Blum and K. Mehlhorn",
title = "On the average number of rebalancing operations in
weight-balanced trees",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "3",
pages = "303--320",
month = jul,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Fachbereich 10, Univ. des Saarlandes, Saarbrucken,
West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "average number; double rotations; rebalancing
operation; trees (mathematics); weight balanced trees",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{Heintz:1980:LBP,
author = "J. Heintz and M. Sieveking",
title = "Lower bounds for polynomials with algebraic
coefficients",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "3",
pages = "321--330",
month = jul,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.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 = "algebraic coefficients; complexity; computational
complexity; linear equations; polynomials",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{vonzurGathen:1980:SPH,
author = "J. {von zur Gathen} and V. Strassen",
title = "Some polynomials that are hard to compute",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "3",
pages = "331--335",
month = jul,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0290F (Interpolation and function approximation);
C4130 (Interpolation and function approximation); C4210
(Formal logic)",
corpsource = "Seminar fur Angewandte Math., Univ. Zurich, Zurich,
Switzerland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability and decidability; polynomials",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{Netto:1980:TIM,
author = "A. B. Netto",
title = "There are infinitely many complete prefix codes of
constant length $\ell (\ell\ge3)$",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "3",
pages = "337--339",
month = jul,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C4210 (Formal logic)",
corpsource = "Inst. de Matematica e Estatistica, Univ. de Sao Paulo,
Sao Paulo, Brazil",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "constant length; polynomials; prefix codes; trees
(mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ben-Ari:1980:CTT,
author = "M. Ben-Ari",
title = "Comments on {`Tautology testing with a generalized
matrix reduction method'}",
journal = j-THEOR-COMP-SCI,
volume = "11",
number = "3",
pages = "341--??",
month = jul,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math. Sci., Tel Aviv Univ., Ramat Aviv,
Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal languages; generalized matrix reduction method;
proof system; propositional calculus; tautology
testing",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Jaffe:1980:EST,
author = "J. M. Jaffe",
title = "Efficient scheduling of tasks without full use of
processor resources",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "1",
pages = "1--17",
month = sep,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4200 (Computer theory); C6150J (Operating
systems)",
corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computation theory; multiprocessing programs;
nonpreemptive scheduling; operating systems
(computers); polynomial time algorithms; processor
resources; scheduling; tasks",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Saheb-Djahromi:1980:CMN,
author = "N. Saheb-Djahromi",
title = "{CPOs} of measures for nondeterminism",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "1",
pages = "19--37",
month = sep,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1140Z (Other topics in statistics); C4240
(Programming and algorithm theory)",
corpsource = "Faculty of Sci., Univ. of Tehran, Tehran, Iran",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complete partial order; CPO; nondeterminism;
probability; probability distributions; programming
theory; semantics",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Winkowski:1980:BCS,
author = "J. Winkowski",
title = "Behaviours of concurrent systems",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "1",
pages = "39--60",
month = sep,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C5420 (Mainframes and minicomputers)",
corpsource = "Inst. Podstaw Informatyki PAN, Warszawa, Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "concurrent systems; parallel processing; sequential
processing",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Harel:1980:PCR,
author = "D. Harel",
title = "Proving the correctness of regular deterministic
programs: a unifying survey using dynamic logic",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "1",
pages = "61--81",
month = sep,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithmic logic; correctness proving; dynamic logic;
formal logic; programming logic; programming theory;
regular deterministic programs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ausiello:1980:TUA,
author = "G. Ausiello and A. Marchetti-Spaccamela",
title = "Toward a unified approach for the classification of
{NP}-complete optimization problems",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "1",
pages = "83--96",
month = sep,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Oct 24 12:51:05 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques)",
corpsource = "Istituto di Automatica, CNR, Roma, Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "classification; combinatorial mathematics; NP complete
problems; optimisation; optimization; unified
approach",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Monier:1980:ECT,
author = "L. Monier",
title = "Evaluation and comparison of two efficient
probabilistic primality testing algorithms",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "1",
pages = "97--108",
month = sep,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1140Z (Other topics in statistics); C4240
(Programming and algorithm theory); C5230 (Digital
arithmetic methods)",
corpsource = "Lab. de Recherche en Informatique, Univ. de Paris-Sud,
Orsay, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; number theory; probabilistic
primality testing algorithms; probability",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Grant:1980:SMI,
author = "P. W. Grant",
title = "Some more independence results in complexity theory",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "2",
pages = "119--126",
month = oct,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. Coll. of Swansea,
Swansea, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity theory; computational complexity;
independence results",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrenfeucht:1980:AES,
author = "A. Ehrenfeucht and G. Rozenberg",
title = "On ambiguity in {E0L} systems",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "2",
pages = "127--134",
month = oct,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder,
CO, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "ambiguity; context free grammars; context free
language; context-free grammars; context-free
languages; E0L systems; negative prefix property",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Maurer:1980:SEF,
author = "H. A. Maurer and A. Salomaa and D. Wood",
title = "Synchronized {E0L} forms",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "2",
pages = "135--159",
month = oct,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. for Informationsverarbeitung, Tech. Univ. Graz,
Graz, Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "ambiguity; E0L systems; formal languages; languages;
synchronised E0L forms; syntax analysis",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Angluin:1980:CPP,
author = "D. Angluin",
title = "On counting problems and the polynomial-time
hierarchy",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "2",
pages = "161--173",
month = oct,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer Sci., Edinburgh Univ., Edinburgh,
UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; polynomial time hierarchy;
polynomials; probabilistic Turing machines; sets;
Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Cousineau:1980:ADC,
author = "G. Cousineau",
title = "An algebraic definition for control structures",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "2",
pages = "175--192",
month = oct,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Lab. Informatique Th{\'e}orique et Programmation,
Univ. Pierre et Marie Curie, Paris, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic definition; computation tree; concatenation;
control structures; explicit loops; infinite trees;
rational trees; recursive definition; star operation;
trees (mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Beatty:1980:TIT,
author = "J. C. Beatty",
title = "Two iteration theorems for the {LL(k}) languages",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "2",
pages = "193--228",
month = oct,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4100 (Numerical analysis); C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "derivation trees; formal languages; grammar; grammars;
iteration theorems; iterative methods; LL(k) languages;
trees (mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Tiuryn:1980:UFP,
author = "J. Tiuryn",
title = "Unique fixed points vs. least fixed points",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "3",
pages = "229--254",
month = nov,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4210 (Formal logic)",
corpsource = "Lehrstuhl fur Informatik II, RWTH Aachen, Aachen, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebra; algebras; extensions; formal languages; least
fixed points; programming languages; semantics; unique
fixed point",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Dobkin:1980:DM,
author = "D. Dobkin and J. I. Munro",
title = "Determining the mode",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "3",
pages = "255--263",
month = nov,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Arizona, Tucson, AZ,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; computational complexity; computing modes;
multisets; sorting",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Joshi:1980:LCP,
author = "A. K. Joshi and L. S. Levy and K. Yueh",
title = "Local constraints in programming languages. {I}.
Syntax",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "3",
pages = "265--290",
month = nov,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer and Information Sci., Univ. of
Pennsylvania, Philadelphia, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "ALGOL 60; context free languages; context-free
grammars; context-free languages; correctness proof;
grammatical structure; local constraints; parsing
algorithm; programming languages; syntax; tree",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Oppen:1980:CCC,
author = "D. C. Oppen",
title = "Complexity, convexity and combinations of theories",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "3",
pages = "291--302",
month = nov,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "combinations; complexity; computability and
decidability; computational complexity; convexity;
decidable combinations; quantifier free theory;
satisfiability problem; theorem proving; theories",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Valiant:1980:NCE,
author = "L. G. Valiant",
title = "Negation can be exponentially powerful",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "3",
pages = "303--314",
month = nov,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation)",
corpsource = "Computer Sci. Dept., Edinburgh Univ., Edinburgh, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "efficiency; exponential gain; multivariate
polynomials; negations; perfect matchings; planar
graphs; polynomials",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Munro:1980:SSL,
author = "J. I. Munro and M. S. Paterson",
title = "Selection and sorting with limited storage",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "3",
pages = "315--323",
month = nov,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "file; file organisation; internal storage;
probabilistic methods; selection; sorting; storage",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Boe:1980:MCS,
author = "J. M. Boe and A. {de Luca} and A. Restivo",
title = "Minimal complete sets of words",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "3",
pages = "325--332",
month = nov,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1260 (Information theory); C6130 (Data handling
techniques)",
corpsource = "Univ. des Sci. et Tech. du Languedoc, Montpellier,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "codes; free monoid; information theory; minimal
complete sets; words",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Gill:1980:DST,
author = "J. Gill and J. Hunt and J. Simon",
title = "Deterministic simulation of tape-bounded probabilistic
{Turing} machine transducers",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "3",
pages = "333--338",
month = nov,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Electrical Engng., Stanford Univ., Stanford,
CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic simulation; probabilistic Turing machine
transducers; tape bounded machines; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrenfeucht:1980:BDS,
author = "A. Ehrenfeucht and G. Rozenberg",
title = "On a bound for the {D0L} sequence equivalence
problem",
journal = j-THEOR-COMP-SCI,
volume = "12",
number = "3",
pages = "339--342",
month = nov,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder,
CO, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "D0L sequence; equivalence problem; explicit bound;
formal languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Wadge:1980:ETD,
author = "W. W. Wadge",
title = "An extensional treatment of dataflow deadlock",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "1",
pages = "3--15",
month = jan,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Computer Sci. Dept., Univ. of Warwick, Coventry, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "completeness; cycle sum test; dataflow deadlock;
dependency graph; extensional treatment; program;
programming theory; semantics",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lynch:1980:DBI,
author = "N. A. Lynch and M. J. Fischer",
title = "On describing the behaviour and implementation of
distributed systems",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "1",
pages = "17--43",
month = jan,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4200 (Computer theory)",
corpsource = "Georgia Inst. of Technol., Atlanta, GA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computation theory; design specification; distributed
processing; distributed systems; machinery;
subsystems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Pnueli:1980:TSC,
author = "A. Pnueli",
title = "The temporal semantics of concurrent programs",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "1",
pages = "45--60",
month = jan,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Computer Sci. Div., Tel-Aviv Univ., Tel-Aviv, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "concurrent programs; logic framework; programming
theory; state sequences; Temporal Logic; temporal
semantics",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Maggiolo-Schettini:1980:MSC,
author = "A. Maggiolo-Schettini and H. Wedde and J. Winkowski",
title = "Modeling a solution for a control problem in
distributed systems by restrictions",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "1",
pages = "61--83",
month = jan,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. di Sci. dell'Informazione, Univ. di Pisa, Pisa,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "concurrency; constraint module; control problem;
correctness; distributed processing; distributed
systems; event structure; fairness; Loosely Coupled
Systems; programming theory; restricted case graph;
restrictions; slack phase techniques",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Nielsen:1980:PNE,
author = "M. Nielsen and G. Plotkin and G. Winskel",
title = "{Petri} nets, event structures and domains. {I}",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "1",
pages = "85--108",
month = jan,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Aarhus, Aarhus,
Denmark",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "causal nets; concurrency; confusion; domain theory;
domains; event structures; formal logic; languages; net
theory; occurrence nets; Petri nets; transition nets;
translations",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Genrich:1980:SMH,
author = "H. J. Genrich and K. Lautenbach",
title = "System modelling with high-level {Petri} nets",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "1",
pages = "109--136",
month = jan,
year = "1980",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4210 (Formal logic)",
corpsource = "Inst. fur Informationssytemforschung, Gesellschaft fur
Math. und Datenverarbeitung, St. Augustin, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "concurrent systems; distributed data base; formal
logic; high-level Petri net; linear algebra;
linear-algebraic techniques; Petri nets;
predicate/transition-nets; resource management; system
modelling; variable extension",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Straubing:1981:GSP,
author = "H. Straubing",
title = "A generalization of the Schutzenberger product of
finite monoids",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "2",
pages = "137--150",
month = feb,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Math., Reed Coll., Portland, OR, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "concatenation product; dot depth hierarchy; finite
monoids; free monoid; Schutzenberger product; set
theory; star free sets",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Stoy:1981:CTP,
author = "J. E. Stoy",
title = "The congruence of two programming language
definitions",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "2",
pages = "151--174",
month = feb,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Oxford Univ. Computing Lab., Oxford, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal languages; programming language definitions",
pubcountry = "Netherlands",
}
@Article{Harel:1981:TCN,
author = "D. Harel",
title = "On the total correctness of nondeterministic
programs",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "2",
pages = "175--192",
month = feb,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arbitrary programming language; computation trees;
Dijkstra; execution method; guarded commands;
nondeterministic programs; programming languages;
programming theory; total correctness",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Gallier:1981:NFPa,
author = "J. H. Gallier",
title = "Nondeterministic flowchart programs with recursive
procedures: semantics and correctness. {I}",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "2",
pages = "193--223",
month = feb,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer and Information Sci., Univ. of
Pennsylvania, Philadelphia, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "correctness; execution tree; nondeterministic
flowchart programs; programming theory; recursive
procedures; semantics",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Goldfarb:1981:USO,
author = "W. D. Goldfarb",
title = "The undecidability of the second-order unification
problem",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "2",
pages = "225--230",
month = feb,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Philosophy, Harvard Univ., Cambridge, MA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal logic; second order logic; undecidability;
unification problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Thomas:1981:RSH,
author = "W. Thomas",
title = "Remark on the star-height-problem",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "2",
pages = "231--237",
month = feb,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Math. Inst., Freiburg, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; general regular expressions; regular
events; star height problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Gallier:1981:NFPb,
author = "J. H. Gallier",
title = "Nondeterministic flowchart programs with recursive
procedures: semantics and correctness. {II}",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "3",
pages = "239--270",
month = mar,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer and Information Sci., Univ. of
Pennsylvania, Philadelphia, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "correctness; equivalence; extension; flowcharting;
inductive assertion method; nondeterministic flowchart
programs; programming theory; recursive procedures;
second-order predicate calculus; semantics",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Engeler:1981:GGT,
author = "E. Engeler",
title = "Generalized {Galois} theory and its application to
complexity",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "3",
pages = "271--293",
month = mar,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. fur Informatik, ETH-Zentrum, Zurich,
Switzerland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "auxiliary procedures; complexity; computational
complexity; Galois theory; polynomial equations;
solution strategies; solvability",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Gurari:1981:CEP,
author = "E. M. Gurari and O. H. Ibarra",
title = "The complexity of the equivalence problem for two
characterizations of {Presburger} sets",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "3",
pages = "295--314",
month = mar,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Minnesota,
Minneapolis, MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; complexity; computational complexity;
deterministic time complexity; equivalence problem;
NP-complete; Presburger sets; reversal-bounded
multicounter machines; semilinear sets",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{MeyerAufDerHeide:1981:CTV,
author = "F. {Meyer Auf Der Heide}",
title = "A comparison of two variations of a pebble game on
graphs",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "3",
pages = "315--322",
month = mar,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4220 (Automata
theory); C4240 (Programming and algorithm theory)",
corpsource = "Faculty of Math., Univ. of Bielefeld, Bielefeld, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "directed acyclic graph; directed graphs; distinguished
vertex; pebble game; programming theory; storage
requirement; straight line program; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Leiss:1981:SRR,
author = "E. Leiss",
title = "Succinct representation of regular languages by
{Boolean} automata",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "3",
pages = "323--330",
month = mar,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Kentucky, Lexington,
KY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean automata; Boolean function; Boolean functions;
deterministic automata; finite automata; formal
languages; regular languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Galil:1981:LTS,
author = "Z. Galil and J. Seireras",
title = "Linear-time string-matching using only a fixed number
of local storage locations",
journal = j-THEOR-COMP-SCI,
volume = "13",
number = "3",
pages = "331--336",
month = mar,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Math. Sci., Tel-Aviv Univ., Tel-Aviv,
Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata-theoretic terms; dynamic storage allocation;
finite automata; FORTRAN; linear-time string-matching
algorithm; local storage locations; programming theory;
random-access machine; restricted writing alphabet;
writing multihead finite automaton",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Gati:1981:SEG,
author = "G. Gati",
title = "Some elements of a {Galois} theory of the structure
and complexity of the tree automorphism problem",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "1",
pages = "1--17",
month = apr,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. fur Informatik, Eidgenossische Tech. Hochschule
Zurich, Zurich, Switzerland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; computational complexity; Engeler's
generalization; Galois group; Galois theory; problem
difficulty; time complexity; tree automorphism
problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{SchulteMonting:1981:MEE,
author = "J. {Schulte Monting}",
title = "Merging of 4 or 5 elements with $n$ elements",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "1",
pages = "19--37",
month = apr,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Math. Inst., Univ. T{\"u}bingen, T{\"u}bingen, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "5-element chain; data handling; finite chain;
minimum-comparison-merging; very tight bounds",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Nishitani:1981:FSS,
author = "Y. Nishitani and N. Honda",
title = "The Firing Squad Synchronization problem for graphs",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "1",
pages = "39--61",
month = apr,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Res. Inst. of Electrical Communication, Tohoku Univ.,
Sendai, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite automata; Firing Squad Synchronization problem;
graphs; synchronization times",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Leiss:1981:GLE,
author = "E. Leiss",
title = "On generalized language equations",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "1",
pages = "63--77",
month = apr,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Houston, Houston, TX,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alphabet; Boolean automata; finite automata; fixed
languages; formal languages; generalized language
equations; language equations",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Rosenthal:1981:OAS,
author = "A. Rosenthal",
title = "Optimal algorithms for sensitivity analysis in
associative multiplication problems",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "1",
pages = "79--90",
month = apr,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer and Communication Sci., Univ. of
Michigan, Ann Arbor, MI, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "graph theory; Huffman trees; optimal ordered binary
search trees; optimal strategies; optimisation;
programming theory; sensitivity analysis",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Long:1981:RVP,
author = "T. J. Long",
title = "On $\gamma$-reducibility versus polynomial time
many-one reducibility",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "1",
pages = "91--101",
month = apr,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer and Information Sci., Ohio State
Univ., Columbus, OH, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; deterministic polynomial
time; nondeterministic polynomial time; polynomial time
Turing reduction; reducibility; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Galil:1981:TEV,
author = "Z. Galil",
title = "On the theoretical efficiency of various network flow
algorithms",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "1",
pages = "103--111",
month = apr,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Math. Sci., Tel-Aviv Univ., Tel-Aviv,
Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm theory; combinatorial mathematics;
combinatorial optimisation; maximal flow; network flow
algorithms; optimisation; theoretical efficiency; time
bounds; topology",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kozen:1981:EPC,
author = "D. Kozen and R. Parikh",
title = "An elementary proof of the completeness of {PDL}",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "1",
pages = "113--118",
month = apr,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "completeness; formal logic; PDL; Propositional Dynamic
Logic; Segerberg axioms",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Latteux:1981:CLS,
author = "M. Latteux",
title = "Concerning a lemma of substitution",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "1",
pages = "119--123",
month = apr,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Lab. d'Informatique, Univ. des Sci. et Techniques de
Lille I, Villeneuve d'Ascq, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bifaithful trio; disjoint alphabets; formal languages;
full trios; Greibach syntactic lemma; substitutions",
language = "French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Jantzen:1981:PSO,
author = "M. Jantzen",
title = "The power of synchronizing operations on strings",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "2",
pages = "127--154",
month = may,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Fachbereich Informatik, Univ. Hamburg, Hamburg, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cancellation; computation sequence; computation
theory; homomorphism; inverse shuffle; iterated
shuffle; shuffle; strings; synchronizing operation",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Gallier:1981:DAN,
author = "J. H. Gallier",
title = "{DPDA's} in 'atomic normal form' and applications to
equivalence problems",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "2",
pages = "155--186",
month = may,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Computer and Information Sci., Univ. of
Pennsylvania, Philadelphia, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "'Atomic Normal Form'; address language; deterministic
automata; deterministic pushdown automata;
equivalence",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Beauquier:1981:SSA,
author = "J. Beauquier",
title = "Substitution of {semi-AFLs}",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "2",
pages = "187--193",
month = may,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Lab. Informatique Th{\'e}orique et Programmation,
Univ. de Picardie, Amiens, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract family language; computation theory;
homomorphism; substitution operator",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Therien:1981:CFM,
author = "D. Therien",
title = "Classification of finite monoids: The language
approach",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "2",
pages = "195--208",
month = may,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "School of Computer Sci., McGill Univ., Montreal, Que.,
Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm theory; convergence variety; finite monoid",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Maruoka:1981:PDT,
author = "A. Maruoka and M. Kimura and N. Shoji",
title = "Pattern decomposition for tessellation automata",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "3",
pages = "211--226",
month = jun,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Faculty of Engng., Tohoku Univ., Sendai, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; bijective mapping; monogenic cellular
automata; neighborhood; pattern decomposition; positive
integer; q-state; residue; states number; tessellation
automata",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Bucher:1981:CDF,
author = "W. Bucher and H. A. Maurer and K. Culik and D.
Wotschke",
title = "Concise description of finite languages",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "3",
pages = "227--246",
month = jun,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Inst. fur Informationsverarbeitung, Tech. Univ. Graz,
Graz, Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; context-free grammars;
finite language; finite number; grammatical complexity;
productions number; X complexity",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Stoklosa:1981:CM,
author = "J. Stoklosa and W. Zakowski",
title = "Computations of $(\alpha,k)$-machines",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "3",
pages = "247--265",
month = jun,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Control Engng., Tech. Univ. of Poznan,
Poznan, Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "boundedness; cell number; computational complexity;
convergence; cyclic computation; divergence; feedback
function; k-machine; positive integer; sequence
generator",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Rozenberg:1981:PTI,
author = "G. Rozenberg and R. Verraedt",
title = "On pure, terminal invariant and nonterminal invariant
interpretations of {E0L} forms",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "3",
pages = "267--288",
month = jun,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Appl. Math and Computer Sci., Univ. of
Leiden, Leiden, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "expression oriented language; L forms theory; language
level; nonterminal symbol; programming theory; pure
interpretations; terminal symbol",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Moran:1981:GAA,
author = "S. Moran",
title = "General approximation algorithms for some arithmetical
combinatorial problems",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "3",
pages = "289--303",
month = jun,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4240 (Programming
and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Minnesota,
Minneapolis, MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "approximation algorithm; computational complexity;
hard optimization; maximal integer; minimal integer;
nonlinear programming; polynomial; worst case relative
error",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Callegarin:1981:AIP,
author = "G. Callegarin and G. Pacini",
title = "About the implementability and the power of
equationally defined data abstractions",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "3",
pages = "305--315",
month = jun,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Istituto di Sci. dell'Informazione, Univ. degli Studi
di Pisa, Pisa, Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "data abstraction; equationally defined data; language
embedding; least congruence; programming theory;
semantics; word algebra",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Jensen:1981:CPN,
author = "K. Jensen",
title = "Coloured {Petri} nets and the invariant-method",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "3",
pages = "317--336",
month = jun,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Computer Sci. Dept., Aarhus Univ., Aarhus, Denmark",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "coloured Petri nets; colours set; common subnet;
formal sum; invariant-method;
predicate/transition-nets; programming theory;
transition",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bucher:1981:NPT,
author = "W. Bucher",
title = "A note on a problem in the theory of grammatical
complexity",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "3",
pages = "337--344",
month = jun,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Inst. fur Informationsverarbeitung, Tech. Univ. Graz,
Graz, Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounds; computational complexity; context-free
grammars; grammatical complexity; infinite context-free
language; infinite linear language; words set",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Schmidt:1981:PPGa,
author = "G. Schmidt",
title = "Programs as partial graphs. {I}. Flow equivalence and
correctness",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "1",
pages = "1--25",
month = jul,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Inst. fur Informatik, Tech. Univ. Munchen, Munchen,
West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "correctness; equivalence; graph theory; partial graph;
program flow; program termination; programming theory;
relational algebra; semantics; single program steps",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Book:1981:BQMa,
author = "R. V. Book",
title = "Bounded query machines: on {NP} and {PSPACE}",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "1",
pages = "27--39",
month = jul,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4240 (Programming
and algorithm theory)",
corpsource = "Dept. of Math., Univ. of California, Santa Barbara,
CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded query machine; nondeterministic polynomial;
nonlinear programming; oracle set; programming theory",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Book:1981:BQMb,
author = "R. V. Book and C. Wrathall",
title = "Bounded query machines: on {NP()} and {NPQUERY()}",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "1",
pages = "41--50",
month = jul,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math., Univ. of California, Santa Barbara,
CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded query machine; NP operator; NPQUERY operator;
programming theory; PSPACE operator",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Araki:1981:RFL,
author = "T. Araki and T. Kagimasa and N. Tokura",
title = "Relations of flow languages to {Petri} net languages",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "1",
pages = "51--75",
month = jul,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Information and Computer Sci., Faculty of
Engng. Sci., Osaka Univ., Toyonaka, Osaka, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "correctness; equivalence; extended expression; flow
languages; Petri net languages; programming theory;
relational language",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Lazard:1981:SAE,
author = "D. Lazard",
title = "Solution of algebraic equations systems",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "1",
pages = "77--110",
month = jul,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. de Math., Univ. de Poitiers, Poitiers, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic closure; algebraic equations; common zeros;
computational complexity; conjugate zeros; ground
field; linear algebra; multiplicities; multivariate
polynomials; univariate equation",
language = "French",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Heilbrunner:1981:PAA,
author = "S. Heilbrunner",
title = "A parsing automata approach to {LR} theory",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "2",
pages = "117--157",
month = aug,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Hochschule der Bundeswehr Munchen, Munchen, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; grammars; item grammars; LC grammar;
LL grammar; LR theory; parsing automata; prefix
parsers",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Schmidt:1981:PPGb,
author = "G. Schmidt",
title = "Programs as partial graphs. {II}. Recursion",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "2",
pages = "159--179",
month = aug,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Inst. for Informatik, Tech. Univ. Munchen, Munchen,
West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "conditional branching; correctness; derivatives;
equivalence; flow diagram programs; graph theory;
Hitchcock-Park's theorem; partial graphs; programming
theory; recursive programs; semantics; sequencing;
termination; unified relational algebra",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Landweber:1981:SSN,
author = "L. H. Landweber and R. J. Lipton and E. L. Robertson",
title = "On the structure of sets in {NP} and other complexity
classes",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "2",
pages = "181--200",
month = aug,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Computer-Sci. Dept., Univ. of Wisconsin, Madison, WI,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; deterministic complexity;
nondeterministic complexity; nonlinear programming;
resource bounded complexity; sets structure",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Alder:1981:ACA,
author = "A. Alder and V. Strassen",
title = "On the algorithmic complexity of associative
algebras",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "2",
pages = "201--211",
month = aug,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory)",
corpsource = "Seminar fur Angewandte Math., Univ. Zurich, Zurich,
Switzerland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithmic complexity; associative algebras;
computational complexity; finite dimensional algebra;
function approximation; nonscalar division; nonscalar
multiplication; rational function",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Germano:1981:SRC,
author = "G. Germano and A. Maggiolo-Schettini",
title = "Sequence recursiveness without cylindrification and
limited register machines",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "2",
pages = "213--221",
month = aug,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Istituto di Scienze dell'Informazione, Univ. di Pisa,
Pisa, Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cylindrification; input datum; output datum;
programming theory; recursiveness; register machines;
semantics; sequence",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Thatcher:1981:MAS,
author = "J. W. Thatcher and E. G. Wagner and J. B. Wright",
title = "More on advice on structuring compilers and proving
them correct",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "3",
pages = "223--249",
month = sep,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6150C
(Compilers, interpreters and other processors)",
corpsource = "Math. Sci. Dept., IBM Thomas J. Watson Res. Center,
Yorktown Heights, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract syntax; compilers; correctness proving;
example language; program compilers; programming
theory; semantics; structuring compilers",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Paz:1981:NDP,
author = "A. Paz and S. Moran",
title = "Non deterministic polynomial optimization problems and
their approximations",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "3",
pages = "251--277",
month = sep,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques)",
corpsource = "Dept. of Computer Sci., Univ. of California, Berkeley,
CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "approximability properties; approximation theory;
nondeterministic polynomial optimization problems;
NPOP; optimisation; polynomials",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Leggett:1981:OPP,
author = "E. W. {Leggett, Jr.} and D. J. Moore",
title = "Optimization problems and the polynomial hierarchy",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "3",
pages = "279--289",
month = sep,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques)",
corpsource = "Clemson Univ., Clemson, SC, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Chromatic Number Problem; Knapsack Packing Problem;
Maximal Clique Problem; optimisation; optimisation
problems; polynomial hierarchy; Symmetric Traveling
Salesman Problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Katseff:1981:SRP,
author = "H. P. Katseff and M. Sipser",
title = "Several results in program size complexity",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "3",
pages = "291--309",
month = sep,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Electronic Res. Lab., Univ. of California, Berkeley,
CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; Kolmogorov's complexity
measure; program size complexity; programming theory;
size complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Loui:1981:SBO,
author = "M. C. Loui",
title = "A space bound for one-tape multidimensional {Turing}
machines",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "3",
pages = "311--320",
month = sep,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "multidimensional Turing machines; one tape Turing
machines; space bound; time complexity; Turing
machines; worktape head",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Benzaken:1981:CGE,
author = "C. Benzaken and S. Foldes",
title = "Complexity of graph embeddability problems",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "3",
pages = "321--328",
month = sep,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Univ. Sci. et Medicale, Grenoble, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; embeddability problems;
graph embeddability; graph theory; time complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Stratman:1981:ECT,
author = "R. Stratman",
title = "On the existence of closed terms in the type lambda
calculus. {II}: transformations of unification
problems",
journal = j-THEOR-COMP-SCI,
volume = "15",
number = "3",
pages = "329--338",
month = sep,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Rutgers Univ., New Brunswick, NJ, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability and decidability; decidable unification
problems; polynomial time decidable; unification
problems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Weihrauch:1981:EMS,
author = "K. Weihrauch and U. Schreiber",
title = "Embedding metric spaces into cpos",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "1",
pages = "5--24",
month = oct,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics); C4210 (Formal logic)",
corpsource = "Fachbereich Math./Informatik,
Fernuniv./Gesamthochschule Hagen, Hagen, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability; computability and decidability; cpo;
Euclidean space; infinite trees; metric spaces; Polish
topology; topology",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrenfeucht:1981:SCS,
author = "A. Ehrenfeucht and G. Rozenberg",
title = "On the subword complexity of square-free {D0L}
languages",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "1",
pages = "25--32",
month = oct,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder,
CO, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; D0L languages; formal
languages; square free languages; subword complexity;
subwords",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Takasu:1981:LBP,
author = "S. Takasu and S. Kawabata",
title = "A logical basis for programming methodology",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "1",
pages = "43--60",
month = oct,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Res. Inst. for Math. Sci., Kyoto Univ., Kyoto, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "assignment statements; FIND; formal proofs;
IF-statements; logical basis; programming methodology;
programming theory; WHILE- statements; WHILE-programs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Jantzen:1981:SMS,
author = "M. Jantzen",
title = "On a special monoid with a single defining relation",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "1",
pages = "61--73",
month = oct,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Fachbereich Informatik, Univ. Hamburg, Hamburg, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "congruence classes; context-free language;
context-free languages; isomorphic proper subgroups;
monoid; single defining relation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Simon:1981:TBP,
author = "J. Simon",
title = "On tape-bounded probabilistic {Turing} machine
acceptors",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "1",
pages = "75--91",
month = oct,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. Ciencia da Computa{\c{c}}ao, Univ. Estadual de
Campinas, Sao Paulo, Brazil",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic tape complexities; probabilistic tape
complexities; probabilistic Turing machine; tape
bounded Turing machine; Turing machine; Turing machine
acceptor; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Main:1981:FUR,
author = "M. G. Main and D. B. Benson",
title = "Free upper regular bands",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "1",
pages = "93--98",
month = oct,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Computer Sci., Washington State Univ.,
Pullman, WA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "data types; group theory; lattice-ordered semigroup;
programming theory; universal domains; upper regular
bands",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lieberherr:1981:UCD,
author = "K. Lieberherr",
title = "Uniform complexity and digital signatures",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "1",
pages = "99--110",
month = oct,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Electrical Engng. and Computer Sci.,
Princeton Univ., Princeton, NJ, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; digital signatures; security
of data; signature checking; signature production;
uniform complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Tao:1981:CPA,
author = "Ren-ji Tao",
title = "On the computational power of automata with time or
space bounded by {Ackermann}'s or superexponential
functions",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "2",
pages = "115--148",
month = nov,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Inst. of Computing Technol., Acad. of Sinica, Beijing,
China",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Ackermann's function; automata; automata theory;
computational power; superexponential functions",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Pittle:1981:LKG,
author = "J. Pittle",
title = "On {LLP(k}) grammars and languages",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "2",
pages = "149--175",
month = nov,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6150C (Compilers,
interpreters and other processors)",
corpsource = "Charles Univ., Prague, Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "compilers; deterministic grammar; formal languages;
grammars; languages; LL(k) grammars; LLP(k) grammars;
LR(k) grammars; parsing; program compilers",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Galbiati:1981:COB,
author = "G. Galbiati and M. J. Eischer",
title = "On the complexity of $2$-output {Boolean} networks",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "2",
pages = "177--185",
month = nov,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4230B (Combinatorial
switching theory)",
corpsource = "Inst of Mat., Univ. of Pavia, Pavia, Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "2-output Boolean networks; and-gates; Boolean
functions; combinational complexity; complexity;
monotone networks; not-gates; optimal realizations;
or-gates",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Raiha:1981:SCS,
author = "K.-J. Raiha and E. Ukkonen",
title = "The shortest common supersequence problem over binary
alphabet is {NP-complete}",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "2",
pages = "187--198",
month = nov,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki,
Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; binary alphabet; finite strings;
formal languages; NP-complete; optimisation; shortest
common supersequence problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Csirmaz:1981:PPV,
author = "L. Csirmaz",
title = "Programs and program verifications in a general
setting",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "2",
pages = "199--210",
month = nov,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.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; Floyd-Hoare derivability; halting
configurations; Peano models; program testing; program
verifications; programming theory; standard programs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Nguyen:1981:DPL,
author = "V. L. Nguyen and J. L. Lassez",
title = "A dual problem to least fixed points",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "2",
pages = "211--221",
month = nov,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Melbourne, Parkville,
Vic., Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "continuous functions; continuous lattices; dual
problem; duality (mathematics); least fixed points;
maximal ascending sequences; minimal continuous
functions; programming theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Book:1981:TCR,
author = "R. V. Book and C. P. O'Dunlaing",
title = "Testing for the {Church--Rosser} property",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "2",
pages = "223--229",
month = nov,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Math., Univ. of California, Santa Barbara,
CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm theory; Church--Rosser property; finite
automata; finite Thue system; grammars; polynomial time
algorithm; program optimisers; theorem proves; trees",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Carter:1981:NEC,
author = "I. L. Carter and R. Eagin",
title = "A note on the existence of continuous functionals",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "2",
pages = "231--235",
month = nov,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0290F (Interpolation and function approximation);
B0290K (Nonlinear and functional equations); C4130
(Interpolation and function approximation); C4150
(Nonlinear and functional equations)",
corpsource = "Computer Sci. Dept., IBM Thomas J. Watson Res. Center,
Yorktown Heights, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "continuous functionals; functional equations; index
set; interpolating function; interpolation; partial
functions",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kleijn:1981:CFR,
author = "H. C. M. Kleijn and G. Rozenberg",
title = "Context-free restrictions on selective rewriting",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "3",
pages = "237--269",
month = dec,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. of Appl. Math. and Computer Sci., Univ. of
Leiden, Leiden, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free grammar; context-free grammars; formal
language theory; selective rewriting",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lam:1981:GCS,
author = "K. Lam and M. K. Siu and C. T. Yu",
title = "A generalized counter scheme",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "3",
pages = "271--278",
month = dec,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Statistics, Hong Kong Univ., Hong Kong",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "generalized counter scheme; programming theory;
transposition heuristic",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Burkhard:1981:ICT,
author = "W. A. Burkhard and M. L. Fredman and D. J. Kleitman",
title = "Inherent complexity trade-offs for range query
problems",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "3",
pages = "279--290",
month = dec,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6120
(File organisation)",
corpsource = "Dept. of Electrical Engng. and Computer Sci., Univ. of
California, San Diego, La Jolla, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; data structures; range query
problems",
pubcountry = "Netherlands",
treatment = "A Application; T Theoretical or Mathematical",
}
@Article{Albert:1981:LHR,
author = "J. Albert and L. Wegner",
title = "Languages with homomorphic replacements",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "3",
pages = "291--305",
month = dec,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. fur Angewandte Informatik und Formulae
Beschreibungsverfahren, Univ. Karlsruhe, Karlsruhe,
West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; H-systems; homomorphic
replacements; language generators; van Wijngaarden
grammars",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Gupta:1981:RAM,
author = "U. I. Gupta and D. T. Lee and J. W. Pruitt and C. K.
Wong",
title = "Record allocation for minimizing seek delay",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "3",
pages = "307--319",
month = dec,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Dept. of Electrical Engng. and Computer Sci.,
Northwestern Univ., Evanston, IL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "file organisation; linear storage device; performance
bounds; seek delay",
pubcountry = "Netherlands",
treatment = "A Application",
}
@Article{Berman:1981:PDL,
author = "F. Berman and M. Paterson",
title = "Propositional Dynamic Logic is weaker without tests",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "3",
pages = "321--328",
month = dec,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "branching; formal logic; iteration; program operators;
test-free propositional dynamic logic",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Edelsbrunner:1981:SOS,
author = "H. Edelsbrunner and H. A. Maurer",
title = "A space-optimal solution of general region location",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "3",
pages = "329--336",
month = dec,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. fur Informationsverarbeitung, Tech. Univ. of
Graz., Graz, Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm theory; general region location; linear
space; logarithmic time",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Blattner:1982:PRG,
author = "M. Blattner and S. Ginsburg",
title = "Position-restricted grammar forms and grammars",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "1",
pages = "1--27",
month = jan,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Math. Sci. Dept., Rice Univ., Houston, TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free grammars; context-free language;
context-free languages; grammar forms; grammars;
interpretation grammars; position restricted grammar;
terminal word",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Welzl:1982:CFD,
author = "E. Welzl",
title = "Color-families are dense",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "1",
pages = "29--41",
month = jan,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Inst. fur Informationsverarbeitung, Tech. Univ. Graz,
Graz, Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "grammar forms; graph colouring",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ekkonen:1982:SPE,
author = "E. Ekkonen",
title = "Structure preserving elimination of null productions
from context-free grammars",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "1",
pages = "43--54",
month = jan,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki,
Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free grammars; Greibach normal form;
homomorphic images; null production",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Gurari:1982:SSU,
author = "E. M. Gurari and O. H. Ibarra",
title = "Some simplified undecidable and {NP-hard} problems for
simple programs",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "1",
pages = "55--73",
month = jan,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., State Univ. of New York,
Buffalo, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; equivalence; NP hard
problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hartmanis:1982:NNC,
author = "J. Hartmanis",
title = "A note on natural complete sets and Godel numberings",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "1",
pages = "75--89",
month = jan,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Computer Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Godel numberings; isomorphism; mathematic logic;
natural complete sets; set theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Syslo:1982:SIP,
author = "M. M. Syslo",
title = "The subgraph isomorphism problem for outerplanar
graphs",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "1",
pages = "91--97",
month = jan,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Computer Sci. Dept., Washington State Univ., Pullman,
WA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "forests; graph theory; NP problem; outerplanar graphs;
polynomial algorithm; subgraph isomorphism; trees",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Karpinski:1982:DSM,
author = "M. Karpinski",
title = "Decidability of `{Skolem} matrix emptiness problem'
entails constructability of exact regular expression",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "1",
pages = "99--102",
month = jan,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0290B (Error analysis in numerical methods); C4220
(Automata theory)",
corpsource = "Math. Sci. Dept., IBM Thomas J. Watson Res. Center,
Yorktown Heights, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm; constructability; finite automata; finite
state machine; Kleene regular expression; matrix
algebra; matrix equivalence; Skolem matrix emptiness",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Fellner:1982:MG,
author = "W. D. Fellner",
title = "On minimal graphs",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "1",
pages = "103--110",
month = jan,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Inst. fur Informationsverarbeitung, Tech. Univ. Graz,
Graz, Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cliques; colour family; grammar forms; graph theory;
minimal graphs; vertex graph",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bergstra:1982:FPC,
author = "J. A. Bergstra and J. Tiuryn and J. V. Tucker",
title = "{Floyd}'s principle, correctness theories and program
equivalence",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "2",
pages = "113--149",
month = feb,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Leiden, Leiden,
Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic specifications; arithmetical computation;
constructs; correctness theories; data abstractions;
data types; first-order specification language; Floyd's
principle; program equivalence; programming system;
programming theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lehmann:1982:END,
author = "D. Lehmann and A. Pasztor",
title = "Epis need not be dense",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "2",
pages = "151--161",
month = feb,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Math. Inst., Hebrew Univ., Jerusalem, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "continuous maps; dense maps; epis; Meseguer's
conjecture; partial algebras; Pos; posets; set theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Courcelle:1982:AGRa,
author = "B. Courcelle and P. Franchi-Zannettacci",
title = "Attribute grammars and recursive program schemes.
{I}",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "2",
pages = "163--191",
month = feb,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Univ. of Bordeaux-I, Talence, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "attribute grammars; attribute system; computability
and decidability; decidable; equivalence problem;
grammars; polynomial time; recursive functions;
recursive program scheme; strongly noncircular",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Andreka:1982:CLRa,
author = "H. Andreka and I. Nemeti and I. Sain",
title = "A complete logic for reasoning about programs via
nonstandard model theory. {I}",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "2",
pages = "193--212",
month = feb,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Math. Inst., Acad. of Sci., Budapest, Hungary",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complete logic; computability and decidability;
decidability; decidable proof concepts; dynamic logic;
formal logic; nonstandard model theory; programming
theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Dutton:1982:CMT,
author = "R. D. Dutton and R. C. Brigham",
title = "The complexity of a multiprocessor task assignment
problem without deadlines",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "2",
pages = "213--216",
month = feb,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Central Florida,
Orlando, FL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; computational complexity; deadlines;
decision problem; decision theory and analysis;
multiprocessing systems; multiprocessor; task
assignment problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Shepherdson:1982:GTC,
author = "J. C. Shepherdson",
title = "Graph theoretic characterization of {G}-schemes and
{TL-schemes}",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "2",
pages = "217--228",
month = feb,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory); C6110 (Systems
analysis and programming)",
corpsource = "Dept. of Math., Univ. of Bristol, Bristol, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "flowcharting; G-schemes; graph theoretic
characterization; graph theory; programming theory;
structured flowchart schemes; structured programming;
TL-schemes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Squier:1982:NRC,
author = "C. Squier and C. Wrathall",
title = "A note on representations of a certain monoid",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "2",
pages = "229--231",
month = feb,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Math., Univ. of California, Santa Barbara,
CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "congruence; congruence classes; deterministic
automata; deterministic Turing machine; log (n) space;
mapping; monoid; representations; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Courcelle:1982:AGRb,
author = "B. Courcelle and P. Franchi-Zannettacci",
title = "Attribute grammars and recursive program schemes.
{II}",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "3",
pages = "235--257",
month = mar,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "UER de Math., Univ. de Bordeaux, Talence, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "attribute grammars; attribute system; equivalence;
grammars; noncircular; programming theory; recursive
program schemes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Andreka:1982:CLRb,
author = "H. Andreka and I. Nemeti and I. Sain",
title = "A complete logic for reasoning about programs via
nonstandard model theory. {II}",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "3",
pages = "259--278",
month = mar,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); 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 = "complete logic; Dynamic Logic; first order dynamic
language; Floyd's method; formal logic; nonstandard
model theory; programming theory; proof method;
semantics of programming",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Dershowitz:1982:OTR,
author = "N. Dershowitz",
title = "Orderings for term-rewriting systems",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "3",
pages = "279--301",
month = mar,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Illinois,
Urbana-Champaign, Urbana, IL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Kruskal's tree theorem; programming theory;
self-embedding; simplification orderings;
term-rewriting systems; termination proofs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bergstra:1982:SNS,
author = "J. A. Bergstra and J. V. Tucker",
title = "Some natural structures which fail to possess a sound
and decidable {Hoare}-like logic for their
while-programs",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "3",
pages = "303--315",
month = mar,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Leiden, Leiden,
Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; computational complexity; decidable
Hoare-like logic; formal logic; natural structures;
partial correctness; programming language; programming
theory; structural properties; while-programs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Sadri:1982:TFT,
author = "F. Sadri and J. D. Ullman",
title = "The theory of functional and template dependencies",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "3",
pages = "317--331",
month = mar,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4290 (Other computer theory); C6160D (Relational
databases)",
corpsource = "Dept. of Computer Sci., Princeton Univ., Princeton,
NJ, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "data dependencies; data structures; functional
dependencies; relational databases; template
dependencies",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Shyamasundar:1982:CPP,
author = "R. K. Shyamasundar",
title = "On a characterization of pushdown permuters",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "3",
pages = "333--341",
month = mar,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Nat. Centre for Software Dev. and Computing Tech.,
Tata Inst. of Fundamental Res., Bombay, India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "class of algorithms; finite automata; input string;
pushdown permuter; pushdown stack",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Nemeti:1982:EFA,
author = "I. Nemeti",
title = "Every free algebra in the variety generated by the
representable dynamic algebras is separable and
representable",
journal = j-THEOR-COMP-SCI,
volume = "17",
number = "3",
pages = "343--347",
month = mar,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Math. Inst., Hungarian Acad. of Sci., Budapest,
Hungary",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal logic; free algebra; KDA; Kripke structure;
representable; representable dynamic algebras;
V-algebra",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Pair:1982:ADT,
author = "C. Pair",
title = "Abstract data types and algebraic semantics of
programming languages",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "1",
pages = "1--31",
month = apr,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Centre de Recherche en Informatique de Nancy, Nancy,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract data type; algebraic semantics; data types;
deterministic algorithmic languages; formal languages;
parallelism; programming languages",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Goldstine:1982:PAC,
author = "J. Goldstine and J. K. Price and D. Wotschke",
title = "A pushdown automaton or a context-free grammar-which
is more economical?",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "1",
pages = "33--40",
month = apr,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Computer Sci. Dept., Pennsylvania State Univ.,
University Park, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; context-free grammar; context-free
grammars; context-free languages; language;
nonterminals; pushdown automaton; stack symbols;
states",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ershov:1982:MCP,
author = "A. P. Ershov",
title = "Mixed computation: potential applications and problems
for study",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "1",
pages = "41--67",
month = apr,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Computing Center, Acad. of Sci., Novosibirsk, USSR",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "compilation; execution; incomplete information;
language; macroprocessing; mixed computation;
optimization; partially processed information; program
manipulation; programming theory; residual program;
semantics; synthesis; transformational approach;
transformational machine concept",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hagauer:1982:FED,
author = "J. Hagauer",
title = "On form-equivalence of deterministic pure grammar
forms",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "1",
pages = "69--87",
month = apr,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. fur Informationsverarbeitung, Tech. Univ. Graz,
Graz, Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability and decidability; decidable;
deterministic pure grammar forms; dP grammar forms;
form-equivalence; grammars; non-terminals; pure
grammar",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Schnitger:1982:FGE,
author = "G. Schnitger",
title = "A family of graphs with expensive depth-reduction",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "1",
pages = "89--93",
month = apr,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Fakultat fur Math., Univ. Bielefeld, Bielefeld, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "depth-reduction; directed acyclic graphs; directed
graphs; edges; family; graphs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Schoning:1982:UAO,
author = "U. Schoning",
title = "A uniform approach to obtain diagonal sets in
complexity classes",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "1",
pages = "95--103",
month = apr,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. fur Informatik, Univ. Stuttgart, Stuttgart, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "almost polynomial time; complexity classes;
computational complexity; diagonal sets; diagonalize;
polynomial hierarchy; random polynomial time",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Furer:1982:CPA,
author = "M. Furer",
title = "The complexity of {Presburger} arithmetic with bounded
quantifier alternation depth",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "1",
pages = "105--111",
month = apr,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Edinburgh, Edinburgh,
UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded number; bounded quantifier alternation depth;
complexity; computational complexity; first order
theories; Presburger arithmetic; quantifier
alternations",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Berstel:1982:RFP,
author = "J. Berstel and C. Reutenauer",
title = "Recognizable formal power series on trees",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "2",
pages = "115--148",
month = may,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "LITP and Inst. de Programmation, Univ. Paris, Paris,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "applications; basic properties; formal power series;
recognisable formal power series; series (mathematics);
trees; trees (mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Best:1982:APP,
author = "E. Best",
title = "Adequacy properties of path programs",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "2",
pages = "149--171",
month = may,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Computing Lab., Univ. of Newcastle upon Tyne,
Newcastle upon Tyne, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "adequacy; formal languages; partial deadlock; path
notation; path programs; programming theory; PT-nets;
semantics",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Boussinot:1982:PDS,
author = "F. Boussinot",
title = "Proposition of denotational semantics for processing
networks with a 'fair merge' operator",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "2",
pages = "173--206",
month = may,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Lab. Central de Recherches, Thomson-CSF, Orsay,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "'fair merge' operator; grammars; processing networks",
language = "French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Uchimura:1982:PSG,
author = "K. Uchimura",
title = "Properties of structure generating functions of
automata and their applications for linear systems",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "2",
pages = "207--220",
month = may,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1210 (General system theory); C4220 (Automata
theory)",
corpsource = "Dept. of Computer Sci., Yamanashi Univ., Kofu, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata; automata theory; linear equations; linear
systems; R- x-automata; structure generating
functions",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Crochemore:1982:SCS,
author = "M. Crochemore",
title = "Sharp characterizations of squarefree morphisms",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "2",
pages = "221--226",
month = may,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Lab. d'Informatique, Univ. de Haute-Normandie,
Mont-Saint-Aignan, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "characterization; formal languages; semigroup
morphism; squarefree morphisms; three letter alphabet",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Sifakis:1982:UAS,
author = "J. Sifakis",
title = "A unified approach for studying the properties of
transition systems",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "3",
pages = "227--258",
month = jun,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Lab. IMAG, Grenoble, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "continuous predicate transformers; programming theory;
property proving; reachability; reachability types;
transition systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Leivant:1982:UTC,
author = "D. Leivant",
title = "Unprovability of theorems of complexity theory in weak
number theories",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "3",
pages = "259--268",
month = jun,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity theory; computational complexity; number
theory; unprovability of theorems; weak number
theories",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Culik:1982:DFM,
author = "K. {Culik, II} and T. Harju",
title = "Dominoes over a free monoid",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "3",
pages = "279--300",
month = jun,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability and decidability; D0L sequence
equivalence; decidability problems; dominoes; formal
languages; free monoid; morphisms",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Meyer:1982:EPL,
author = "A. R. Meyer and K. Winklmann",
title = "Expressing program looping in regular dynamic logic",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "3",
pages = "301--323",
month = jun,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "array assignment instructions; dynamic logic;
nondeterministic while-programs; program looping;
programming theory; regular dynamic logic; regular
first order dynamic logic",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Book:1982:WMG,
author = "R. V. Book",
title = "When is a monoid a group? The {Church--Rosser} case is
tractible",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "3",
pages = "325--331",
month = jun,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Univ. of California, Santa Barbara,
CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Church--Rosser case; finite monadic; finite set A;
formal languages; monoid; submonoid; Thue system;
tractable",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Istrail:1982:GGR,
author = "S. Istrail",
title = "Generalization of the {Ginsburg-Rice} {Schutzenberger}
fixed-point theorem for context-sensitive and
recursive-enumerable languages",
journal = j-THEOR-COMP-SCI,
volume = "18",
number = "3",
pages = "333--341",
month = jun,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math. and Computer Center, Univ. 'Al.I. Cuza'
Iasi, Iasi, Romania",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context sensitive languages; context-sensitive
languages; fixed point characterisation; fixed-point
theorem; Ginsburg-Rice Schutzenberger; least
fixed-point; recursive-enumerable languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Perl:1982:CEL,
author = "Y. Perl and S. Zaks",
title = "On the complexity of edge labelings for trees",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "1",
pages = "1--16",
month = jul,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); B0260
(Optimisation techniques); B6210L (Computer
communications); C1160 (Combinatorial mathematics);
C1180 (Optimisation techniques); C4240 (Programming and
algorithm theory); C5620 (Computer networks and
techniques)",
corpsource = "Dept. of Math. and Computer Sci., Bar-Ilan Univ.,
Ramat-Gan, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "communications networks; complexity; computational
complexity; computer communications; computer networks;
edge labelings; minimal average distance; minimal
diameter; NP-complete problems; objective functions;
optimisation; polynomial-time algorithms; trees; trees
(mathematics); weights",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ibarra:1982:CSA,
author = "O. H. Ibarra and B. S. Leininger and S. Moran",
title = "On the complexity of simple arithmetic expressions",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "1",
pages = "17--28",
month = jul,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Computer Sci. Dept., Inst. of Tech., Univ. of
Minnesota, Minneapolis, MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded inequivalence problems; complexity;
computability and decidability; computational
complexity; decidability; digital arithmetic; divisors;
equivalence classes; nonnegative integer variable;
NP-complete problems; polynomial time; positive integer
constant; simple arithmetic expressions",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Culik:1982:IWO,
author = "K. {Culik, II} and A. Salomaa",
title = "On infinite words obtained by iterating morphisms",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "1",
pages = "29--38",
month = jul,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "adherences; characterisation; computability and
decidability; context-free languages; decidability; DOL
systems; DTOL systems; equivalence classes; equivalence
problem; formal languages; infinite words; iteration;
iterative methods; limit language; morphisms;
Omega-languages; Omega-words; reductions; sets",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Grigorev:1982:ACD,
author = "D. Yu. Grigor'ev",
title = "Additive complexity in directed computations",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "1",
pages = "39--67",
month = jul,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C4240 (Programming and algorithm
theory)",
corpsource = "Leningrad Branch of Math. V. A. Steklov Inst. of Acad.
of Sci., Leningrad, USSR",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity measure; computational complexity; concrete
natural sets; directed computations; elementary
matrices; generalised Bruhat decomposition; linear
forms; matrix algebra; nonlinear lower bounds; reduced
directed complexity; straight-line additive
computation; triangular complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Sethi:1982:PGS,
author = "R. Sethi",
title = "Pebble games for studying storage sharing",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "1",
pages = "69--84",
month = jul,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1140E (Game theory); C1160 (Combinatorial
mathematics); C4290 (Other computer theory); C6120
(File organisation)",
corpsource = "Bell Lab., Murray Hill, NJ, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "database updates; directed acyclic graph; directed
graphs; file organisation; game theory; pebble games;
semantics directed compiler generation;
serialisability; storage sharing; vertex",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Padawitz:1982:GGO,
author = "P. Padawitz",
title = "Graph grammars and operational semantics",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "2",
pages = "117--141",
month = aug,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Fachbereich Informatik, Tech. Univ. Berlin, Berlin,
West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "correctness of derivations; correctness of
transformation rules; functional semantics; grammars;
graph grammars; graphlike expressions; graphlike LISP
expressions; LISP interpreter; operational semantics;
programming language semantics; programming theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Paredaens:1982:UFE,
author = "J. Paredaens",
title = "A universal formalism to express decompositions,
functional dependencies and other constraints in a
relational database",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "2",
pages = "143--160",
month = aug,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4290 (Other computer theory); C6160D (Relational
databases)",
corpsource = "Dept. of Math., Univ. of Antwerp, Wilrijk, Belgium",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computation theory; database management systems;
decompositions; formalism; functional dependencies;
general dependencies; partial decomposition; relational
database; universal formalism",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lewis:1982:SSB,
author = "H. R. Lewis and C. H. Papadimitriou",
title = "Symmetric space-bounded computation",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "2",
pages = "161--187",
month = aug,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Aiken Computation Lab., Harvard Univ., Cambridge, MA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; space complexity;
space-bounded computation; symmetric space complexity;
symmetric Turing machine; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Frederickson:1982:RBB,
author = "G. N. Frederickson and J. Ja'Ja",
title = "On the relationship between the biconnectivity
augmentation and traveling salesman problems",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "2",
pages = "189--201",
month = aug,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C1290 (Applications of
systems theory)",
corpsource = "Dept. of Computer Sci., Pennsylvania State Univ.,
University Park, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "approximation algorithm; biconnected subgraph;
biconnectivity augmentation; Christofides' algorithm;
graph theory; operations research; optimal
biconnection; optimal traveling salesman tour;
optimisation; traveling salesman problems; weighted
graph",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Yao:1982:TST,
author = "A. C.-C. Yao",
title = "On the time-space tradeoff for sorting with linear
queries",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "2",
pages = "203--218",
month = aug,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "branching programs; computational complexity; linear
queries; programming theory; sorting; time-space
tradeoff",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ibarra:1982:MLR,
author = "O. H. Ibarra",
title = "{2DST} mappings on languages and related problems",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "2",
pages = "219--227",
month = aug,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Minnesota,
Minneapolis, MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "2DST mappings; computability and decidability;
decidability; deterministic automata; formal languages;
semilinear Parikh maps; two-way deterministic
sequential transducers",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Book:1982:MTS,
author = "R. V. Book and M. Jantzen and C. Wrathall",
title = "Monadic {Thue} systems",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "3",
pages = "231--251",
month = sep,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Maths., Univ. of California, Santa Barbara,
CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "common ancestor problem; common descendant problem;
computability and decidability; confluent systems;
context-free language; context-free languages; finite
alphabet; Thue systems; tractable; undecidable; word
problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Reischuk:1982:FIM,
author = "K. R. Reischuk",
title = "A fast implementation of a multidimensional storage
into a tree storage",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "3",
pages = "253--266",
month = sep,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Fakultat fur Math., Univ. Bielefeld, Bielefeld, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "multidimensional storage; multidimensional Turing
machine; tree machine; tree storage; Turing machine;
Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Atzeni:1982:IEB,
author = "P. Atzeni and G. Ausiello and C. Batini and M.
Moscarini",
title = "Inclusion and equivalence between relational database
schemata",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "3",
pages = "267--285",
month = sep,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "Istituto di Automatica, Univ. di Roma, Roma, Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "conceptual relations; database management systems;
definition of equivalence; inclusion; relational
database schemata; relational theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Selman:1982:RNP,
author = "A. L. Selman",
title = "Reductions on {NP} and {P}-selective sets",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "3",
pages = "287--304",
month = sep,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Computer Sci. Dept., Iowa State Univ., Ames, IA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal languages; NP; NP-P; P-selective sets;
polynomial time-bounded reducibilities;
self-reducible",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Szwerinski:1982:TOS,
author = "H. Szwerinski",
title = "Time-optimal solution of the
firing-squad-synchronization-problem for
$n$-dimensional rectangles with the general at an
arbitrary position",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "3",
pages = "305--320",
month = sep,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Lehrstuhl C fur Informatik, Tech. Univ. Braunschweig,
Braunschweig, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite automata; firing-squad-synchronization-problem;
n-dimensional case; n-dimensional rectangles; one
dimensional algorithms; time-optimal solution",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Snir:1982:CBL,
author = "M. Snir",
title = "Comparisons between linear functions can help",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "3",
pages = "321--330",
month = sep,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Dept. of Computer Sci., Univ. of Edinburgh, Edinburgh,
UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "comparisons; decision algorithms using comparisons;
linear functions; sorting; sorting-type decision
problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hodgson:1982:DPA,
author = "B. R. Hodgson",
title = "On direct products of automaton decidable theories",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "3",
pages = "331--335",
month = sep,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. de Math., Univ. Laval, Que., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic systems; automata theory; automaton
decidable theories; computability and decidability;
decidability; decidability results; direct products",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Megiddo:1982:BEA,
author = "N. Megiddo",
title = "Is binary encoding appropriate for the
problem-language relationship?",
journal = j-THEOR-COMP-SCI,
volume = "19",
number = "3",
pages = "337--341",
month = sep,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4240 (Programming
and algorithm theory)",
corpsource = "Statistics Dept., Tel Aviv Univ., Tel Aviv, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "binary encoding; complexity; computational complexity;
encoding; encoding schemes; linear programming; Linear
Programming; problem-language relationship",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Wand:1982:SMI,
author = "M. Wand",
title = "Specifications, models, and implementations of data
abstractions",
journal = j-THEOR-COMP-SCI,
volume = "20",
number = "1",
pages = "3--32",
month = mar,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Computer Sci. Dept., Indiana Univ., Bloomington, IN,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "data abstractions; data structures; DLP;
hierarchically structured programs; module; nonlogical
symbols; programming theory; uninterpreted procedure
symbols",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Damm:1982:IOH,
author = "W. Damm",
title = "The {IO}- and {OI-hierarchies} (tree language
theory)",
journal = j-THEOR-COMP-SCI,
volume = "20",
number = "2",
pages = "95--207",
month = may,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Oct 24 12:51:11 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6140D (High level
languages)",
corpsource = "Lehrstuhl fur Informatik II, RWTH Aachen, Aachen, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebra; ALGOL; ALGOL 68; call-by-name interpretation;
call-by-value interpretation; canonical extensions;
control structures; denotational semantics; finite
modes; fixed-point operators; formal language; formal
languages; IO-hierarchies; language families; level-n
schemes; macro languages; OI-hierarchies; program
schemes; recursive procedures; schematological
theorems; strictness; tree language theory; trees
(mathematics); typed Lambda-calculus",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrig:1982:AIA,
author = "H. Ehrig and H.-J. Kreowski and B. Mahr and P.
Padawitz",
title = "Algebraic implementation of abstract data types",
journal = j-THEOR-COMP-SCI,
volume = "20",
number = "3",
pages = "209--263",
month = jul,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation)",
corpsource = "Fachbereich Informatik, Tech. Univ., Berlin, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract data types; algebraic implementation; data
structures; programming languages; semantical level;
stepwise refinement; syntactical level",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Berry:1982:SAC,
author = "G. Berry and P. L. Curien",
title = "Sequential algorithms on concrete data structures",
journal = j-THEOR-COMP-SCI,
volume = "20",
number = "3",
pages = "265--321",
month = jul,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6120 (File organisation)",
corpsource = "Centre de Maths. Appliqu{\'e}es, Ecole des
Mines-Sophia-Antipolis, Valbonne, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "concrete data structures; data structures; formal
languages; Kahn-Plotkin; representation theorem;
sequential algorithm; sequential denotational
semantics; sequential language; sequential programming
languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ko:1982:CCR,
author = "K.-I. Ko and H. Friedman",
title = "Computational complexity of real functions",
journal = j-THEOR-COMP-SCI,
volume = "20",
number = "3",
pages = "323--352",
month = jul,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Houston, Houston, TX,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computation of functions; computational complexity;
function evaluation; modulus of uniform continuity;
nondeterministic computation; real functions; recursive
function theory; recursive real continuous functions;
space complexity; time complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Long:1982:SNP,
author = "T. J. Long",
title = "Strong nondeterministic polynomial-time
reducibilities",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "1",
pages = "1--25",
month = oct,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer and Information Sci., Ohio State
Univ., Columbus, OH, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Adleman and Manders; computational complexity;
deterministic polynomial-time reducibilities; Ladner,
Lynch and Selman; NP-hard sets; recursive sets; strong
nondeterministic polynomial-time reducibilities",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Miyano:1982:TWD,
author = "S. Miyano",
title = "Two-way deterministic multi-weak-counter machines",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "1",
pages = "27--37",
month = oct,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Res. Inst. of Fundamental Information Sci., Kyushu
Univ., Fukuoka, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; bounded language; bounded semilinear
language; deterministic automata; formal languages;
multi-weak-counter machines; two-way deterministic
machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Duris:1982:FTW,
author = "P. Duris and Z. Galil",
title = "Fooling a two way automaton, or, one pushdown store is
better than one counter for two way machines",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "1",
pages = "39--53",
month = oct,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Computer Center, Acad. of Sci., Bratislava,
Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "counter; deterministic automata; deterministic counter
machine; deterministic two way machines; formal
languages; language recognition; pushdown automaton;
pushdown stack",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Janssens:1982:GGN,
author = "D. Janssens and G. Rozenberg",
title = "Graph grammars with neighbourhood-controlled
embedding",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "1",
pages = "55--74",
month = oct,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Maths., Univ. of Antwerp, Wilrijk, Belgium",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "grammars; graph grammars; graph theory; graph-language
generating power; neighbourhood-controlled embedding",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrenfeucht:1982:RTU,
author = "A. Ehrenfeucht and G. Rozenberg",
title = "Representation theorems using {D0S} language",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "1",
pages = "75--90",
month = oct,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder,
CO, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free language; context-sensitive languages;
D0S language; formal languages; homomorphic image;
intersection; recursively enumerable language;
representation theorems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Cori:1982:CMP,
author = "R. Cori and A. Machi",
title = "Construction of maps with prescribed automorphism
group",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "1",
pages = "91--98",
month = oct,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0210 (Algebra); B0250 (Combinatorial mathematics);
C1110 (Algebra); C1160 (Combinatorial mathematics)",
corpsource = "Dept. of Math. et Informatique, Univ. de Bordeaux,
Talence, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bipartite map; finite group; graph theory; group
theory; hypermap; isomorphism; map construction;
prescribed automorphism group; set theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Berenguer:1982:SSE,
author = "X. Berenguer and J. Diaz and L. H. Harper",
title = "A solution of the {Sperner-Erd{\H{o}}s} problem",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "1",
pages = "99--103",
month = oct,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0210 (Algebra); B0250 (Combinatorial mathematics);
B0260 (Optimisation techniques); C1110 (Algebra); C1160
(Combinatorial mathematics); C1180 (Optimisation
techniques)",
corpsource = "Facultat d'Informatica, Univ. Politecnica de
Barcelona, Barcelona, Spain",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "combinatorial mathematics; combinatorial optimisation;
Erdos; Ford-Fulkerson; Maxflow problem; optimisation;
polynomial reductions; polynomials; Sperner",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Goldschlager:1982:MFP,
author = "L. M. Goldschlager and R. A. Shaw and J. Staples",
title = "The maximum flow problem is log space complete for
{P}",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "1",
pages = "105--111",
month = oct,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Queensland, St.
Lucia, Qld., Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; deterministic polynomial
time; fast parallel algorithm; log space completeness;
maximum flow problem; P; space complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrenfeucht:1982:GPC,
author = "A. Ehrenfeucht and J. Karhumaki and G. Rozenberg",
title = "The (generalized) Post Correspondence Problem with
lists consisting of two words is decidable",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "2",
pages = "119--144",
month = nov,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder,
CO, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability and decidability; decidable; formal
languages; lists; Post Correspondence Problem;
undecidable properties",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Loui:1982:SAM,
author = "M. C. Loui",
title = "Simulations among multidimensional {Turing} machines",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "2",
pages = "145--161",
month = nov,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arrays; d-dimensional Turing machine; deterministic
automata; deterministic multihead e-dimensional Turing
machine; dynamic embeddings; local access; on-line;
simulation; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ainhirn:1982:MID,
author = "W. Ainhirn",
title = "Marvellous interpretations differ little but
decisively from ordinary interpretations of {EOL}
forms",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "2",
pages = "163--178",
month = nov,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. fur Informationsverarbeitung, Tech. Univ. Graz,
Graz, Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "EOL families; EOL forms; formal language theory;
formal languages; m-completeness problem; Marvellous
interpretations; mEOL families; ordinary
interpretations",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Chlebus:1982:CCS,
author = "B. S. Chlebus",
title = "On the computational complexity of satisfiability in
propositional logics of programs",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "2",
pages = "179--212",
month = nov,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. of Informatics, Warsaw Univ., Warsaw, Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alternating Turing machines; computational complexity;
formal logic; polynomial space; programs; propositional
algorithmic logic; propositional dynamic logic;
satisfiability; satisfiability problems; space
complexity; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Wegener:1982:BFW,
author = "I. Wegener",
title = "{Boolean} functions whose monotone complexity is of
size $n^2\log n$",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "2",
pages = "213--224",
month = nov,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Fakultat fur Math., Univ. Bielefeld, Bielefeld, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean functions; Boolean matrix product; Boolean
sums; deterministic Turing machines; monotone Boolean
functions; monotone complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Margolis:1982:STS,
author = "S. W. Margolis",
title = "The syntactic transformation semigroup of a language
generated by a finite biprefix code",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "2",
pages = "225--230",
month = nov,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Maths., Univ. of Vermont, Burlington, VT,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite biprefix code; formal languages; idempotent;
syntactic transformation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Csirmaz:1982:DPE,
author = "L. Csirmaz",
title = "Determinateness of program equivalence over {Peano}
axioms",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "2",
pages = "231--235",
month = nov,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Maths. Inst., Hungarian Acad. of Sci., Budapest,
Hungary",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal logic; input-output correctness theories; J. A.
Bergstra; Peano axioms; program equivalence;
programming theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Monien:1982:ENT,
author = "B. Monien and I. H. Sudborough",
title = "On eliminating nondeterminism from {Turing} machines
which use less than logarithm worktape space",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "3",
pages = "237--253",
month = dec,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Fachbereich Math.-Informatik, Univ. Paderborn,
Paderborn, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "graph accessibility problem; graph theory;
nondeterminism; Turing machines; worktape space",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kent:1982:ACN,
author = "C. F. Kent and B. R. Hodgson",
title = "An arithmetical characterization of {NP}",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "3",
pages = "255--267",
month = dec,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4220 (Automata
theory); C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math. Sci., Lakehead Univ., Thunder Bay,
Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arithmetical characterization; computational
complexity; Diophantine predicates; NP; optimisation;
polynomial predicate; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bergstra:1982:EIQ,
author = "J. A. Bergstra and J.-J. C. Meyer",
title = "On the elimination of iteration quantifiers in a
fragment of algorithmic logic",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "3",
pages = "269--279",
month = dec,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Leiden, Leiden,
Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm theory; algorithmic formulae; algorithmic
logic; iteration quantifiers",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Indermark:1982:RDC,
author = "K. Indermark",
title = "On rational definitions in complete algebras without
rank",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "3",
pages = "281--313",
month = dec,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Lehrstuhl fur Informatik II, RWTH Aachen, Aachen, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic treatment; algebras without rank; complete
algebras; control structures; programming theory;
rational schemes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Winkowski:1982:ADS,
author = "J. Winkowski",
title = "An algebraic description of system behaviours",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "3",
pages = "315--340",
month = dec,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. Podstaw Informatyki PAN, Warszawa, Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic description; composing processes;
condition-event systems; discrete systems; partial
algebra; partial operations; partially ordered sets;
Petri; programming theory; relationships between
processes; sets of processes; system behaviours",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Istrail:1982:SRN,
author = "S. Istrail",
title = "Some remarks on nonalgebraic adherences",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "3",
pages = "341--349",
month = dec,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Math. and Computer Center, Univ. 'Al.I.Cuza'
Iasi, Iasi, Romania",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Chromsky hierarchy; context-sensitive adherences;
context-sensitive languages; languages; nonalgebraic
adherences; program scheme; programming context;
programming theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kurka:1982:EL,
author = "P. K{\r{u}}rka",
title = "Ergodic languages",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "3",
pages = "351--355",
month = dec,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Center of Biomath., Czechoslovak Acad. of Sci.,
Prague, Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Chomsky hierarchy; defining languages; ergodic
languages; families of languages; formal languages;
rewriting systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Head:1982:FDL,
author = "T. Head and J. Wilkinson",
title = "Finite {DOL} languages and codes",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "3",
pages = "357--361",
month = dec,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math. Sci., Univ. of Alaska, Fairbanks, AK,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite DOL language; formal languages; null string",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hindley:1983:CTT,
author = "R. Hindley",
title = "The completeness theorem for typing $\lambda$-terms",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "1--2",
pages = "1--17",
month = jan,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Univ. Coll. of Swansea, Swansea, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "combinatory logic; completeness theorem; Curry's
type-rules; formal logic; lambda-terms; semantics;
type-language; type-schemes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Sato:1983:TSE,
author = "M. Sato",
title = "Theory of symbolic expressions. {I}",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "1--2",
pages = "19--55",
month = jan,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1100 (Mathematical techniques); C4200 (Computer
theory); C4210 (Formal logic); C4290 (Other computer
theory); C6140D (High level languages)",
corpsource = "Dept. of Information Sci., Univ. of Tokyo, Bunkyo-ku,
Tokyo, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computation theory; computational linguistics; finite
mathematics; finite set theory; formal languages;
Hyperlisp; LISP; mathematics; metatheory of
computation; notation system; number theory;
programming language; reference language; semantics;
symbolic expressions; theory of computation; universal
formal system",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Pittl:1983:CRD,
author = "J. Pittl and A. Yehudai",
title = "Constructing a realtime deterministic pushdown
automaton from a grammar",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "1--2",
pages = "57--69",
month = jan,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Res. Inst. for Math. Machines, Praha, Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic automata; formal languages; grammar;
grammars; realtime deterministic pushdown automaton;
stack uniform strict deterministic languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Gacs:1983:RBD,
author = "P. Gacs",
title = "On the relation between descriptional complexity and
algorithmic probability",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "1--2",
pages = "71--93",
month = jan,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1140E (Game theory); C1260 (Information theory);
C4210 (Formal logic); C4240 (Programming and algorithm
theory); C6120 (File organisation)",
corpsource = "Computer Sci. Dept., Univ. of Rochester, Rochester,
NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "a priori probability; algorithm theory; algorithmic
information theory; algorithmic probability;
descriptional complexity; formal logic; game theory;
inductive inference; information theory; logarithm;
probability; storage allocation; two-person
memory-allocation game",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kuich:1983:ILS,
author = "W. Kuich and F. J. Urbanek",
title = "Infinite linear systems and one counter languages",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "1--2",
pages = "95--126",
month = jan,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C4210 (Formal logic)",
corpsource = "Inst. fur Math. Logik und Formale Sprachen, Tech.
Univ. Wien, Wien, Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "commutative semiring; finite algebraic systems; formal
languages; formal power series; grammars; infinite
linear systems; linear systems; matrix algebra; matrix
equations; one counter languages; periodic structure",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hindley:1983:CTR,
author = "R. Hindley",
title = "{Curry}'s type-rules are complete with respect to the
{$F$}-semantics too",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "1--2",
pages = "127--133",
month = jan,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Univ. Coll. of Swansea, Swansea, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "combinatory logic; completeness theorem; Curry's
type-rules; formal logic; lambda-terms; semantics;
type-language; type-schemes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Boudol:1983:RIP,
author = "G. Boudol and L. Kott",
title = "Recursion induction principle revisited",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "1--2",
pages = "135--173",
month = jan,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "UER de Math., LITP, Univ. Paris VII, Paris, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity of equivalences; complexity of
inequalities; formal logic; programming theory; proof
system; recursion induction principle; recursive
programs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ito:1983:MPE,
author = "M. Ito and K. Taniguchi and T. Kasami",
title = "Membership problem for embedded multivalued
dependencies under some restricted conditions",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "1--2",
pages = "175--194",
month = jan,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6160D (Relational
databases)",
corpsource = "Dept. of Information and Computer Sci., Faculty of
Engng. Sci., Osaka Univ., Toyonaka, Osaka, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "database management systems; DBMS; embedded
multivalued dependencies; formal logic; functional
dependency; inference rules; membership problem;
relational databases",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Wasilkowski:1983:IPE,
author = "G. W. Wasilkowski",
title = "Any iteration for polynomial equations using linear
information has infinite complexity",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "1--2",
pages = "195--208",
month = jan,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C4150 (Nonlinear and functional equations); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Carnegie-Mellon Univ.,
Pittsburgh, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "analytic functions; approximation; computational
complexity; convergence of numerical methods; function
approximation; globally convergent iterations; infinite
complexity; iterative methods; linear information;
nonlinear equations; polynomial equations; polynomials;
scalar complex polynomials",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lee:1983:TUS,
author = "D. T. Lee and C. L. Liu and C. K. Wong",
title = "($g_0, g_1,\ldots{},g_k$)-trees and unary {0L}
systems",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "1--2",
pages = "209--217",
month = jan,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Electrical Engng. and Computer Sci.,
Northwestern Univ., Evanston, IL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "(2,3)-trees; (g/sub 0/,g/sub 1/,\ldots{},g/sub
k/)-trees; (g/sub 1/,g/sub 2/,\ldots{},g/sub k/)-AVL
trees; AVL trees; context-free languages; trees
(mathematics); unary 0L systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Steinby:1983:STS,
author = "M. Steinby",
title = "Systolic trees and systolic language recognition by
tree automata",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "1--2",
pages = "219--232",
month = jan,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Math., Univ. of Turku, Turku, Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; formal languages; large scale
integration; recognisable forests; systolic language
recognition; systolic VLSI trees; systolically
operating processor networks; tree automata; tree
transductions; trees (mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lev:1983:SBS,
author = "G. Lev and L. G. Valiant",
title = "Size bounds for superconcentrators",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "3",
pages = "233--251",
month = feb,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0230 (Integral transforms); B0250 (Combinatorial
mathematics); C1130 (Integral transforms); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Computer Sci., Edinburgh Univ., Edinburgh,
UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithms; cyclic convolution; directed acyclic
graph; directed graphs; discrete Fourier transform;
Fourier transforms; lower bound; N-superconcentrator;
prime order; recursive construction; size bounds",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Takahashi:1983:NSR,
author = "M. Takahashi",
title = "Nest sets and relativized closure properties",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "3",
pages = "253--264",
month = feb,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Information Sci., Tokyo Inst. of Technol.,
Tokyo, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "AFL operations; binary trees; context-free grammar;
context-free languages; direct product; Dyck set;
generalized parenthesis languages; nest set;
nonterminal symbols; paired terminal symbols; quotient;
recognizable sets; relativized closure properties; set
theory; shuffle product; trees (mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bergstra:1983:HLP,
author = "J. A. Bergstra and J. V. Tucker",
title = "{Hoare}'s logic and {Peano}'s arithmetic",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "3",
pages = "265--284",
month = feb,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Leiden, Leiden,
Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal logic; Hoare's logic; partial correctness;
Peano's arithmetic; programming theory; proof theory;
strongest postcondition calculus; while-programs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lempel:1983:CMF,
author = "A. Lempel and G. Seroussi and S. Winograd",
title = "On the complexity of multiplication in finite fields",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "3",
pages = "285--296",
month = feb,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Technion-Israel Inst. of
Technol., Haifa, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arbitrary elements; bilinear complexity; computational
complexity; finite fields; linear lower bound;
multiplication; polynomials; quasi-linear upper bound",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Apostolico:1983:OLD,
author = "A. Apostolico and F. P. Preparata",
title = "Optimal off-line detection of repetitions in a
string",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "3",
pages = "297--315",
month = feb,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Coordinated Sci. Lab., Univ. of Illinois, Urbana,
Champaign, IL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm; automata; data structure; data structures;
finite alphabet; formal languages; off-line detection;
RAM; repetitions; string",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bauer:1983:CPD,
author = "W. Bauer and V. Strassen",
title = "The complexity of partial derivatives",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "3",
pages = "317--330",
month = feb,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4160 (Numerical integration
and differentiation); C4240 (Programming and algorithm
theory)",
corpsource = "Seminar fur Angewandte Math., Univ. Zurich, Zurich,
Switzerland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; determinant;
differentiation; discriminant; matrix algebra; matrix
inversion; nonscalar complexity; partial derivatives;
polynomials; resultant; root functions; single
elementary symmetry functions; single power sums",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Maurer:1983:CNS,
author = "H. A. Maurer",
title = "{L} codes and number systems",
journal = j-THEOR-COMP-SCI,
volume = "22",
number = "3",
pages = "331--346",
month = feb,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Inst. fur Informationsverarbeitung, Tech. Univ. Graz,
Graz, Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "binary case; classification; codes; exceptional
length; formal languages; number systems; number
theory; target alphabet; unary L codes; unary
morphisms",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Tang:1983:LRL,
author = "Chuang-jie Tang and Yi-li Zhang",
title = "The limited regular languages",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "1",
pages = "1--10",
month = mar,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Computer Sci. Dept., Sichuan Univ., Chengdu, China",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Eilenberg; formal languages; limit theorem; limited
regular languages; open problems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Jankowski:1983:LFA,
author = "A. Jankowski and C. Rauszer",
title = "Logical foundation approach to users' domain
restriction in data bases",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "1",
pages = "11--36",
month = mar,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6160 (Database management
systems (DBMS))",
corpsource = "Inst. of Math., Univ. of Warsaw, Warszawa, Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "area inclusion; data bases; database management
systems; formal logic; hierarchy; information system;
language; limited access; logical foundation; natural
order; priority; query; semantics; users' domain
restriction",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Nakamura:1983:PFT,
author = "A. Nakamura and H. Ono",
title = "Pictures of functions and their acceptability by
automata",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "1",
pages = "37--48",
month = mar,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B6140C (Optical information, image and video signal
processing); C1160 (Combinatorial mathematics); C1250
(Pattern recognition); C4210 (Formal logic); C4220
(Automata theory)",
corpsource = "Dept. of Appl. Math., Horishima Univ., Hiroshima,
Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "acceptability; automata theory; bottom planes;
computability and decidability; computable functions;
deterministic Turing rectangular array acceptor; first
quadrant; functions; functions of one variable; initial
segments; natural number theory; noncomputable
function; nondeterministic automaton; number theory;
pattern recognition; patterns; picture processing;
pictures; three-dimensional arrays",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Heilbrunner:1983:MUP,
author = "S. Heilbrunner",
title = "A metatheorem for undecidable properties of formal
languages and its application to {LRR} and {LLR}
grammars and languages",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "1",
pages = "49--68",
month = mar,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Fachbereich Informatik, Hochschule der Bundewehr
Munchen, Neubiberg, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability and decidability; formal languages;
grammars; iteration theorems; LLR grammars; LLR
languages; LR-regular grammars; LRR languages;
metatheorem; relative decision problems; simple
grammars; undecidable properties",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Brandenburg:1983:UGP,
author = "F.-J. Brandenburg",
title = "Uniformly growing $k$-th power-free homorphisms",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "1",
pages = "69--82",
month = mar,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. fur Informatik, Univ. Bonn, Bonn, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cube-free homomorphisms; cube-free strings; formal
languages; k-th power-free homorphisms; kth power-free
strings; least alphabets; n letter alphabets;
nonexistence; nonnegative rational numbers; repetitive
threshold; square-free homomorphisms; square-free
strings; uniformly growing homomorphisms",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Head:1983:DSP,
author = "T. Head and G. Thierrin and J. Wilkinson",
title = "{DOL} schemes and the periodicity of string
embeddings",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "1",
pages = "83--89",
month = mar,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Math. Sci., Univ. of Alaska, Fairbanks, AK,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "common alphabet; context-free languages; DOL
languages; DOL schemes; DOL systems; finite nonempty
set; finitely generated free monoids; integers;
periodicity; set theory; stationary sets; string
embeddings; subsequence",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Nijholt:1983:SLI,
author = "A. Nijholt",
title = "On satisfying the {LL-iteration} theorem",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "1",
pages = "91--94",
month = mar,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Informatics, Katholieke Univ. Nijmegen,
Nijmegen, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; iteration theorem; iterative
methods; J. C. Beatty; LL-languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Chan:1983:FVP,
author = "Tat-hung Chan and O. H. Ibarra",
title = "On the finite-valuedness problem for sequential
machines",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "1",
pages = "95--101",
month = mar,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Minnesota,
Minneapolis, MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "accepting computations; accepting states; ambiguity;
distinct outputs; exponential space algorithm; finite
automata; finite products; finite-valuedness problem;
matrices; matrix algebra; nondeterministic finite
acceptors; nondeterministic Mealy sequential machine;
nonnegative integer entries; polynomial bound; space
bound; square space algorithm",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ramanan:1983:CSC,
author = "P. V. Ramanan",
title = "A counterexample to {Shyamasundar}'s characterization
of pushdown permuters",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "1",
pages = "103--105",
month = mar,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Illinois, Urbana, IL,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithms; automata theory; characterization;
counter-example; pushdown permuters; R. K.
Shyamasundar; random access memory cells; single
pushdown stack; symbol permutation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Gelenbe:1983:SDF,
author = "E. Gelenbe",
title = "Stationary deterministic flows in discrete systems.
{I} (computer performance modelling)",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "2",
pages = "107--127",
month = apr,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1140C (Queueing theory); C5420 (Mainframes and
minicomputers)",
corpsource = "Lab. d'Informatique des Systemes Experimentaux et de
leur Modelisation, Univ. de Paris Sud, Orsay, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arrival instants; asymptotic behaviour; birth and
death equations; complex computer system; computer
performance modelling; departure instant measures;
deterministic queue network; digital computers;
discrete systems; identical distributions;
independence; infinite time behaviour; Karp-Miller
vector addition system; limiting behaviour; Little's
formula; n-dimensional first orthant; observable
properties; operational analysis; parallel processing;
Petri net; queueing theory; state space; stationary
deterministic flows; stationary properties; stochastic
assumptions; stochastic restrictions; weak
assumptions",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Tomita:1983:DBA,
author = "E. Tomita",
title = "A direct branching algorithm for checking equivalence
of strict deterministic vs. {LL(k}) grammars",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "2",
pages = "129--154",
month = apr,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Communication Engng., Univ. of
Electro-Communications, Tokyo, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "branching algorithm; context-free grammars;
context-free languages; direct branching algorithm;
equivalence checking; equivalence classes; Hopcroft;
Korenjak; LL(k) grammars; mixing; nonterminals; simple
deterministic grammars; strict deterministic grammars",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Eisman:1983:DEL,
author = "G. S. Eisman",
title = "On depth in {EDTOL} languages",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "2",
pages = "155--169",
month = apr,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Maths., Saint Mary's Coll., Moraga, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; depth; EDTOL languages; finite
automata; finite state automata; language generation;
structure",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lotti:1983:ACR,
author = "G. Lotti and F. Romani",
title = "On the asymptotic complexity of rectangular matrix
multiplication",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "2",
pages = "171--185",
month = apr,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240 (Programming and
algorithm theory)",
corpsource = "Istituto di Sci. dell'Informazione, Univ. di Pisa,
Pisa, Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "asymptotic complexity; bounds; computational
complexity; matrix algebra; rectangular matrix
multiplication",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Back:1983:CSU,
author = "R. J. R. Back",
title = "A continuous semantics for unbounded nondeterminism",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "2",
pages = "187--210",
month = apr,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki,
Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational linguistics; continuous semantics;
denotational semantic; entry-exit specifications;
iterative programming language; nondeterministic
assignment statements; operational semantics; procedure
calls; program execution trees; programming theory;
semantic algebra; specification language; trees
(mathematics); unbounded nondeterminism",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Finn:1983:PTF,
author = "J. Finn and K. Lieberherr",
title = "Primality testing and factoring",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "2",
pages = "211--215",
month = apr,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1140G (Monte Carlo methods); C1160 (Combinatorial
mathematics); C4110 (Error analysis in numerical
methods)",
corpsource = "Dept. of Electrical Engng. and Computer Sci.,
Princeton Univ., Princeton, NJ, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic algorithm; error analysis; error
probability; explicit bounds; factoring algorithm; hard
factoring; Monte Carlo methods; Monte Carlo primality
test; number theory; square roots modulo a prime",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Takahashi:1983:NOR,
author = "M. Takahashi and H. Yamasaki",
title = "A note on omega-regular languages",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "2",
pages = "217--225",
month = apr,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Information Sci., Tokyo Inst. of Technol.,
Tokyo, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Borel hierarchy; characterisation; classes;
context-free languages; finite automata;
interrelations; L. Boasson; L. H. Landweber; M. Nivat;
omega-languages; omega-regular languages; topological
framework",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Culik:1983:FLR,
author = "K. Culik and J. Gruska and A. Salomaa",
title = "On a family of {L} languages resulting for systolic
tree automata",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "3",
pages = "231--242",
month = may,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; Boolean operations; closure;
computability and decidability; context-free languages;
decidable equivalence problem; equivalence classes;
iZ-rational power series; L languages; natural
subfamily; open problems; systolic EOL languages;
systolic tree automata; trees (mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Etzion:1983:SNT,
author = "T. Etzion and M. Yoeli",
title = "Super-nets and their hierarchy",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "3",
pages = "243--272",
month = may,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Computer Sci., Technion, Haifa, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal languages; graph theory; hierarchy; iteration;
Kleene star; labelled Super-Nets; languages;
nonlabelled super-nets; Petri nets; super-net;
supernets",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Marchetti-Spaccamela:1983:LTR,
author = "A. Marchetti-Spaccamela and M. Prtasi",
title = "The largest tree in a random graph",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "3",
pages = "273--286",
month = may,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); B0290F
(Interpolation and function approximation); C1160
(Combinatorial mathematics); C4130 (Interpolation and
function approximation)",
corpsource = "Instituto di Automatica, Univ. di Roma, Roma, Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "approximate greedy algorithms; approximation theory;
graph theory; largest tree; random graph; trees
(mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Freund:1983:RFN,
author = "R. Freund",
title = "Real functions and numbers defined by {Turing}
machines",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "3",
pages = "287--304",
month = may,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Inst. fur Math. Logik und Formulae Sprachen, Tech.
Univ. Wien, Wien, Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic Turing machines; formal languages;
hierarchy; infinite strings of digits; nondeterministic
Turing machines; real functions; real numbers;
transcendent Turing numbers; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Gordon:1983:CRF,
author = "D. Gordon and E. Shamir",
title = "Computation of recursive functionals using minimal
initial segments",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "3",
pages = "305--315",
month = may,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
(Programming and algorithm theory)",
corpsource = "Dept. Computer Studies, Univ. of Haifa, Haifa,
Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm theory; automata theory; computation; input
functions; minimal initial segments; nonredundant
machine; partial recursive functionals; recursive
functions; redundancy; significance; unbounded
redundancy; universal test of randomness",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Volger:1983:TML,
author = "H. Volger",
title = "{Turing} machines with linear alternation, theories of
bounded concatenation and the decision problem of first
order theories",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "3",
pages = "333--337",
month = may,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
(Programming and algorithm theory)",
corpsource = "Maths. Inst., Univ. T{\"u}bingen, T{\"u}bingen, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "binary tree; computability and decidability;
computational complexity; decision problem; elementary
recursive sets; first order theories; intermediate
hierarchy; linear alternation; recursive functions; set
theory; time classes; trees (mathematics); Turing
machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{ODunglaing:1983:UQR,
author = "C. O'Dunglaing",
title = "Undecidable questions related to {Church--Rosser Thue}
systems",
journal = j-THEOR-COMP-SCI,
volume = "23",
number = "3",
pages = "339--345",
month = may,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Courant Inst. of Math. Sci., New York, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Church--Rosser congruence; Church--Rosser Thue
systems; computability and decidability; decidability;
finite Thue systems; formal languages; string-rewriting
systems; undecidability",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Wedde:1983:ISF,
author = "H. Wedde",
title = "An iterative and starvation-free solution for a
general class of distributed control problems based on
interaction primitives",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "1",
pages = "1--20",
month = jun,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4290 (Other computer theory); C5620 (Computer
networks and techniques)",
corpsource = "Gesellschaft fur Math. und Datenverarbeitung mbH Bonn,
Bonn, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "asymmetrical influence; Dining Philosophers' Problem;
directions of flow; distributed control problems;
distributed processes; distributed processing;
distributed system; interaction primitives; interaction
systems; iterative methods; iterative solution; local
excitement relations; loosely coupled systems; slack of
behaviour; starvation-free solution; stepwise
procedure; symmetrical bilateral restrictions;
symmetrical transitional structure",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{deLuca:1983:CL,
author = "A. {de Luca} and A. Restivo and S. Salemi",
title = "On the centers of a language",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "1",
pages = "21--34",
month = jun,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Istituto di Matematica, Univ. di Napoli, Napoli,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bilateral centers; formal languages; infinite left
completion; infinite right completions; language; left
center; periodicity; right center; strong iteration
properties; two-sided completions; weak iteration
properties",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ibarra:1983:CPI,
author = "O. H. Ibarra and S. Moran and L. E. Rosier",
title = "On the control power of integer division",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "1",
pages = "35--52",
month = jun,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Minnesota,
Minneapolis, MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arithmetic; branching instructions; control power;
control structure; digital arithmetic; indirect
addressing; integer division by 2; loop-free program;
programming language constructs; programming theory;
programs; rational instructions",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Grefenstette:1983:SS,
author = "J. J. Grefenstette",
title = "Stability in {L} systems",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "1",
pages = "53--71",
month = jun,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Computer Sci. Dept., Vanderbilt Univ., Nashville, TN,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Adult language; characterisation; Chomsky hierarchy;
classes; formal languages; k-stable language; L
systems; stability; totally parallel grammars",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Schmidt:1983:APA,
author = "D. A. Schmidt",
title = "Approximation properties of abstract data types",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "1",
pages = "73--94",
month = jun,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Computer Sci. Dept., Edinburgh Univ., Edinburgh, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract data types; Church--Rosser property;
confluence; congruence relation; data type language;
equatorial specifications; fixed point properties;
formal languages; formal logic; identities; partially
ordered quotient algebra model; relative
answer-producing behaviour; semantic reasoning; term
model constructions; Wadsworth's approximation
property",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Daley:1983:ECP,
author = "R. P. Daley",
title = "On the error correcting power of pluralism in
{BC-type} inductive inference",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "1",
pages = "95--104",
month = jun,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Computer Sci. Dept., Univ. of Pittsburgh, Pittsburgh,
PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; BC-inference; error correcting power;
error correction; formal logic; inductive inference;
multiple machines; pluralism",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Watanabe:1983:TPT,
author = "O. Watanabe",
title = "The time-precision tradeoff problem on on-line
probabilistic {Turing} machines",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "1",
pages = "105--117",
month = jun,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Information Sci., Tokyo Inst. of Technol.,
Tokyo, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded error probabilistic; nondeterministic
computations; online probabilistic Turing machine
acceptors; set recognition; time-precision tradeoff
problem; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Chazelle:1983:UHE,
author = "B. Chazelle and L. Monier",
title = "Unbounded hardware is equivalent to deterministic
{Turing} machines",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "2",
pages = "123--130",
month = jul,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer Sci., Carnegie-Mellon Univ.,
Pittsburgh, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "circuit area; complexity; computational complexity;
Deterministic Turing Machine; deterministic Turing
machines; digital circuits; DTM; modelling; models of
computation; parallelism; physical computation;
systolic architectures; Turing machines; unbounded
hardware",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Soundararajan:1983:CPC,
author = "N. Soundararajan",
title = "Correctness proofs of {CSP} programs",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "2",
pages = "131--141",
month = jul,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer and Information Sci., Ohio State
Univ., Columbus, OH, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "axiomatic semantics; communicating sequential
processes; correctness; correctness proofs; CSP; CSP
programs; program correctness; program correctness
proving; program verification; programming theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Nambiar:1983:RFD,
author = "K. K. Nambiar and T. Radhakrishnan and V. G. Tikekar",
title = "Representation of functional dependencies in
relational databases using linear graphs",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "2",
pages = "143--159",
month = jul,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C6160D
(Relational databases)",
corpsource = "Centre for Theoretical Studies, Indian Inst. of Sci.,
Bangalore, India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "completion relation; database management systems;
database theory; dependency relation; dissidence
relation; equipotence relation; functional
dependencies; graph theory; linear graph theory; linear
graphs; relational databases",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Nakamura:1983:RBG,
author = "A. Nakamura and K. Aizawa",
title = "On a relationship between graph {L}-systems and
picture languages",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "2",
pages = "161--177",
month = jul,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); B6140C (Optical
information, image and video signal processing); C1160
(Combinatorial mathematics); C1250 (Pattern
recognition)",
corpsource = "Dept. of Appl. Maths., Hiroshima Univ., Hiroshima,
Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "array languages; graph; graph L-systems; graph theory;
picture languages; picture processing; two-dimensional
pictures",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Toda:1983:TDP,
author = "M. Toda and K. Inoue and I. Takanami",
title = "Two-dimensional pattern matching by two-dimensional
on-line tessellation acceptors",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "2",
pages = "179--194",
month = jul,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Electronics, Yamaguchi Univ., Ube, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "array matching problem; finite automata; finite state
pattern matching machines; finite state string matching
machines; online detection; string matching algorithms;
string matching problem; two-dimensional online
tessellation acceptor; two-dimensional pattern
matching",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Siromoney:1983:IAI,
author = "R. Siromoney and R. Dare and K. G. Subramanian",
title = "Infinite arrays and infinite computations",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "2",
pages = "195--205",
month = jul,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Madras Christian Coll., Madras,
India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free grammars; context-free kolam array
grammars; generalized context-free kolam array
grammars; infinite arrays; infinite computations;
metric topology",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bagchi:1983:AHS,
author = "A. Bagchi and A. Mahanti",
title = "Admissible heuristic search in {AND\slash OR} graphs",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "2",
pages = "207--219",
month = jul,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence)",
corpsource = "Indian Inst. of Management, Calcutta, India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "AND/OR graphs; artificial intelligence; heuristic
problem solving; heuristic programming; heuristic
search; HS",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Storer:1983:TAT,
author = "J. A. Storer",
title = "Toward an abstract theory of data compression",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "3",
pages = "221--237",
month = aug,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B6140 (Signal processing and detection); C1260
(Information theory); C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Computer Sci., Brandeis Univ., Waltham, MA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract program size complexity; abstract theory;
computational complexity; cost function; data
compression; programming language",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Heintz:1983:DFQ,
author = "J. Heintz",
title = "Definability and fast quantifier elimination in
algebraically closed fields",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "3",
pages = "239--277",
month = aug,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
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 = "algebraic complexity theory; algebraically closed
fields; Bezout-inequality; Bezout-theorem;
computational complexity; definability; fast quantifier
elimination; upper bounds",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Homer:1983:ODP,
author = "S. Homer and W. Maass",
title = "Oracle-dependent properties of the lattice of {NP}
sets",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "3",
pages = "279--289",
month = aug,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math., Boston Univ., Boston, MA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; infinite set; NP sets
lattice; oracle-dependent properties",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Vazirani:1983:NES,
author = "U. V. Vazirani and V. V. Vazirani",
title = "A natural encoding scheme proved probabilistic
polynomial complete",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "3",
pages = "291--300",
month = aug,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1260 (Information theory); C4130 (Interpolation and
function approximation); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of California, Berkeley,
CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; encoding; natural encoding
scheme; non-number theoretic problem; NP-completeness;
polynomials; probabilistic logic; probabilistic
polynomial completeness; UR-complete",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Book:1983:DSC,
author = "R. V. Book",
title = "Decidable sentences of {Church--Rosser} congruences",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "3",
pages = "301--312",
month = aug,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Univ. of California, Santa Barbara,
CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Church--Rosser congruences; computability and
decidability; decidable sentences; decision procedure;
Green's relations; monoid; true sentences",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ibarra:1983:SDQ,
author = "O. H. Ibarra",
title = "On some decision questions concerning pushdown
machines",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "3",
pages = "313--322",
month = aug,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Minnesota,
Minneapolis, MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "acceptors; ambiguity; computability and decidability;
decidable ambiguity problem; decision questions;
deterministic automata; deterministic counter
automaton; deterministic pushdown transducers;
equivalence; finite-turn nondeterministic counter
automaton; homomorphism; language; monotonicity;
pushdown machines; single-valuedness",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Fischer:1983:SDS,
author = "P. C. Fischer and J. H. Jou and D.-M. Tsou",
title = "Succinctness in dependency systems",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "3",
pages = "323--329",
month = aug,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Vanderbilt Univ., Nashville, TN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "dependency systems; formal logic; functional
dependencies; succinctness",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Inoue:1983:RBT,
author = "K. Inoue and I. Takanami and H. Taniguchi",
title = "A relationship between two-dimensional finite automata
and three-way tape-bounded two-dimensional {Turing}
machines",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "3",
pages = "331--336",
month = aug,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Electronics, Yamaguchi Univ., Ube, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite automata; three-way tape-bounded
two-dimensional Turing machines; Turing machines;
two-dimensional finite automata",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Olderog:1983:NER,
author = "E.-R. Olderog",
title = "On the notion of expressiveness and the rule of
adaptation",
journal = j-THEOR-COMP-SCI,
volume = "24",
number = "3",
pages = "337--347",
month = aug,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. fur Informatik und Praktische Math.,
Christian-Albrechts-Univ. Kiel, Kiel, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "assertion language; completeness; expressiveness;
formal logic; Hoarelike proof systems; rule of
adaptation; soundness",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kfoury:1983:DPF,
author = "A. J. Kfoury",
title = "Definability by programs in first-order structures",
journal = j-THEOR-COMP-SCI,
volume = "25",
number = "1",
pages = "1--66",
month = jan,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Math., Boston Univ., Boston, MA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "data structures; deterministic recursive programs;
first-order structures; flow-chart programs; formal
languages; iterative programs; program definability;
programming formalisms; programming theory; terminating
computations; truth-table property; uniform bound;
unwind property",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Nelson:1983:IA,
author = "E. Nelson",
title = "Iterative algebras",
journal = j-THEOR-COMP-SCI,
volume = "25",
number = "1",
pages = "67--94",
month = jan,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C4210 (Formal logic); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Math. Sci., McMaster Univ., Hamilton, Ont.,
Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebra; computer theory; equations; formal logic;
iterative algebras; iterative methods; modelling;
polynomial equations; polynomials; programming theory;
unique solutions; uniquely solvable iterative
algebras",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Courcelle:1983:FPI,
author = "B. Courcelle",
title = "Fundamental properties of infinite trees",
journal = j-THEOR-COMP-SCI,
volume = "25",
number = "2",
pages = "95--169",
month = mar,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4290 (Other computer theory)",
corpsource = "UER de Math. et Informatique, Univ. Bordeaux I,
Talence, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic infinite trees; algebraic properties;
combinatorial properties; combinatorics; computational
linguistics; formal languages; free monoid; programming
languages; regular infinite trees; semantics; trees
(mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{ODunlaing:1983:IRT,
author = "C. O'Dunlaing",
title = "Infinite regular {Thue} systems",
journal = j-THEOR-COMP-SCI,
volume = "25",
number = "2",
pages = "171--192",
month = mar,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Courant Inst. of Math. Sci., New York, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean algebra; computability and decidability;
DCFLs; decidability; equivalence; formal languages;
infinite regular Thue systems; linear-time solvability;
monadic Church--Rosser system; nontrivial Boolean
algebra; word problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Case:1983:CIC,
author = "J. Case and C. Smith",
title = "Comparison of identification criteria for machine
inductive inference",
journal = j-THEOR-COMP-SCI,
volume = "25",
number = "2",
pages = "193--120",
month = mar,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
(Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., State Univ. of New York,
Amherst, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; computational complexity; general
success criteria; identification criteria; inductive
inference machines; natural hierarchy; philosophy of
science; program anomalies; program synthesis;
recursive function theory; recursive functions;
tradeoff results",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Priese:1983:AC,
author = "L. Priese",
title = "Automata and concurrency",
journal = j-THEOR-COMP-SCI,
volume = "25",
number = "3",
pages = "221--265",
month = jul,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Fachbereich Math.-Informatik, Univ. GH Paderborn,
Paderborn, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; concurrent system; modular concurrent
systems; multiprocessing systems; nonpersistent
concurrent system; Petri net",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Milner:1983:CSA,
author = "R. Milner",
title = "Calculi for synchrony and asynchrony",
journal = j-THEOR-COMP-SCI,
volume = "25",
number = "3",
pages = "267--310",
month = jul,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4230B (Combinatorial switching theory)",
corpsource = "Dept. of Computer Sci., Edinburgh Univ., Edinburgh,
UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Abelian group; algebraic theory; asynchrony;
bisimulation; calculus; combinatorial switching;
combinators; distributed computation; modelling;
synchrony",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Valk:1983:IBP,
author = "R. Valk",
title = "Infinite behaviour of {Petri} nets",
journal = j-THEOR-COMP-SCI,
volume = "25",
number = "3",
pages = "311--341",
month = jul,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4220 (Automata
theory)",
corpsource = "Fachbereich Informatik, Univ. Hamburg, Hamburg, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; firing sequences; graph theory;
infinite behaviour; Petri net",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kinber:1983:IPS,
author = "E. B. Kinber",
title = "The inclusion problem for some classes of
deterministic multitape automata",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "1--2",
pages = "1--24",
month = sep,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Computing Center, Latvian State Univ., Riga, Latvian,
USSR",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic automata; deterministic multitape
automata; inclusion problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Sudborough:1983:BCP,
author = "I. H. Sudborough",
title = "Bandwidth constraints on problems complete for
polynomial time",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "1--2",
pages = "25--52",
month = sep,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Electrical Engng. and Computer Sci.,
Northwestern Univ., Evanston, IL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "and/or graph accessibility problem; bandwidth
constraints; log space transformations; polynomial
time; solvable path system problem; time-space bounds;
Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{deBakker:1983:ICD,
author = "J. W. {de Bakker} and J.-J. Ch. Meyer and J. I.
Zucker",
title = "On infinite computations in denotational semantics",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "1--2",
pages = "53--82",
month = sep,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Math. Center, Amsterdam,
Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "denotational semantics; fixed point characterizations;
formal languages; infinite computations; iteration;
languages; recursion",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Istrail:1983:NPS,
author = "S. Istrail and C. Masalagiu",
title = "{Nivat}'s processing systems: decision problems
related to protection and synchronization",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "1--2",
pages = "83--103",
month = sep,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Univ. Al.I. Cuza, Iasi, Romania",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract notion; compatibility; decision problems;
formal languages; Nivat's processing systems;
protection; synchronisation; synchronization",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hehner:1983:MCM,
author = "E. C. R. Hehner and C. A. R. Hoare",
title = "A more complete model of communicating processes",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "1--2",
pages = "105--120",
month = sep,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Computer Systems Res. Group, Univ. of Toronto,
Toronto, Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "communicating processes; complete model; partial
recursive functions; programming theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Emerson:1983:AST,
author = "E. A. Emerson",
title = "Alternative semantics for temporal logics",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "1--2",
pages = "121--130",
month = sep,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Texas, Austin, TX,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract computation path semantics; concurrent
program; formal logic; temporal logics",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Weihrauch:1983:ARE,
author = "K. Weihrauch and G. Schafer",
title = "Admissible representations of effective {CPO's}",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "1--2",
pages = "131--147",
month = sep,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Fachbereich Math./Informatik, Fernuniv. Hagen, Hagen,
West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract objects; admissible representations; complete
partial orders; computability and decidability;
concrete machine; Godel numberings; partial recursive
functions",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ginsburg:1983:ODR,
author = "S. Ginsburg and R. Hull",
title = "Order dependency in the relational model",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "1--2",
pages = "149--195",
month = sep,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational databases)",
corpsource = "Dept. of Computer Sci., Univ. of Southern California,
Los Angeles, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "attribute domains; database management systems; fixed
orderings; formalism; order dependency; propositional
calculus; relational model; semantic information",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ibarra:1983:SPL,
author = "O. H. Ibarra and L. E. Rosier",
title = "Simple programming languages and restricted classes of
{Turing} machines",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "1--2",
pages = "197--220",
month = sep,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Minnesota,
Minneapolis, MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "characterizations; computational power; programming
languages; restricted classes; space bounded classes;
time complexity classes; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Arnold:1983:ROL,
author = "A. Arnold",
title = "Rational omega-languages are non-ambiguous",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "1--2",
pages = "221--223",
month = sep,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Univ. de Poitiers, Poitiers, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic automata; formal languages; nonambiguous
automaton; rational omega-languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Rajlich:1983:DPS,
author = "V. Rajlich",
title = "Determinism in parallel systems",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "1--2",
pages = "225--231",
month = sep,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Computer and Communication Sci., Univ. of
Michigan, Ann Arbor, MI, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "determinism; deterministic automata; H-graphs;
parallel systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bucher:1983:IDW,
author = "W. Bucher and J. Hagauer",
title = "It is decidable whether a regular language is pure
context-free",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "1--2",
pages = "233--241",
month = sep,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. fur Informationsverarbeitung, Tech. Univ. Graz,
Graz, Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability and decidability; context-free grammar;
context-free grammars; context-free languages; regular
language",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ginsburg:1983:CFD,
author = "S. Ginsburg and R. Hull",
title = "Characterizations for functional dependency and
{Boyce-Codd} normal form families",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "3",
pages = "243--286",
month = oct,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C6120 (File organisation); C6160 (Database
management systems (DBMS))",
corpsource = "Univ. of Southern California, Los Angeles, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic characterisation; BCNF; Boyce-Codd normal
form families; data handling; database management;
database management systems; functional dependency; set
theoretic characterisation",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{Yap:1983:SCN,
author = "C. K. Yap",
title = "Some consequences of non-uniform conditions on uniform
classes",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "3",
pages = "287--300",
month = oct,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Southern California,
University Park, Los Angeles, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; conjunctive reducibility;
disjunctive reducibility; Meyer-Stockmeyer hierarchy;
nonuniform conditions; uniform classes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Rozenberg:1983:SLPa,
author = "G. Rozenberg and R. Verraedt",
title = "Subset languages of {Petri} nets. {I}. The
relationship to string languages and normal forms",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "3",
pages = "301--326",
month = oct,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. of Appl. Math. and Computer Sci., Univ. of
Leiden, Leiden, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal languages; normal forms; Petri nets; string
languages; subset firing sequences; subset language;
subset languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Zak:1983:TMT,
author = "S. Zak",
title = "A {Turing} machine time hierarchy",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "3",
pages = "327--333",
month = oct,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Inst. for Computation Techniques, Tech. Univ. Praha,
Praha, Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; nondeterministic Turing
machines; time complexity measure; translational
diagonalization; Turing machine time hierarchy; Turing
machines; universal machine",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hartmanis:1983:GSS,
author = "J. Hartmanis",
title = "On Godel speed-up and succinctness of language
representations",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "3",
pages = "335--342",
month = oct,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal languages; Godel speed-up; language
representations; nonrecursive shortening;
succinctness",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Staples:1983:CBA,
author = "J. Staples and V. L. Nguyen",
title = "Computing the behaviour of asynchronous processes",
journal = j-THEOR-COMP-SCI,
volume = "26",
number = "3",
pages = "343--353",
month = oct,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Queensland, St.
Lucia, Qld., Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "asynchronous processes; automata theory;
nondeterministic asynchronous process",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hunt:1983:CMR,
author = "H. B. Hunt and D. J. Rosenkrantz",
title = "The complexity of monadic recursion schemes:
executability problems, nesting depth, and
applications",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "1--2",
pages = "3--38",
month = nov,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer Sci., State Univ. of New York,
Albany, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability and decidability; computational
complexity; decision problems; divergence;
executability problems; isomorphism; lower bounds;
monadic recursion schemes complexity; nesting depth;
polynomial bounds; strong equivalence; upper bounds;
weak equivalence",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kamimura:1983:ARP,
author = "T. Kamimura and A. Tang",
title = "Algebraic relations and presentations",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "1--2",
pages = "39--60",
month = nov,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Kansas, Lawrence, KS,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic lattices; algebraic presentations; algebraic
relations; computability and decidability;
computability theory; congruence relation; mathematical
foundations; quotients; Scott's continuous lattices",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Inoue:1983:TDA,
author = "K. Inoue and I. Takanami and H. Taniguchi",
title = "Two-dimensional alternating {Turing} machines",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "1--2",
pages = "61--83",
month = nov,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Electronics, Yamaguchi Univ., Ube, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "2-ATM; complexity classes; connected patterns;
recognizability; three-way two-dimensional Turing
machine; TR2-ATM; Turing machines; two-dimensional
alternating Turing machine",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Rozenberg:1983:SLPb,
author = "G. Rozenberg and R. Verraedt",
title = "Subset languages of {Petri} nets. {II}. Closure
properties",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "1--2",
pages = "85--108",
month = nov,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. of Appl. Math. and Computer Sci., Univ. of
Leiden, Leiden, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "closure properties; formal languages; homomorphism;
intersection; inverse homomorphism; iterated product;
Petri nets; product; regular languages; shuffle; subset
languages; union",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Smyth:1983:LCC,
author = "M. B. Smyth",
title = "The largest {Cartesian} closed category of domains",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "1--2",
pages = "109--119",
month = nov,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Edinburgh, Edinburgh,
UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm theory; domain; function space; largest
Cartesian closed category; necessary and sufficient
condition; programming theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Duris:1983:OWS,
author = "P. Duris and J. Hromkovic",
title = "One-way simple multihead finite automata are not
closed under concatenation",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "1--2",
pages = "121--125",
month = nov,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Computing Centre, Slovak Acad. of Sci., Bratislava,
Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite automata; formal languages; one way simple
multihead finite automata",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Halpern:1983:PDL,
author = "J. Y. Halpern and J. H. Reif",
title = "The propositional dynamic logic of deterministic,
well-structured programs",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "1--2",
pages = "127--165",
month = nov,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Aiken Computation Lab., Harvard Univ., Cambridge, MA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic well structured programs; dynamic
programming; formal logic; polynomial space complete;
programming theory; propositional dynamic logic; strict
deterministic propositional dynamic logic",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrich:1983:ADE,
author = "H.-D. Ehrich and U. Lipeck",
title = "Algebraic domain equations",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "1--2",
pages = "167--196",
month = nov,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. fur Theoretische und Praktische Informatik,
Tech. Univ. Braunschweig, Braunschweig, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic data types; algebraic domain equations;
algorithm theory; parameter passing; parametric
version; Scott's theory; specification method",
pubcountry = "Netherlands",
treatment = "N New Development; T Theoretical or Mathematical",
}
@Article{Stolboushkin:1983:CEP,
author = "A. P. Stolboushkin and M. A. Taitslin",
title = "The comparison of the expressive power of first-order
dynamic logics",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "1--2",
pages = "197--209",
month = nov,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Kazakh Univ., Alma-Ata, USSR",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free logic; deterministic regular logic;
expressive power; first-order dynamic logics; formal
logic; omega-order logic",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bozapalidis:1983:RFT,
author = "S. Bozapalidis and O. Louscou-Bozapalidou",
title = "The rank of a formal tree power series",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "1--2",
pages = "211--215",
month = nov,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Aristotle Univ. of Thessaloniki,
Thessaloniki, Greece",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal logic; formal tree power series; Myhill-like
criterion; rank; series (mathematics);
tree-recognizability; trees (mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Maruoka:1983:OMT,
author = "A. Maruoka",
title = "Open maps for tessellation automata",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "1--2",
pages = "217--224",
month = nov,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Faculty of Engng., Tohoku Univ., Sendai, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite automata; open parallel maps; tessellation
automata",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Adamek:1983:SCA,
author = "J. Adamek and E. Nelson",
title = "Separately continuous algebras",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "1--2",
pages = "225--231",
month = nov,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "FEL-CVUT, Praha, Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computation theory; computer science; flowchart
schemes; power series; recursive programs; semantics;
separately continuous algebras",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Dobkin:1983:FDP,
author = "D. P. Dobkin and D. G. Kirkpatrick",
title = "Fast detection of polyhedral intersection",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "3",
pages = "241--253",
month = dec,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4190 (Other numerical methods)",
corpsource = "Dept. of Electrical Engng. and Computer Sci.,
Princeton Univ., Princeton, NJ, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational geometry; geometric computing; geometry;
plane-polyhedron intersection; polyhedral intersection;
polyhedron-polyhedron intersection; preprocessed
polyhedra; upper bounds",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrig:1983:CPP,
author = "H. Ehrig and H.-J. Kreowski",
title = "Compatibility of parameter passing and implementation
of parameterized data types",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "3",
pages = "255--286",
month = dec,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Fachbereich Informatik, Tech. Univ. Berlin, Berlin,
West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "2- dimensional compatibility; abstract data types;
algebra; algebraic specifications; binary trees; data
structures; final algebra semantics; initial algebra
semantics; parameter passing; parameterized data types;
programming theory; software systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Blum:1983:MPC,
author = "N. Blum",
title = "More on the power of chain rules in context-free
grammars",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "3",
pages = "287--295",
month = dec,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Fachbereich Angewandte Math. und Informatik, Univ. des
Saarlandes, Saarbrucken, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "chain rules; context-free grammars; context-free
language; context-free languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Tennent:1983:SIC,
author = "R. D. Tennent",
title = "Semantics of interference control",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "3",
pages = "297--310",
month = dec,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computing and Information Sci., Queen's
Univ., Kingston, Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "denotational semantic model; interference control;
interference suppression; program phrases; programming
theory; syntactic control",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrenfeucht:1983:RCF,
author = "A. Ehrenfeucht and D. Haussler and G. Rozenberg",
title = "On regularity of context-free languages",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "3",
pages = "311--332",
month = dec,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder,
CO, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "commutativity; context-free grammars; context-free
languages; Higman; Myhill-Nerode characterisation;
periodic languages; productions; regularity; rewriting
system; semiThue system; subsequence embedding
relation; unitary grammar; well-quasi orders",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kozen:1983:RPM,
author = "D. Kozen",
title = "Results on the propositional mu-calculus",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "3",
pages = "333--354",
month = dec,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math. Sci., IBM Res. Center, Yorktown
Heights, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deductive system; exponential-time decision procedure;
formal logic; L mu; least fixpoint operator;
propositional dynamic logic; propositional modal logic;
propositional mu -calculus; small model property",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Paul:1984:HVT,
author = "W. Paul",
title = "On heads versus tapes",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "1--2",
pages = "1--12",
month = jan,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "IBM Res. Lab., San Jose, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "d-dimensional ik-tape Turing machines; heads; Turing
machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Maluszynski:1984:TPL,
author = "J. Maluszynski",
title = "Towards a programming language based on the notion of
two-level grammar",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "1--2",
pages = "13--43",
month = jan,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Software Systems Res. Center, Linkoping Univ.,
Linkoping, Sweden",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract nonalgorithmic specifications; computability;
grammars; Horn clauses; natural language; programming
language; transparent grammars; two-level grammar",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrig:1984:PPA,
author = "H. Ehrig and H.-J. Kreowski and J. Thatcher and E.
Wagner and J. Wright",
title = "Parameter passing in algebraic specification
languages",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "1--2",
pages = "45--81",
month = jan,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Tech. Univ. Berlin, Berlin, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic specification languages; formal languages;
model functor; parameter passing mechanism;
parameterized data types; semantics",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Apt:1984:TYH,
author = "K. R. Apt",
title = "Ten years of Hoares logic: a survey. {II}.
Nondeterminism",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "1--2",
pages = "83--109",
month = jan,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "LITP Univ. Paris, Paris, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "correctness; fairness; formal logic; Hoares logic;
nondeterministic programs; survey",
pubcountry = "Netherlands",
treatment = "G General Review",
}
@Article{Wiehagen:1984:PPS,
author = "R. Wiehagen and R. Freivalds and E. B. Kinber",
title = "On the power of probabilistic strategies in inductive
inference",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "1--2",
pages = "111--133",
month = jan,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math., Humboldt-Univ., Berlin, East Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; deterministic strategy;
function classes; inductive inference; input/output
examples; probabilistic strategies; probability;
programming theory; programs; recursive functions",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bini:1984:CA,
author = "D. Bini",
title = "On commutativity and approximation",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "1--2",
pages = "135--150",
month = jan,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math., Univ. of Pisa, Pisa, Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "approximation; border rank; commutative border rank;
commutativity; computational complexity; matrix-vector
product; polynomial evaluation; polynomials",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{RonchiDellaRocca:1984:PTS,
author = "S. {Ronchi Della Rocca} and B. Venneri",
title = "Principal type schemes for an extended type theory",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "1--2",
pages = "151--169",
month = jan,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dipartimento di Informatica, Univ. di Torino, Torino,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Curry's basic functionality theory; formal logic;
principal type schemes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Fernandez:1984:DCC,
author = "C. Fernandez and P. S. Thiagarajan",
title = "{D}-continuous causal nets: a model of non-sequential
processes",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "1--2",
pages = "171--196",
month = jan,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Gesellschaft fur Math. und Datenverabeitung mbH Bonn,
St. Augustin, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "D-continuous causal nets; Dedekind's definition; graph
theory; model; nonsequential processes; Petri nets",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ehrenfeucht:1984:IAE,
author = "A. Ehrenfeucht and G. Rozenberg and R. Verraedt",
title = "On inherently ambiguous {E0L} languages",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "1--2",
pages = "197--214",
month = jan,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder,
CO, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "ambiguous; context-free languages; E0L languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bergstra:1984:HLP,
author = "J. A. Bergstra and J. V. Tucker",
title = "{Hoare}'s logic for programming languages with two
data types",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "1--2",
pages = "215--221",
month = jan,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Math. Centre, Amsterdam,
Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean functions; Boolean variables; completeness;
counters; data types; first-order assertion language;
formal languages; Hoare's logic; programming languages;
while-programs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kanaoka:1984:DSS,
author = "T. Kanaoka and S. Tomita",
title = "The decomposition of stochastic systems",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "1--2",
pages = "223--233",
month = jan,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Electronics, Yamaguchi Univ., Ube, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "decomposition; deterministic automata; stochastic
systems; substitution property; whirl interconnection",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hindley:1984:CDT,
author = "J. R. Hindley",
title = "{Coppo-Dezani} types do not correspond to
propositional logic",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "1--2",
pages = "235--236",
month = jan,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Univ. Coll. of Swansea, Swansea, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal logic; Pottinger's explanation; propositional
logic",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Cox:1984:CNA,
author = "P. T. Cox and T. Pietrzykowski",
title = "A complete, nonredundant algorithm for reversed
Skolemization",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "3",
pages = "239--261",
month = feb,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Univ. of Auckland, Auckland, New Zealand",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm theory; closed quantified literals; complete
nonredundant algorithm; Completeness; Nonredundancy;
predicate logic; reversed Skolemization; Skolem
functions; Soundness",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kirkpatrick:1984:UBS,
author = "D. Kirkpatrick and S. Reisch",
title = "Upper bounds for sorting integers on random access
machines",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "3",
pages = "263--276",
month = feb,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of British Columbia,
Vancouver, BC, Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "addition; algorithm theory; automata theory; integer
division; integers sorting; models; multiplication;
random access machines; random-access storage; sorting;
subtraction; upper bounds",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bucher:1984:CFC,
author = "W. Bucher and H. A. Maurer and K. Culik",
title = "Context-free complexity of finite languages",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "3",
pages = "277--285",
month = feb,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
(Programming and algorithm theory)",
corpsource = "Inst. fur Informationsverarbeitung, Tech. Univ. Graz,
Graz, Austria",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; context-free complexity;
context-free languages; finite automata; finite
languages; grammatical complexity; necessary condition;
sublinear complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Parisi-Presicce:1984:IFA,
author = "F. Parisi-Presicce",
title = "Iterative factor algebras and induced metrics",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "3",
pages = "287--298",
month = feb,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C4130 (Interpolation and function
approximation)",
corpsource = "Dept. of Math., Univ. of Southern California, Los
Angeles, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "fixed-point equations; induced metrics; iterative
factor algebras; iterative methods; matrix algebra;
necessary and sufficient condition; nontrivial finite
system; regular trees",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kelemenova:1984:CNF,
author = "A. Kelemenova",
title = "Complexity of normal form grammars",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "3",
pages = "299--314",
month = feb,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Math. Inst., Slovak Acad. of Sci., Bratislava,
Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free grammars; context-free languages;
descriptional complexity; normal form grammars;
position restricted grammars",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kobayashi:1984:COR,
author = "K. Kobayashi and M. Takahashi and H. Yamasaki",
title = "Characterization of omega-regular languages by
first-order formulas",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "3",
pages = "315--327",
month = feb,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Information Sci., Tokyo Inst. of Technol.,
Tokyo, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "closed sets; finite automata; first-order formulas;
formal languages; omega-regular languages; prenex
normal form; topological hierarchy",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Perrin:1984:CBC,
author = "D. Perrin",
title = "Completing biprefix codes",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "3",
pages = "329--336",
month = feb,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "LITP, Univ. de Rouen, Mont Saint Aignan, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "biprefix code; codes; finite automata; finite
automaton; free monoid; prefix code; subset; suffix
code",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Blum:1984:BFR,
author = "N. Blum",
title = "A {Boolean} function requiring $3n$ network size",
journal = j-THEOR-COMP-SCI,
volume = "28",
number = "3",
pages = "337--345",
month = feb,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Univ. des Saarlandes, Saarbrucken, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "2.5n-lower bound; 3n network size; Boolean function;
Boolean functions; network complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Traub:1984:ACO,
author = "J. F. Traub and G. W. Wasilkowski and H.
Wozniakowski",
title = "Average case optimality for linear problems",
journal = j-THEOR-COMP-SCI,
volume = "29",
number = "1--2",
pages = "1--25",
month = mar,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0290F (Interpolation and function approximation);
C4130 (Interpolation and function approximation)",
corpsource = "Dept. of Computer Sci. and Math., Columbia Univ., New
York, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "adaptive information; approximation theory; average
case optimality; interpolation; linear problems;
optimal algorithm; optimal information",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Orlowska:1984:RNI,
author = "E. Orlowska and Z. Pawlak",
title = "Representation of nondeterministic information",
journal = j-THEOR-COMP-SCI,
volume = "29",
number = "1--2",
pages = "27--39",
month = mar,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B6110 (Information theory); C1260 (Information
theory)",
corpsource = "Inst. of Computer Sci., Polish Acad. of Sci., Warsaw,
Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deduction methods; information theory; knowledge
representation system; nondeterministic information
representation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Rozenberg:1984:SPE,
author = "G. Rozenberg and R. Verraedt",
title = "On simulation and propagating {E0L} forms",
journal = j-THEOR-COMP-SCI,
volume = "29",
number = "1--2",
pages = "41--48",
month = mar,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. of Appl. Math. and Computer Sci., Univ. of
Leiden, Leiden, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; E0L forms; simulation lemma",
pubcountry = "Netherlands",
treatment = "N New Development; T Theoretical or Mathematical",
}
@Article{Fraenkel:1984:WGC,
author = "A. S. Fraenkel",
title = "{Wythoff} games, continued fractions, cedar trees and
{Fibonacci} searches",
journal = j-THEOR-COMP-SCI,
volume = "29",
number = "1--2",
pages = "49--73",
month = mar,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0240E (Game theory); B0250 (Combinatorial
mathematics); C1140E (Game theory); C1160
(Combinatorial mathematics)",
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 = "algebraic strategy; arithmetic strategies; binary
trees; cedar trees; continued fractions; Fibonacci
searches; game theory; misere play; recursive strategy;
trees (mathematics); Wythoff games",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Frederickson:1984:RRO,
author = "G. N. Frederickson",
title = "Recursively rotated orders and implicit data
structures: a lower bound",
journal = j-THEOR-COMP-SCI,
volume = "29",
number = "1--2",
pages = "75--85",
month = mar,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Computer Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "data structures; implicit data structures; lower
bound; recursively rotated orders; trees
(mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Janicki:1984:NSC,
author = "R. Janicki",
title = "Nets, sequential components and concurrency
relations",
journal = j-THEOR-COMP-SCI,
volume = "29",
number = "1--2",
pages = "87--121",
month = mar,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Inst. of Math., Warsaw Tech. Univ., Warszawa, Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "concurrency relations; finite automata; finite state
machines; sequential components; sequential systems;
static structure; unmarked nets",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ibarra:1984:CCC,
author = "O. H. Ibarra and S. M. Kim",
title = "Characterizations and computational complexity of
systolic trellis automata",
journal = j-THEOR-COMP-SCI,
volume = "29",
number = "1--2",
pages = "123--153",
month = mar,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Minnesota,
Minneapolis, MN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; characterisation; computational
complexity; computing power; lower bounds; systolic
trellis automata; Turing machines; upper bounds; VLSI",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kamimura:1984:EGS,
author = "T. Kamimura and A. Tang",
title = "Effectively given spaces",
journal = j-THEOR-COMP-SCI,
volume = "29",
number = "1--2",
pages = "155--166",
month = mar,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Kansas, Lawrence, KS,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computable object; domains theory; effectively given
domains; equivalent formulations; programming theory;
spaces",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lassez:1984:CFS,
author = "J.-L. Lassez and M. J. Maher",
title = "Closures and fairness in the semantics of programming
logic",
journal = j-THEOR-COMP-SCI,
volume = "29",
number = "1--2",
pages = "167--184",
month = mar,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Melbourne, Parkville,
Vic., Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "closures; fair chaotic interactions; fair SLD
resolution; fixed point theorem; parallel processing;
programming logic; programming theory; semantics",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Fachini:1984:HPR,
author = "E. Fachini and M. Napoli",
title = "Hierarchies of primitive recursive wordsequence
functions: comparisons and decision problems",
journal = j-THEOR-COMP-SCI,
volume = "29",
number = "1--2",
pages = "185--227",
month = mar,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Istituto di Sci. dell'Informazione, Univ. di Salerno,
Salerno, Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "acceptors; closure; comparisons; composition;
cylindrification; decidability results; decision
problems; finite sets; iteration; LOOP programs;
primitive recursive wordsequence functions; programming
theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Elrad:1984:WPS,
author = "T. Elrad and N. Francez",
title = "A weakest precondition semantics for communicating
processes",
journal = j-THEOR-COMP-SCI,
volume = "29",
number = "3",
pages = "231--250",
month = apr,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Illinois Inst. of Technol.,
Chicago, IL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "communicating processes; CSP constructs; distributed
processing; formal languages; weakest precondition
semantics",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{VenturiniZilli:1984:RGL,
author = "M. {Venturini Zilli}",
title = "Reduction graphs in the lambda calculus",
journal = j-THEOR-COMP-SCI,
volume = "29",
number = "3",
pages = "251--275",
month = apr,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Istituto per le Applicazioni del Calcolo, CNR, Roma,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "calculus; cyclic equivalence; graph theory; lambda
calculus; partial ordering; reduction graphs",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Potts:1984:REJ,
author = "D. H. Potts",
title = "Remarks on an example of Jantzen",
journal = j-THEOR-COMP-SCI,
volume = "29",
number = "3",
pages = "277--284",
month = apr,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Maths., California State Univ., Northridge,
CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; monoid J; single rewriting
rule; Thue system",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Karhumaki:1984:ECC,
author = "J. Karhumaki",
title = "The {Ehrenfeucht} conjecture: a compactness claim for
finitely generated free monoids",
journal = j-THEOR-COMP-SCI,
volume = "29",
number = "3",
pages = "285--308",
month = apr,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Univ. of Turku, Turku, Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "compactness; context-free languages; D0L languages;
Ehrenfeucht conjecture; finitely generated free
monoids; HD0L sequence equivalence problem; language;
morphisms",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Coppo:1984:CTA,
author = "M. Coppo",
title = "Completeness of type assignment in continuous lambda
models",
journal = j-THEOR-COMP-SCI,
volume = "29",
number = "3",
pages = "309--324",
month = apr,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4230B (Combinatorial switching theory)",
corpsource = "Dipartimento di Informatica, Univ. di Torino, Torino,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "calculus; combinatorial switching; completeness;
completeness proof; continuous lambda models; Curry's
rules; fixed point combinator; pure lambda-calculus;
syntactic nature; type assignment",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Eisman:1984:RGF,
author = "G. S. Eisman",
title = "On the ratio of growth functions in {EDT0L}
languages",
journal = j-THEOR-COMP-SCI,
volume = "29",
number = "3",
pages = "325--349",
month = apr,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Saint Mary's Coll. of California,
Moraga, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; context-free languages; EDT0L languages;
generating system; growth functions; limit value; real
numbers",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bergstra:1984:PPI,
author = "J. A. Bergstra and J. W. Klop",
title = "Proving program inclusion using {Hoare}'s logic",
journal = j-THEOR-COMP-SCI,
volume = "30",
number = "1",
pages = "1--48",
month = apr,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Leiden, Leiden,
Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "conservative refinements; formal logic; Hoare's logic;
program correctness; program inclusion; programming
theory; proof theory; specifications",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Olderog:1984:CPP,
author = "E.-R. Olderog",
title = "Correctness of programs with {PASCAL-like} procedures
without global variables",
journal = j-THEOR-COMP-SCI,
volume = "30",
number = "1",
pages = "49--90",
month = apr,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C6140D (High level languages)",
corpsource = "Inst. fur Informatik und Praktische Math.,
Christian-Albrechts-Univ. Kiel, Kiel, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "blockstructured programs; formal computation trees;
formal logic; global variables; high level languages;
Hoare-like system; L/sub Pas/; partial correctness;
PASCAL-like procedures; programming language; programs
correctness",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Austry:1984:APS,
author = "D. Austry and G. Boudol",
title = "Algebra of processes and synchronisation",
journal = j-THEOR-COMP-SCI,
volume = "30",
number = "1",
pages = "91--131",
month = apr,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "CMA-ENSMP, Valbonne, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "asynchronous parallel composition; formal languages;
synchronisation; synchronization primitives;
synchronous calculus",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{deSimone:1984:MSI,
author = "R. {de Simone}",
title = "On {MEIJE} and {SCCS}: infinite sum operators vs.
non-guarded definitions",
journal = j-THEOR-COMP-SCI,
volume = "30",
number = "1",
pages = "133--138",
month = apr,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Centre de Math. Appl., Ecole des Mines, Valbonne,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "formal logic; free commutative finitely generated
monoid; infinite sum operators; MEIJE; nonguarded
definitions; recursively enumerable subsets; SCCS",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Klaeren:1984:CMA,
author = "H. A. Klaeren",
title = "A constructive method for abstract algebraic software
specification",
journal = j-THEOR-COMP-SCI,
volume = "30",
number = "2",
pages = "139--204",
month = aug,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming)",
corpsource = "Lehrstuhl fur Informatik II, RWTH Aachen, Aachen, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract algebraic software specification; data
structure; data structures; explicit specification;
program and system documentation; software engineering;
structural recursive schemata",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Braquelaire:1984:STS,
author = "J. P. Braquelaire and B. Courcelle",
title = "The solutions of two star-height problems for regular
trees",
journal = j-THEOR-COMP-SCI,
volume = "30",
number = "2",
pages = "205--239",
month = aug,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Maths. and Computer Sci., Bordeaux-I Univ.,
Talence, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "deterministic automata; graph theory; minimal
deterministic automaton; minimal graph; minimal
starheight; rational expressions; regular languages;
regular trees; trees (mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Genrich:1984:TBS,
author = "H. J. Genrich and P. S. Thiagarajan",
title = "A theory of bipolar synchronization schemes",
journal = j-THEOR-COMP-SCI,
volume = "30",
number = "3",
pages = "241--318",
month = nov,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Gesellschaft fur Math. und Datenverarbeitung, Bonn,
West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bipolar synchronization schemes; computational
interpretation; concurrent programs; directed graphs;
distributed systems; model; Petri nets",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Denenberg:1984:CSP,
author = "L. Denenberg and H. R. Lewis",
title = "The complexity of the satisfiability problem for Krom
formulas",
journal = j-THEOR-COMP-SCI,
volume = "30",
number = "3",
pages = "319--341",
month = nov,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.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; Krom formulas; lower bounds;
predicate letters; quantifier prefix; satisfiability
problem; upper bounds",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Yamasaki:1984:GPL,
author = "H. Yamasaki and M. Takahashi",
title = "Generalized parenthesis languages and minimization of
their parenthesis parts",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "1--2",
pages = "1--11",
month = may,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Information Sci., Tokyo Inst. of Technol.,
Tokyo, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cfl; context-free languages; decision problems;
generalized parenthesis language; minimization; nesting
property; regular sets; regularity problem; terminal
symbols",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Soundararajan:1984:PTP,
author = "N. Soundararajan",
title = "A proof technique for parallel programs",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "1--2",
pages = "13--29",
month = may,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C6140 (Programming languages)",
corpsource = "Dept. of Computer and Information Sci., Ohio State
Univ., Columbus, OH, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "axioms; parallel programming language; parallel
programs; programming languages; proof technique;
shared variables; synchronization statements",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{Bruce:1984:CAT,
author = "K. Bruce and G. Longo",
title = "On combinatory algebras and their expansions",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "1--2",
pages = "31--40",
month = may,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Math. Sci., Williams Coll., Williamstown, MA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "applicative structure; combinatorial mathematics;
combinatory algebras; combinatory completeness;
functional application",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Schoning:1984:MPP,
author = "U. Schoning",
title = "Minimal pairs for {P}",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "1--2",
pages = "41--48",
month = may,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. fur Informatik, Univ. Stuttgart, Stuttgart, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; counterintuitive result;
general minimal pair theorem; NP; recursive function
theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Mahr:1984:CSL,
author = "B. Mahr and J. A. Makowsky",
title = "Characterizing specification languages which admit
initial semantics",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "1--2",
pages = "49--59",
month = may,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C6140D (High level languages)",
corpsource = "Dept. of Computer Sci., Pennsylvania State Univ.,
University Park, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "axiomatic approach; equivalence; high level languages;
initial semantics; reducibility; specification
languages characterisation",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Honkala:1984:BAN,
author = "J. Honkala",
title = "Bases and ambiguity of number systems",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "1--2",
pages = "61--71",
month = may,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Math. Dept., Univ. of Turku, Turku, Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "ambiguity; bases; language theory; number systems;
number theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Escrig:1984:CPO,
author = "D. F. Escrig",
title = "A characterization of {Plotkin}'s order in
powerdomains, and some of its properties",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "1--2",
pages = "73--82",
month = may,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. de Ecuaciones Funcionales, Univ. Complutense,
Madrid, Spain",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Egli-Milner's order; equivalence classes; generating
trees; powerdomains; trees (mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{DeSimone:1984:IMP,
author = "R. {De Simone}",
title = "Infinitary and mixed product languages",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "1--2",
pages = "83--100",
month = may,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Centre de Math. Appliqu{\'e}es, Ecole des Mines de
Paris, Valbonne, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finitary/infinitary languages; formal languages;
parallel computing theories; path-expressions; process
behaviours; shuffle product; transition systems; vector
languages theories",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ko:1984:RRN,
author = "Ker-I Ko",
title = "Reducibilities on real numbers",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "1--2",
pages = "101--123",
month = may,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Houston, Houston, TX,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; generalised truth-table
reducibility; polynomial time reducibilities; real
numbers; recursive function theory; reducibility;
relative computability; Turing",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Plaisted:1984:NNH,
author = "D. A. Plaisted",
title = "New {NP-hard} and {NP-complete} polynomial and integer
divisibility problems",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "1--2",
pages = "125--138",
month = may,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4130 (Interpolation and function approximation);
C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Illinois, Urbana, IL,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arithmetic sequences; computational complexity;
differential equations; divisibility properties;
eigenvalues; inequalities; integer divisibility
problems; Linnik theorem; NP-complete polynomial;
NP-hard; polynomials; primes; recurrence relations;
ring homomorphisms; sparse binary numbers; sparse
matrices; sparse polynomials",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Head:1984:ADL,
author = "T. Head",
title = "Adherences of {D0L} languages",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "1--2",
pages = "139--149",
month = may,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math. Sci., Univ. of Alaska, Fairbanks, AK,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "adherence equivalence; context-free languages; D0L
languages; finite number; sequences",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Mezghiche:1984:NRC,
author = "M. Mezghiche",
title = "A new $c \beta$-reduction in combinatory logic",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "1--2",
pages = "151--162",
month = may,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4230B (Combinatorial switching theory)",
corpsource = "LITP, Univ. de Paris VII, Paris, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "C beta -reduction; combinatorial switching;
combinatory logic; lambda -calculus",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Narendran:1984:UPT,
author = "P. Narendran and R. McNaughton",
title = "The undecidability of the preperfectness of {Thue}
systems",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "1--2",
pages = "165--174",
month = may,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math. Sci., Rensselaer Polytech. Inst., Troy,
NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Church--Rosser property; computability and
decidability; formal languages; preperfectness; Thue
systems; undecidability; word problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Goguen:1984:SFAa,
author = "J. A. Goguen and R. M. Burstall",
title = "Some fundamental algebraic tools for the semantics of
computation. {I}. Comma categories, colimits,
signatures and theories",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "1--2",
pages = "175--209",
month = may,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Computer Sci. Lab., SRI Internat., Menlo Park, CA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic tools; category theory; colimits; comma
categories; computation semantics; computational
complexity; program specifications; signatures",
pubcountry = "Netherlands",
treatment = "B Bibliography; T Theoretical or Mathematical",
}
@Article{Ehrenfeucht:1984:RNG,
author = "A. Ehrenfeucht and M. G. Main and G. Rozenberg",
title = "Restrictions on {NLC} graph grammars",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "1--2",
pages = "211--223",
month = may,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder,
CO, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free string grammars; derivation rules;
embedding mechanism; grammars; graph languages; NLC
graph grammars; node-label controlled grammars",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Uchimura:1984:TIM,
author = "K. Uchimura",
title = "Truncations of infinite matrices and algebraic series
associated with some {CF} grammars",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "3",
pages = "227--261",
month = jun,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Computer Sci., Yamanashi Univ., Kofu, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic series; asymptotic analysis; CF grammars;
context free grammar; context-free grammars;
convergence; entropy; grammatical strings; infinite
matrices truncations; least positive zero; polynomial;
series (mathematics); structure generating function",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Goguen:1984:SFAb,
author = "J. A. Goguen and R. M. Burstall",
title = "Some fundamental algebraic tools for the semantics of
computation. {II}. Signed and abstract theories",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "3",
pages = "263--295",
month = jun,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Computer Sci. Lab., SRI Internat., Menlo Park, CA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract theory; algebraic tools; computation;
isomorphism class; programming; programming theory;
semantics; signature isomorphism",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Alaiwan:1984:EIB,
author = "H. Alaiwan",
title = "Equivalance of infinite behavior of finite automata",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "3",
pages = "297--306",
month = jun,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "LCR Thomson-CSF, Corbeville, Orsay, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "equivalence; finite automata; infinite behavior;
necessary and sufficient condition; space complexity;
time complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Yamasaki:1984:NPN,
author = "H. Yamasaki",
title = "Normal {Petri} nets",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "3",
pages = "307--315",
month = jun,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Dept. of Information Sci., Tokyo Inst. of Technol.,
Tokyo, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "graph theory; normal Petri nets",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Oyamaguchi:1984:SRS,
author = "M. Oyamaguchi",
title = "Some results on subclass containment problems for
special classes of {DPDAs} related to nonsingular
machines",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "3",
pages = "317--335",
month = jun,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Electrical Engng., Mie Univ., Kamihama Tsu,
Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free language; context-free languages;
deterministic automata; deterministic pushdown
automaton; subclass containment problems; w-nonsingular
language",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Autebert:1984:RPL,
author = "J. M. Autebert and J. Beauquier and L. Boasson and G.
Senizergues",
title = "Remarks on parenthesis languages",
journal = j-THEOR-COMP-SCI,
volume = "31",
number = "3",
pages = "337--349",
month = jun,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Lab. d'Informatique Th{\'e}orique et de Programmation,
LITP Univ. Paris VII, Paris, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; multiparenthesis languages;
nest sets; NTS languages; parenthesis languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Raoult:1984:GR,
author = "J. C. Raoult",
title = "On graph rewritings",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "1--2",
pages = "1--24",
month = jul,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C1160 (Combinatorial mathematics);
C4210 (Formal logic)",
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 = "algebra; Bendix; Berlin school; collapsed terms;
common subterms; corresponding terms; Ehrig; formal
languages; grammars; graph rewritings; graph theory;
Knuth; local confluence criterion; partial morphisms;
Pfender; rewriting rules; Schneider; single push-out;
total functions",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Francez:1984:LHS,
author = "N. Francez and D. Lehmann and A. Pnueli",
title = "A linear-history semantics for languages for
distributed programming",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "1--2",
pages = "25--46",
month = jul,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Technion-Israel Inst. of Technol., Haifa, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "attainable states; communicating sequential processes;
deadlocks; denotational semantics; distributed
programming languages; expectation sets; linear
communication sequences; linear-history semantics;
matching; merging; ordering; parallel processing;
programming theory; semantic domains",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Duske:1984:LIL,
author = "J. Duske and R. Parchmann",
title = "Linear indexed languages",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "1--2",
pages = "47--60",
month = jul,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Inst. fur Inf., Univ. Hannover, Hannover, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "context-free languages; formal languages; full
principal semi-AFL; grammars; homomorphic images;
language generator; linear context-free grammars;
linear indexed languages; nonlinear indexed languages;
Parikh theorem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Avenhaus:1984:NRP,
author = "J. Avenhaus and K. Madlener",
title = "The {Nielsen} reduction and {P}-complete problems in
free groups",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "1--2",
pages = "61--76",
month = jul,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C4240 (Programming and algorithm
theory)",
corpsource = "Fachbereich Inf., Univ. Kaiserslautern,
Kaiserslautern, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "classical algorithmic problems; computation encoding;
computational complexity; deterministic polynomially
time bounded TM; equal subgroups; free groups;
generalised word problem; group theory; independent
generator set; isomorphic subgroups; log-space
reducibility; Nielsen reduction; P-complete problems;
polynomial time; shortest coset representatives",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Chin:1984:EIC,
author = "F. Y. Chin and P. Kossowski and S. C. Loh",
title = "Efficient inference control for range {SUM} queries",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "1--2",
pages = "77--86",
month = jul,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C4290
(Other computer theory)",
corpsource = "Dept. of Comput. Sci., Chinese Univ. of Hong Kong,
Shatin, Hong Kong",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "attribute values; auditing; computational complexity;
data structure; database management systems; databases;
inference control technique; range SUM queries; space
complexity; statistical information; time complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Tomita:1984:EDB,
author = "E. Tomita",
title = "An extended direct branching algorithm for checking
equivalence of deterministic pushdown automata",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "1--2",
pages = "87--120",
month = jul,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); 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 = "comparison tree; deterministic automata; deterministic
pushdown automata; equivalence; equivalence classes;
extended direct branching algorithm; halting; nodes
with unbounded degree; skipping step; trees
(mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Astesiano:1984:DSN,
author = "E. Astesiano and G. Costa",
title = "Distributive semantics for nondeterministic typed
lambda --- calculi",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "1--2",
pages = "121--156",
month = jul,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Istituto di Matematica, Univ. di Genova, Genova,
Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstraction; application; application distributivity;
argument sharing; basic constant symbols; binary choice
operator; denotational semantics; deterministic
equivalences; distributive semantics; equivalence
classes; formal languages; function symbols; grammars;
ground arguments; intrinsically fully abstract model;
NDPCF; nondeterministic applicative languages;
nondeterministic typed lambda -calculi; outermost
strategy; rewriting system; union operation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Vishkin:1984:PDD,
author = "U. Vishkin",
title = "A parallel-design distributed-implementation ({PDDI})
general-purpose computer",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "1--2",
pages = "157--172",
month = jul,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C5220
(Computer architecture)",
corpsource = "Dept. of Comput. Sci., Courant Inst., New York Univ.,
New York, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "auxiliary processors; common memory; computational
complexity; computer architecture; depth;
distributed-implementation; general purpose computers;
general-purpose computer; merging network; parallel
computer; parallel processing; parallel time; PDDI
computer; permissive parallel RAM computation model;
programming theory; sorting network; synchronous
distributed machine",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{McAloon:1984:PNL,
author = "D. McAloon",
title = "{Petri} nets and large finite sets",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "1--2",
pages = "173--183",
month = jul,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240 (Programming and algorithm theory)",
corpsource = "Brooklyn Coll., City Univ. of New York, New York, NY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Ackermann function; complexity; computability;
computational complexity; finite containment problem;
graph theory; Karp-Miller decision procedure;
Ketonen-Salovay; large finite sets; Paris-Harrington;
Petri nets; primitive recursive procedure; search
length bounds; set theory; upper bound",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Maier:1984:CAH,
author = "D. Maier",
title = "Connections in acyclic hypergraphs",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "1--2",
pages = "185--199",
month = jul,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)",
corpsource = "State Univ. of New York, Stony Brook, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "acyclic hypergraphs; acyclic join dependencies;
biconnected components; blocks; connections among
attributes; edge-disjoint paths; equivalence;
equivalence classes; Graham reduction; graph theory;
relational databases; subgraphs without articulation
points; tableau reduction; universal relations",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hall:1984:BCI,
author = "T. E. Hall",
title = "Biprefix codes, inverse semigroups and syntactic
monoids of injective automata",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "1--2",
pages = "201--213",
month = jul,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C4220 (Automata theory)",
corpsource = "Dept. of Math., Monash Univ., Clayton, Vic.,
Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arbitrary automata; automata theory; biprefix code; C.
Reutenauer; codes; finite monoid; finite prefix code;
group theory; groups; injective automata; inverse
monoid; inverse semigroups; J. E. Pin; language
recognition; semigroups; subsemigroup; syntactic
monoid; syntactic monoids",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Meshulam:1984:GCS,
author = "R. Meshulam",
title = "A geometric construction of a superconcentrator of
depth 2",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "1--2",
pages = "215--219",
month = jul,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)",
corpsource = "Inst. of Math., Hebrew Univ., Jerusalem, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "depth 2; digraphs; directed graphs; geometric
construction; lines vs. points incidence graph;
N-superconcentrator; projective plane",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hong:1984:TTS,
author = "J. W. Hong",
title = "A tradeoff theorem for space and reversal",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "1--2",
pages = "221--224",
month = jul,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Peking Comput. Inst., Peking, China",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity; computational complexity; input length;
offline Turing machine; reversal; space; tradeoff
theorem; Turing machines; work space; work tape heads",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Culik:1984:ITA,
author = "K. {Culik, II} and S. Yu",
title = "Iterative tree automata",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "3",
pages = "227--247",
month = aug,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Waterloo Univ., Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arity; automata theory; binary tree-connected network;
formal languages; iterative tree automaton; language
acceptor; linear time computational power;
nondeterministic Turing machine; parallel processing;
real-time computations; root; sequential input;
sequential output; systolic system; trees
(mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Otto:1984:FCR,
author = "F. Otto",
title = "Finite complete rewriting systems for the {Jantzen}
monoid and the {Greendlinger} group",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "3",
pages = "249--260",
month = aug,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Fachbereich Informatik, Kaiserslautern Univ., West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finite complete writing system; formal languages;
formal logic; grammars; Greendlinger group; Jantzen
monoid; Knuth--Bendix ordering; polynomial-time
algorithm; presentation; word problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Niemi:1984:UFE,
author = "V. Niemi",
title = "The undecidability of form equivalence for
context-free and {E0L} forms",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "3",
pages = "261--277",
month = aug,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.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 = "context-free forms; context-free grammars;
context-free languages; decidability; E0L forms;
equivalence classes; form equivalence; grammar forms; L
forms; language form; undecidability",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Avenhaus:1984:CIC,
author = "J. Avenhaus and K. Madlener",
title = "On the complexity of intersection and conjugacy
problems in free groups",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "3",
pages = "279--295",
month = aug,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C4210 (Formal logic); C4240
(Programming and algorithm theory)",
corpsource = "Fachbereich Informatik, Kaiserslautern Univ., West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; conjugacy problems; decision
problems; free groups; generalised word problem; group
theory; Howson property; intersection problems;
log-space reducibility; Moldavanskii's conjugacy
problem; Nielsen reduced generator set; Nielsen type
arguments; normal hull; P-completeness; polynomial
time",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ketonen:1984:DFP,
author = "J. Ketonen and R. Weyhrauch",
title = "A decidable fragment of predicate calculus (theorem
proving)",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "3",
pages = "297--307",
month = aug,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C4210 (Formal
logic)",
corpsource = "Dept. of Computer Sci., Stanford Univ., CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "calculus; decidability; decidable fragment; decision
procedure; direct predicate calculus; formal logic;
Gentzen sequent calculus; obvious inferences;
tautologous inferences; theorem proving",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{deBruijn:1984:SMD,
author = "N. G. {de Bruijn}",
title = "Some machines defined by directed graphs",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "3",
pages = "309--319",
month = aug,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4220 (Automata
theory)",
corpsource = "Dept. of Math. and Computing, Eindhoven Univ. of
Technol., Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; description levels; directed graphs;
real-number-processing machines; sorting; sorting
machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Miyano:1984:AFA,
author = "S. Miyano and T. Hayashi",
title = "Alternating finite automata on omega-words",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "3",
pages = "321--330",
month = aug,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Math., Kyushu Univ., Fukuoka, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "acceptance conditions; alternating finite automata;
finite automata; formal languages; infinite symbol
sequences; nondeterministic finite automata; omega
-languages; omega-words; power",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Staiger:1984:PLO,
author = "L. Staiger",
title = "Projection lemmas for omega-languages",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "3",
pages = "331--337",
month = aug,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Zentralinst. fur Kybernetik und Informationsprozesse,
Akad. der Wissenschaften, Berlin, East Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; deterministic automata; formal
languages; infinite behaviour; omega-languages;
projection lemmata; unboundedly branching
nondeterministic infinite automata",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Jacob:1984:FPS,
author = "G. Jacob and C. Reutenauer",
title = "On formal power series defined by infinite linear
systems",
journal = j-THEOR-COMP-SCI,
volume = "32",
number = "3",
pages = "339--340",
month = aug,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Lille Univ., Villeneuve d'Ascq, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; formal languages; formal power
series; infinite linear systems; Kuich; noncommuting
variables; series (mathematics); Urbanek",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Anonymous:1984:SCF,
author = "Anonymous",
title = "{Second Conference on Foundations of Software
Technology and Theoretical Computer Science}",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "1",
pages = "??--??",
month = sep,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4200 (Computer theory)",
conflocation = "Bangalore, India; 13-15 Dec. 1982",
conftitle = "Second Conference on Foundations of Software
Technology and Theoretical Computer Science",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "CCS; computation theory; computer software; controlled
deterministic table 0L array systems; deductive
structure; fair termination; homomorphic images;
infinite arrays; join dependencies; label expressions;
parametric channels; search game; secondary attribute
retrieval; sentential form languages; tree data
structures; trilinear aggregating techniques",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Siromoney:1984:IAC,
author = "R. Siromoney and K. G. Subramanian and V. R. Dare",
title = "Infinite arrays and controlled deterministic table
{0L} array systems",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "1",
pages = "3--11",
month = sep,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
conflocation = "Bangalore, India; 13-15 Dec. 1982",
conftitle = "Second Conference on Foundations of Software
Technology and Theoretical Computer Science",
corpsource = "Dept. of math., Madras Christian Coll., India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "adherence equivalence problem; context-free grammars;
controlled deterministic table 0L array systems;
deterministic automata; infinite arrays; limit language
equivalence problem; lowermost edge; model; rectangular
array; rightmost edge",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Jantzen:1984:HIS,
author = "M. Jantzen and M. Kudlek",
title = "Homomorphic images of sentential form languages
defined by {semi-Thue} systems",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "1",
pages = "13--43",
month = sep,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
conflocation = "Bangalore, India; 13-15 Dec. 1982",
conftitle = "Second Conference on Foundations of Software
Technology and Theoretical Computer Science",
corpsource = "Fachbereich Inf., Hamburg Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arbitrary homomorphisms; codings; erasing productions;
formal languages; homomorphic images; nonerasing
homomorphisms; semiThue systems; sentential form
languages; weak codings",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Astesiano:1984:PCL,
author = "E. Astesiano and E. Zucca",
title = "Parametric channels via label expressions in {CCS}",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "1",
pages = "45--63",
month = sep,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
conflocation = "Bangalore, India; 13-15 Dec. 1982",
conftitle = "Second Conference on Foundations of Software
Technology and Theoretical Computer Science",
corpsource = "Istituto di Matematica, Genova Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "calculus of communicating systems; concurrent
languages; formal languages; label expressions;
parametric channels; via translation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Apt:1984:FTR,
author = "K. R. Apt and A. Pnueli and J. Stavi",
title = "Fair termination revisited-with delay",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "1",
pages = "65--84",
month = sep,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
conflocation = "Bangalore, India; 13-15 Dec. 1982",
conftitle = "Second Conference on Foundations of Software
Technology and Theoretical Computer Science",
corpsource = "LITP, Paris Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "auxiliary delay variables; concurrent programs; fair
termination; nondeterministic programs; programming
theory; total correctness",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ravikumar:1984:CKP,
author = "B. Ravikumar and K. B. Lakshmanan",
title = "Coping with known patterns of lies in a search game",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "1",
pages = "85--94",
month = sep,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0240E (Game theory); C1140E (Game theory)",
conflocation = "Bangalore, India; 13-15 Dec. 1982",
conftitle = "Second Conference on Foundations of Software
Technology and Theoretical Computer Science",
corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of
Technol., Madras, India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "average-case analysis; game theory; known patterns;
lies; real number; search game; worst-case size",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Dybjer:1984:SRD,
author = "P. Dybjer",
title = "Some results on the deductive structure of join
dependencies",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "1",
pages = "95--105",
month = sep,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4250 (Database theory)",
conflocation = "Bangalore, India; 13-15 Dec. 1982",
conftitle = "Second Conference on Foundations of Software
Technology and Theoretical Computer Science",
corpsource = "Dept. of Comput. Sci., G{\"o}teborg Univ., Sweden",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "data dependencies; database theory; deductive
structure; inference rules; join dependencies; relation
schemes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Madhavan:1984:SAR,
author = "C. E. Veni Madhavan",
title = "Secondary attribute retrieval using tree data
structures",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "1",
pages = "107--116",
month = sep,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4250 (Database theory); C6120 (File organisation)",
conflocation = "Bangalore, India; 13-15 Dec. 1982",
conftitle = "Second Conference on Foundations of Software
Technology and Theoretical Computer Science",
corpsource = "Sch. of Autom., Indian Inst. of Sci., Bangalore,
India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "data structures; database theory; doubly linked lists;
external file organisation; inverted lists; K-d tree;
linear structures; multilists; multiple attribute tree;
node searches; secondary attribute retrieval; tree data
structures; trees (mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Pan:1984:TTA,
author = "V. Ya. Pan",
title = "The techniques of trilinear aggregating and the recent
progress in the asymptotic acceleration of matrix
operations",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "1",
pages = "117--138",
month = sep,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240 (Programming and
algorithm theory)",
conflocation = "Bangalore, India; 13-15 Dec. 1982",
conftitle = "Second 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 = "asymptotic acceleration; computational complexity;
direct sum conjecture; matrix algebra; matrix
multiplication; matrix operations; trilinear
aggregating",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Broy:1984:SSM,
author = "M. Broy and M. Wirsing and C. Pair",
title = "A systematic study of models of abstract data types",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "2-3",
pages = "139--174",
month = oct,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Passau Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complete lattice; congruence relations; data
structures; deterministic stream processing language;
formal languages; grammars; hierarchical abstract data
types; partial heterogeneous algebras; programming
languages; programming theory; semantic models; term
algebra; term-generated models",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kaplan:1984:CRR,
author = "S. Kaplan",
title = "Conditional rewrite rules",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "2-3",
pages = "175--193",
month = oct,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Paris-Sud Univ., Orsay, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebraic theory; canonical systems; conditional
equations; conditional term rewriting systems; formal
languages; general conditional rules; grammars;
intractability; iterative constructs; normal form
function; one-step rewriting; simulation; theorem
proving",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Fehr:1984:EPT,
author = "E. Fehr",
title = "Expressive power of typed and type-free programming
languages",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "2-3",
pages = "195--238",
month = oct,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory); C6140D (High level languages)",
corpsource = "Lehrstuhl fur Informatik II, RWTH Aachen, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "control structures; data structures; definable initial
models; expressive power; formal languages; high level
languages; programming theory; recursively enumerable
Sigma -trees; semantic domains; type-free lambda
-schemes; type-free programming languages; typed lambda
-schemes; typed programming languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Maon:1984:TSC,
author = "Y. Maon and A. Yehudai",
title = "On test sets for checking morphism equivalence on
languages with fair distribution of letters",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "2-3",
pages = "239--240",
month = oct,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.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 = "D0L language; equivalence classes; fair distribution
of letters; finite subset; formal languages; morphism
equivalence; set theory; test sets; testing",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Otto:1984:SUR,
author = "F. Otto",
title = "Some undecidability results for non-monadic
{Church--Rosser Thue} systems",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "2-3",
pages = "261--278",
month = oct,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Fachbereich Inf., Kaiserslautern Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational power; decidability; degrees of
complexity; finite automata; finite Church--Rosser Thue
systems; finite monadic Church--Rosser Thue systems;
formal languages; linear sentences; nonmonadic
Church--Rosser Thue systems; recursive functions;
undecidability results",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Soundararajan:1984:DSC,
author = "N. Soundararajan",
title = "Denotational semantics of {CSP}",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "2-3",
pages = "279--304",
month = oct,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Comput. and Inf. Sci., Ohio State Univ., Columbus, OH,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract denotations; communicating sequential
processes; CSP; denotational semantics; formal
languages; grammars; simple domains",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Huynh:1984:DIC,
author = "D. T. Huynh",
title = "Deciding the inequivalence of context-free grammars
with $1$- letter terminal alphabet is
${\Sigma}_2^p$-complete",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "2-3",
pages = "305--326",
month = oct,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Fachbereich Inf., Saarlandes Univ., Saarbrucken, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "1-letter terminal alphabet; computational complexity;
context-free grammars; decision problems; decision
theory; equivalence; equivalence classes; inequivalence
problem; log-space reduction; membership problem;
Sigma/sub 2//sup p/-completeness",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Harju:1984:EBA,
author = "T. Harju and M. Linna",
title = "The equations $ h(w) = w^n $ in binary alphabets",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "2-3",
pages = "327--329",
month = oct,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C4210 (Formal logic)",
corpsource = "Dept. of Math., Turku Univ., Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "binary alphabet; endomorphism; equations; finitely
generated word semigroup; formal languages; group
theory; morphisms; power; primitive root",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Perrin:1984:ORM,
author = "D. Perrin and P. Schupp",
title = "On the one-relator monoids which are groups",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "2-3",
pages = "331--334",
month = oct,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C4210 (Formal logic)",
corpsource = "Paris VII Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "finitely generated group; group theory; one relator
monoid presentation; one-relation presentation;
positive relation",
language = "French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Girault-Beauquier:1984:BRL,
author = "D. Girault-Beauquier",
title = "Bilimits of recognisable languages",
journal = j-THEOR-COMP-SCI,
volume = "33",
number = "2-3",
pages = "335--342",
month = oct,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.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 = "bilimits; finitary rational languages; finite
automata; formal languages; infinitary deterministic
rational language; limit; two-sided infinite words",
language = "French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Nesetril:1984:SNR,
author = "J. Nesetril",
title = "Some nonstandard {Ramsey} like applications",
journal = j-THEOR-COMP-SCI,
volume = "34",
number = "1--2",
pages = "3--15",
month = nov,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "KKIOV MFF UK, Charles Univ., Praha, Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "combinatorial mathematics; combinatorial principle;
nonstandard Ramsey like applications; Ramsey theorem",
pubcountry = "Netherlands",
treatment = "B Bibliography; T Theoretical or Mathematical",
}
@Article{Hartmanis:1984:CTN,
author = "J. Hartmanis and Y. Yesha",
title = "Computation times of {NP} sets of different
densities",
journal = j-THEOR-COMP-SCI,
volume = "34",
number = "1--2",
pages = "17--32",
month = nov,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
intelligence); C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "axiomatized mathematical systems; collapse;
computational complexity; CoNP; density; deterministic
computation time; NP sets; P; polynomial time Turing
reductions; proof presentation; PSPACE; set theory;
theorem proving; time-bounded complexity classes",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Winskel:1984:ST,
author = "G. Winskel",
title = "Synchronization trees",
journal = j-THEOR-COMP-SCI,
volume = "34",
number = "1--2",
pages = "33--82",
month = nov,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240 (Programming and algorithm theory)",
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 = "algebra; categorical constructions; categories;
concurrency; congruence; constructions with recursion;
continuous constructions; denotational semantics;
formal languages; isomorphism; labelled arcs; morphism
of trees; natural complete partial order structure;
nonrecursive terms; operational semantics; parallel
processing; parallel programming languages; proof
system; synchronisation; synchronization algebra;
synchronization trees; transition systems; trees
(mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{deNicola:1984:TEP,
author = "R. {de Nicola} and M. C. B. Hennessy",
title = "Testing equivalences for processes (concurrent
programming)",
journal = j-THEOR-COMP-SCI,
volume = "34",
number = "1--2",
pages = "83--133",
month = nov,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); 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 = "abstract models; CCS; computational processes;
concurrency; concurrent programming; equivalence
classes; equivalence testing; formal languages;
parallel processing; parallel programming languages;
programming theory; proof systems; tree representation;
trees (mathematics)",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{deBakker:1984:LTB,
author = "J. W. {de Bakker} and J. A. Bergstra and J. W. Klop
and J.-J. C. Meyer",
title = "Linear time and branching time semantics for recursion
with merge (parallel programming languages)",
journal = j-THEOR-COMP-SCI,
volume = "34",
number = "1--2",
pages = "135--156",
month = nov,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Centre for Maths. and Comput.
Sci., Amsterdam, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alphabet; arbitrary interleaving; atomic actions;
branching time semantics; compactness; continuity;
finite alphabet; formal languages; grammars; linear
time semantics; nondeterministic choice; parallel
processing; parallel programming languages; programming
theory; recursion with merge; semantic domains;
sequential composition; trace theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Vitanyi:1984:SMS,
author = "P. M. B. Vitanyi",
title = "On the simulation of many storage heads by one",
journal = j-THEOR-COMP-SCI,
volume = "34",
number = "1--2",
pages = "157--168",
month = nov,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Centre for Math. and Comput. Sci., Amsterdam,
Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "many storage heads; multiple storage heads; multitape
Turing machines; oblivious one-tape Turing machines;
online operation; online simulation; pushdown store;
real-time simulation; real-time systems; simulation;
storage units; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Delest:1984:ALP,
author = "M.-P. Delest and G. Viennot",
title = "Algebraic languages and polyomino enumeration",
journal = j-THEOR-COMP-SCI,
volume = "34",
number = "1--2",
pages = "169--206",
month = nov,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. d'Inf., Bordeaux II Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebra; algebraic language theory; algebraic system;
bijection; combinatorial mathematics; combinatorial
objects; combinatorics; convex polyominoes; formal
languages; perimeter; polyomino enumeration; words",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lenstra:1984:FMI,
author = "A. K. Lenstra",
title = "Factoring multivariate integral polynomials",
journal = j-THEOR-COMP-SCI,
volume = "34",
number = "1--2",
pages = "207--213",
month = nov,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4140 (Linear algebra); C4240 (Programming and
algorithm theory)",
corpsource = "Centre for Maths. and Comput. Sci., Amsterdam,
Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; integral coefficients;
multivariate integral polynomials; polynomial
factorisation; polynomial-time algorithms;
polynomials",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Cohen:1984:SES,
author = "S. Cohen and D. Lehmann and A. Pnueli",
title = "Symmetric and economical solutions to the mutual
exclusion problem in a distributed system",
journal = j-THEOR-COMP-SCI,
volume = "34",
number = "1--2",
pages = "215--225",
month = nov,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C4250
(Database theory)",
corpsource = "Inst. of Maths. and Comput. Sci., Hebrew Univ.,
Jerusalem, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "clairvoyant schedules; database theory; distributed
processing; distributed system; evil scheduler;
malicious scheduler; multiprocessing systems; mutual
exclusion problem; probabilistic solutions; programming
theory; scheduling; storage management; symmetric
solutions; well informed schedule",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Sato:1984:ESP,
author = "T. Sato and H. Tamaki",
title = "Enumeration of success patterns in logic programs
({PROLOG})",
journal = j-THEOR-COMP-SCI,
volume = "34",
number = "1--2",
pages = "227--240",
month = nov,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6140D
(High level languages); C6150C (Compilers, interpreters
and other processors)",
corpsource = "Electrotech. Lab., Ibaraki, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract item set construction; backtrackings; clause
computation; clause-calling patterns; compiler;
determinacy; Horn clauses; interpreter; logic
programming; logic programs; memory; nondeterministic
programs; program compilers; program interpreters;
programming theory; PROLOG; PROLOG program analysis;
run-time instantiation patterns; success-pattern
enumeration; term abstraction; time; top goal",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Clerbout:1984:PCF,
author = "M. Clerbout and M. Latteux",
title = "Partial commutations and faithful rational
transductions",
journal = j-THEOR-COMP-SCI,
volume = "34",
number = "3",
pages = "241--254",
month = dec,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Lab. de Recherche en Inf. Fondamentale, Lille I Univ.,
CNRS, Villeneuve d'Ascq, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; BNP language family; faithful
rational transductions; formal languages; multireset
language family; partial commutation; quasirealtime
languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Itzhaik:1984:NFN,
author = "Y. Itzhaik and A. Yehudai",
title = "New families of non real time {DPDAs} and their
decidability results",
journal = j-THEOR-COMP-SCI,
volume = "34",
number = "3",
pages = "255--274",
month = dec,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata 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 = "containment; context-free languages; decidability;
deterministic automata; equivalence; equivalence
classes; linearity test; nonreal time deterministic
pushdown automata; online regularity indication;
polynomial-time algorithms; real time strictness;
regularity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kamimura:1984:TOD,
author = "T. Kamimura and A. Tang",
title = "Total objects of domains",
journal = j-THEOR-COMP-SCI,
volume = "34",
number = "3",
pages = "275--288",
month = dec,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Dept. of Comput. Sci., Kansas Univ., Lawrence, KS,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded-complete algebraic CPOs; bounded-complete CPO;
clopen sets; closed sets; compact T/sub 1/ spaces;
continuous spaces; distinct families; domains; formal
languages; lower topology; open sets; Scott topology;
set theory; space characterisation; topology; total
objects; total space",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Gogolla:1984:AOS,
author = "M. Gogolla and K. Drosten and U. Lipeck and H.-D.
Ehrich",
title = "Algebraic and operational semantics of specifications
allowing exceptions and errors",
journal = j-THEOR-COMP-SCI,
volume = "34",
number = "3",
pages = "289--313",
month = dec,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Fachbereich Inf. B, Tech. Univ. of Braunschweig, West
Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract data-type specification; algebraic semantics;
correctness criterion; data structures; error handling;
error introduction; error propagation; error recovery;
errors; exception handling; operational semantics;
programming theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Ito:1984:MPD,
author = "M. Ito and M. Iwasaki and K. Taniguchi and T. Kasami",
title = "Membership problems for data dependencies in
relational expressions",
journal = j-THEOR-COMP-SCI,
volume = "34",
number = "3",
pages = "315--335",
month = dec,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4250 (Database theory)",
corpsource = "Fac. of Eng. Sci., Osaka Univ., Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "cross product; data dependencies; database theory;
membership problem; projection; relational algebra;
relational databases; relational expressions;
restriction; selection; union; validity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Schoning:1984:SG,
author = "U. Schoning",
title = "On small generators",
journal = j-THEOR-COMP-SCI,
volume = "34",
number = "3",
pages = "337--341",
month = dec,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); 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 = "complexity classes; computational complexity; NP/poly
class; set theory; small generators",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bancilhon:1984:SCA,
author = "F. Bancilhon and P. Richard",
title = "A sound and complete axiomatization of embedded cross
dependencies",
journal = j-THEOR-COMP-SCI,
volume = "34",
number = "3",
pages = "343--350",
month = dec,
year = "1984",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4250 (Database
theory)",
corpsource = "Inst. Nat. de Recherche d'Inf. et d'Autom., Domaine de
Voluceau, Le Chesnay, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Armstrong relation; complete axiomatization; data
dependencies; database theory; dual structure; embedded
cross dependencies; nondecomposable sets; relational
databases; relational model; set theory; sound
axiomatisation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
