%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "1.15", %%% date = "08 February 2014", %%% time = "16:54:58 MST", %%% filename = "tcs1990.bib", %%% address = "University of Utah %%% Department of Mathematics, 110 LCB %%% 155 S 1400 E RM 233 %%% Salt Lake City, UT 84112-0090 %%% USA", %%% telephone = "+1 801 581 5254", %%% FAX = "+1 801 581 4148", %%% URL = "http://www.math.utah.edu/~beebe", %%% checksum = "05752 38221 155724 1713103", %%% email = "beebe at math.utah.edu, beebe at acm.org, %%% beebe at computer.org (Internet)", %%% codetable = "ISO/ASCII", %%% keywords = "BibTeX, bibliography, Theoretical Computer %%% Science", %%% license = "public domain", %%% supported = "yes", %%% docstring = "This is a bibliography of publications in %%% the journal Theoretical Computer Science %%% (CODEN TCSCDI, ISSN 0304-3975 (print), %%% 1879-2294 (electronic)), which began %%% publishing in 1975. %%% %%% This file covers the years 1990--1994; %%% companion files tcs19xx.bib each cover %%% other pentads. %%% %%% The journal has World-Wide Web home sites %%% at several locations: %%% %%% Title pages: %%% http://www.elsevier.nl/locate/issn/03043975 (Europe) %%% http://www.elsevier.com/locate/issn/03043975 (North America) %%% http://www.elsevier.co.jp/locate/issn/03043975 (Japan) %%% http://www.sciencedirect.com/science/journal/03043975 %%% %%% Tables of contents: %%% http://www.elsevier.nl/locate/tcs %%% http://www.elsevier.nl/locate/estoc/03043975 (Europe) %%% http://www.elsevier.com/locate/estoc/03043975 (North America) %%% http://www.elsevier.co.jp/locate/estoc/03043975 (Japan) %%% %%% Elsevier Science alert page: %%% http://www.elsevier.nl/mcs/tcs/Menu.html (Europe) %%% %%% The tables of contents sites begin coverage %%% with Volume 91, Number 1, 1992, and have full %%% text of articles from Volume 190, Number 1, %%% 1998. %%% %%% At version 1.15, the year coverage looked %%% like this: %%% %%% 1990 ( 147) 1994 ( 287) 1998 ( 1) %%% 1991 ( 251) 1995 ( 1) 1999 ( 0) %%% 1992 ( 255) 1996 ( 0) 2000 ( 1) %%% 1993 ( 259) 1997 ( 1) %%% %%% Article: 1203 %%% %%% Total entries: 1203 %%% %%% This bibliography was prepared by merging %%% data from the TeX Users Group bibliography %%% archive, the BibNet Project archive, the OCLC %%% Contents1st database, the Compendex database, %%% the IEEE INSPEC database, and the journal Web %%% pages. %%% %%% Numerous errors in the sources noted above %%% have been corrected. Spelling has been %%% verified with the UNIX spell and GNU ispell %%% programs using the exception dictionary %%% stored in the companion file with extension %%% .sok. %%% %%% BibTeX citation tags are uniformly chosen %%% as name:year:abbrev, where name is the %%% family name of the first author or editor, %%% year is a 4-digit number, and abbrev is a %%% 3-letter condensation of important title %%% words. Citation tags were automatically %%% generated by software developed for the %%% BibNet Project. %%% %%% In this bibliography, entries are sorted in %%% publication order within each journal, %%% using bibsort -byvolume. %%% %%% The checksum field above contains a CRC-16 %%% checksum as the first value, followed by the %%% equivalent of the standard UNIX wc (word %%% count) utility output of lines, words, and %%% characters. This is produced by Robert %%% Solovay's checksum utility.", %%% } %%% ====================================================================

@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" }

%%% ==================================================================== %%% Acknowledgement abbreviations:

@String{ack-nhfb= "Nelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1 801 581 4148, e-mail: \path|beebe@math.utah.edu|, \path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL: \path|http://www.math.utah.edu/~beebe/|"}

%%% ==================================================================== %%% Journal abbreviations:

@String{j-THEOR-COMP-SCI= "Theoretical Computer Science"}

%%% ==================================================================== %%% Bibliography entries, sorted in publication order:

@Article{Wagner:1990:APP, author = "E. G. Wagner", title = "Algebras, polynomials and programs", journal = j-THEOR-COMP-SCI, volume = "70", number = "1", pages = "3--34", day = "15", month = jan, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Math. Sci., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic applications; arbitrary algebras; computer science; elementary category theory; formal languages; iteration; Lawvere algebraic theories; polynomials; programming languages; programming theory; recursion; set theory; substitution; universal algebra", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bainbridge:1990:FP, author = "E. S. Bainbridge and P. J. Freyd and A. Scedrov and P. J. Scott", title = "Functorial polymorphism", journal = j-THEOR-COMP-SCI, volume = "70", number = "1", pages = "35--64", day = "15", month = jan, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math., Ottawa Univ., Ont., Canada", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "calculus of generalized natural transformations; computational linguistics; formal languages; parametricity; partial equivalence relations; PERs; polymorphic lambda calculus; polymorphism; Reynolds invariance condition; Reynolds parametricity condition; semantic analog; semantic approximations; universal type abstraction; universal types", pubcountry = "Netherlands", treatment = "B Bibliography; T Theoretical or Mathematical", } @Article{Barr:1990:FPC, author = "M. Barr", title = "Fixed points in {Cartesian} closed categories", journal = j-THEOR-COMP-SCI, volume = "70", number = "1", pages = "65--72", day = "15", month = jan, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Math. and Stat., McGill Univ., Montreal, Que., Canada", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "cartesian closed categories; domain theory; formal logic; internally omega-complete partial order; least fixed point; natural numbers object; omega-continuous endomorphism; semantic models; set theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bloom:1990:NGT, author = "S. L. Bloom", title = "A note on guarded theories", journal = j-THEOR-COMP-SCI, volume = "70", number = "1", pages = "73--83", day = "15", month = jan, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Stevens Inst. of Technol., Hoboken, NJ, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic theory; formal logic; guarded theories; guards; maximal families; partial correctness; set theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Mulry:1990:CFP, author = "P. S. Mulry", title = "Categorical fixed point semantics", journal = j-THEOR-COMP-SCI, volume = "70", number = "1", pages = "85--97", day = "15", month = jan, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Colgate Univ., Hamilton, NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "categorical fixed point results; computational linguistics; formal languages; natural numbers; semantic categories; set theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Nielson:1990:FCM, author = "H. R. Nielson and F. Nielson", title = "Functional completeness of the mixed $\lambda$-calculus and combinatory logic", journal = j-THEOR-COMP-SCI, volume = "70", number = "1", pages = "99--126", day = "15", month = jan, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Aarhus Univ., Denmark", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "binding times; combinator-based abstract machines; combinatory logic; compile-time; formal logic; functional languages; mixed lambda-calculus; run-time computations", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Pasztor:1990:RPD, author = "A. Pasztor", title = "Recursive programs and denotational semantics in absolute logics of programs", journal = j-THEOR-COMP-SCI, volume = "70", number = "1", pages = "127--150", day = "15", month = jan, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Sch. of Comput. Sci., Florida Int. Univ., Miami, FL, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "2-sorted first order logic; absolute; absolute logics of programs; absolute versions; complete inference system; denotational semantics; formal logic; logics; program verification; program verification methods; programming theory; recursive programs; semantics; set theoretic property; weak second order logic", pubcountry = "Netherlands", treatment = "B Bibliography; T Theoretical or Mathematical", } @Article{Bottinger:1990:STD, author = "C. Bottinger", title = "On {Scott}'s thesis for domains of information and well-quasi-orderings", journal = j-THEOR-COMP-SCI, volume = "70", number = "1", pages = "151--158", day = "15", month = jan, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Fachbereich 6-Math., Univ. GHS Essen, West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "canonical process; computational linguistics; CPOs; formal languages; sufficient condition; well-quasi-orderings", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Wells:1990:GCS, author = "C. Wells", title = "A generalization of the concept of sketch", journal = j-THEOR-COMP-SCI, volume = "70", number = "1", pages = "159--178", day = "15", month = jan, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6110B (Software engineering techniques)", corpsource = "Dept. of Math. and Stat., Case Western Reserve Univ., Cleveland, OH, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "cartesian closed category; categorial construction; data structures; entities; formal specification; function space objects; functional programming; functional programming languages; list objects; locos; power objects; reflexive objects; set theory; sketch; specification; topos", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Tiuryn:1990:FPF, author = "J. Tiuryn and D. B. Benson", title = "Fixed points in free process algebras. {II}", journal = j-THEOR-COMP-SCI, volume = "70", number = "2", pages = "179--192", day = "26", month = jan, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Washington State Univ., Pullman, WA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "delta-semilinear polynomials; free process algebras; left simple polynomials; polynomials; rewriting systems; right multipliers; sufficient conditions; tau-semilinear polynomials", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Longo:1990:CTC, author = "G. Longo and E. Moggi", title = "A category-theoretic characterization of functional completeness", journal = j-THEOR-COMP-SCI, volume = "70", number = "2", pages = "193--211", day = "26", month = jan, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract Godel-number; algebraic functions; application; cartesian closed categories; category-theoretic characterization; combinatory logic; formal languages; formal logic; functional completeness; group theory; lambda-calculus models; partial recursive functionals; principal morphisms; programming language; type-free language", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Senizergues:1990:CDC, author = "G. Senizergues", title = "A characterisation of deterministic context-free languages by means of right-congruences", journal = j-THEOR-COMP-SCI, volume = "70", number = "2", pages = "213--232", day = "26", month = jan, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "LITP, Paris, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "context-free languages; controlled rewriting systems; deterministic context-free languages; regular semi-Thue systems; rewriting system; rewriting systems; right-congruence; right-congruences", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Jung:1990:CCC, author = "A. Jung", title = "{Cartesian} closed categories of algebraic {CPOs}", journal = j-THEOR-COMP-SCI, volume = "70", number = "2", pages = "233--250", day = "26", month = jan, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Fachbereich Math., Tech. Hochschule Darmstadt, West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic CPOs; algebraic function space; complete lattice; continuous functions; countably based algebraic CPOs; formal logic; graph theory; L-domain; largest cartesian closed full subcategory; least element; natural extension; number theory; profinite domains", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Gambosi:1990:LPP, author = "G. Gambosi and J. Nesetril and M. Talamo", title = "On locally presented posets", journal = j-THEOR-COMP-SCI, volume = "70", number = "2", pages = "251--260", day = "26", month = jan, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Istituto di Analisi dei Sistemi ed Inf., CNR, Rome, Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Boolean dimension; computational complexity; dags; Dushnik-Miller dimension; graph theory; locally presented posets; planar dags; time complexity; transitive closure", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Terlutte:1990:CRT, author = "A. Terlutte", title = "Cyclic rational transductions and polynomials of rational functions", journal = j-THEOR-COMP-SCI, volume = "70", number = "2", pages = "261--271", day = "26", month = jan, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Univ. des Sci. et Tech. de Lille, Villeneuve D'Ascq, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "cyclic rational transductions; finite image; formal languages; polynomially bounded rational transductions; polynomials; rational functions; rational transductions", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Ehrenfeucht:1990:TSC, author = "A. Ehrenfeucht and G. Rozenberg", title = "Theory of $2$-structures. {I}. Clans, basic subclasses, and morphisms", journal = j-THEOR-COMP-SCI, volume = "70", number = "3", pages = "277--303", day = "15", month = feb, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "2-structures theory; basic subclasses; clans; graph; graph theory; morphisms; relational structure; sorts; trees; trees (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Ehrenfeucht:1990:TSI, author = "A. Ehrenfeucht and G. Rozenberg", title = "Theory of $2$-structures. {II.} Representation through labeled tree families", journal = j-THEOR-COMP-SCI, volume = "70", number = "3", pages = "305--342", day = "15", month = feb, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "2-structures theory; graph theory; hierarchical representations; inner node; labeled tree families; trees (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Ehrenfeucht:1990:PHS, author = "A. Ehrenfeucht and G. Rozenberg", title = "Primitivity is hereditary for $2$-structures", journal = j-THEOR-COMP-SCI, volume = "70", number = "3", pages = "343--358", day = "15", month = feb, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "2-structures; graph theory; hereditary; primitivity; trees (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Aggarwal:1990:CCP, author = "A. Aggarwal and A. K. Chandra and M. Snir", title = "Communication complexity of {PRAMs}", journal = j-THEOR-COMP-SCI, volume = "71", number = "1", pages = "3--28", day = "13", month = mar, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C5320G (Semiconductor storage)", 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 = "arithmetic; binary tree; communication complexity; computational complexity; computational requirements; local memory; LPRAM; random-access storage; semirings; trees (mathematics)", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Culik:1990:NTP, author = "K. {Culik, II}", title = "New techniques for proving the decidability of equivalence problems", journal = j-THEOR-COMP-SCI, volume = "71", number = "1", pages = "29--45", day = "13", month = mar, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., South Carolina Univ., Columbia, SC, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "D0L equivalence problem; decidability; Ehrenfeucht conjecture; languages; proving; relations", pubcountry = "Netherlands", treatment = "B Bibliography; T Theoretical or Mathematical", } @Article{Gruska:1990:SSP, author = "J. Gruska", title = "Synthesis, structure and power of systolic computations", journal = j-THEOR-COMP-SCI, volume = "71", number = "1", pages = "47--77", day = "13", month = mar, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C5220 (Computer architecture)", corpsource = "Inst. of Tech. Cybern., Slovak Acad. of Sci., Bratislava, Czechoslovakia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "linear array computations; models; parallel architectures; power; simulations; structure; synthesis; systolic architectures; systolic computations; transformations; tree", pubcountry = "Netherlands", treatment = "B Bibliography; P Practical; T Theoretical or Mathematical", } @Article{Hartmanis:1990:NDS, author = "J. Hartmanis", title = "New developments in structural complexity theory", journal = j-THEOR-COMP-SCI, volume = "71", number = "1", pages = "79--93", day = "13", month = mar, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "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 = "computational complexity; structural complexity theory; working hypotheses", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Kruskal:1990:CTE, author = "C. P. Kruskal and L. Rudolph and M. Snir", title = "A complexity theory of efficient parallel algorithms", journal = j-THEOR-COMP-SCI, volume = "71", number = "1", pages = "95--132", day = "13", month = mar, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Inst. for Adv. Comput. Studies, Maryland Univ., College Park, MD, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexity theory; computational complexity; EP; parallel algorithms; parallel computation; robustness; running time; simulating machine", pubcountry = "Netherlands", treatment = "B Bibliography; T Theoretical or Mathematical", } @Article{Thiagarajan:1990:SBA, author = "P. S. Thiagarajan", title = "Some behavioural aspects of net theory", journal = j-THEOR-COMP-SCI, volume = "71", number = "1", pages = "133--153", day = "13", month = mar, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Inst. of Math. Sci., Madras, India", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "behavioural aspects; behavioural descriptions; causality; concurrency; conflict; distributed systems; elementary net systems; net theory; Petri nets; system model", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Weijland:1990:SLP, author = "W. P. Weijland", title = "Semantics for logic programs without occur check", journal = j-THEOR-COMP-SCI, volume = "71", number = "1", pages = "155--174", day = "13", month = mar, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140D (High level languages)", corpsource = "Centre for Math. and Comput. Sci., Amsterdam, Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "completeness; CSLD-resolution; logic programming; logic programs; PROLOG; Prolog; semantics; SLD-resolution; soundness", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Anonymous:1990:IFS, author = "Anonymous", title = "{INFORMATIKA 88. 2nd French-Soviet Workshop on Methods of Compilation and Program Construction}", journal = j-THEOR-COMP-SCI, volume = "71", number = "2", pages = "??--??", day = "30", month = mar, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", conflocation = "Nice, France; 23-25 Feb. 1988", conftitle = "INFORMATIKA 88. 2nd French-Soviet Workshop on Methods of Compilation and Program Construction", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithm; alternative structure compilation; attribute models; automatic program synthesis; compilation; computational; constructive system; cut; denotational semantics; formal languages; functional equivalence; mixed computation; operational; plasma pattern; program compilers; program schemes; Prolog", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Arcangeli:1990:PPP, author = "J.-P. Arcangeli and C. Pomian", title = "Principles of plasma pattern and alternative structure compilation", journal = j-THEOR-COMP-SCI, volume = "71", number = "2", pages = "177--191", day = "30", month = mar, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C6150C (Compilers, interpreters and other processors)", conflocation = "Nice, France; 23-25 Feb. 1988", conftitle = "INFORMATIKA 88. 2nd French-Soviet Workshop on Methods of Compilation and Program Construction", corpsource = "Lab. Langages et Syst. Inf., Univ. Paul Sabatier, Toulouse, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "alternative structure compilation; backtracking; formal model; message parsing; pattern codes; pattern matching; plasma pattern; program compilers; simple jumps; single pass compiler; syntax", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Billaud:1990:SOD, author = "M. Billaud", title = "Simple operational and denotational semantics for {Prolog} with cut", journal = j-THEOR-COMP-SCI, volume = "71", number = "2", pages = "193--208", day = "30", month = mar, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", conflocation = "Nice, France; 23-25 Feb. 1988", conftitle = "INFORMATIKA 88. 2nd French-Soviet Workshop on Methods of Compilation and Program Construction", corpsource = "Dept. Inf., Bordeaux I Univ., Talence, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "behaviour; control structures; cut operator; denotational semantics; equivalence rules; if-then-else operator; logic programming; operational semantics; program interpreters; PROLOG; Prolog dialects; Prolog programs; reference interpreter; rewriting system; stream-generating functions", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Bulyonkov:1990:MCC, author = "M. A. Bulyonkov", title = "Mixed computation and compilation: new approaches to old problems", journal = j-THEOR-COMP-SCI, volume = "71", number = "2", pages = "209--226", day = "30", month = mar, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C6150C (Compilers, interpreters and other processors)", conflocation = "Nice, France; 23-25 Feb. 1988", conftitle = "INFORMATIKA 88. 2nd French-Soviet Workshop on Methods of Compilation and Program Construction", corpsource = "Comput. Center, Acad. of Sci., Novosibirsk, Ukrainian SSR, USSR", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract interpretation; compilation; incremental computation; metaprogramming; mixed computation; partial evaluator; polyvariancy; program compilers; program manipulations; sequential decomposition; survey; user control", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Galmiche:1990:CSA, author = "D. Galmiche", title = "Constructive system for automatic program synthesis", journal = j-THEOR-COMP-SCI, volume = "71", number = "2", pages = "227--239", day = "30", month = mar, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", conflocation = "Nice, France; 23-25 Feb. 1988", conftitle = "INFORMATIKA 88. 2nd French-Soviet Workshop on Methods of Compilation and Program Construction", corpsource = "Centre de Recherche en Inf. de Nancy, Vandoeuvre les Nancy, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automatic program synthesis; automatized program synthesis; constants; constructive system; grammars; higher-order calculus; intuitionistic type theory; lambda-expressions; logical theory; program compilers; programmation; programming proofs; typed lambda-calculus; types", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Penjam:1990:CAM, author = "J. Penjam", title = "Computational and attribute models of formal languages", journal = j-THEOR-COMP-SCI, volume = "71", number = "2", pages = "241--264", day = "30", month = mar, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", conflocation = "Nice, France; 23-25 Feb. 1988", conftitle = "INFORMATIKA 88. 2nd French-Soviet Workshop on Methods of Compilation and Program Construction", corpsource = "Inst. of Cybern., Estonian Acad. of Sci., Tallinn, Estonian SSR, USSR", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithms; attribute evaluation programs; attribute grammars; attribute models; compiler specification; computational models; formal languages; NUT-system; program specification; programming languages; semantically equivalent computational models; semantics; structural synthesis", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Sabelfeld:1990:ADF, author = "V. K. Sabelfeld", title = "An algorithm deciding functional equivalence in a new class of program schemes", journal = j-THEOR-COMP-SCI, volume = "71", number = "2", pages = "265--279", day = "30", month = mar, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", conflocation = "Nice, France; 23-25 Feb. 1988", conftitle = "INFORMATIKA 88. 2nd French-Soviet Workshop on Methods of Compilation and Program Construction", corpsource = "Comput. Center, Acad. of Sci., Novosibirsk, USSR", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithm; automata theory; decidability; equivalence classes; formal languages; free interpretation; functional equivalence; predicate; program optimization; program schemes; program verification; through schemes; undecidable problem", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Senizergues:1990:SDP, author = "G. Senizergues", title = "Some decision problems about controlled rewriting systems", journal = j-THEOR-COMP-SCI, volume = "71", number = "3", pages = "281--346", day = "10", month = apr, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Lab. of Comput. Sci., Bordeaux I Univ., Talence, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "c-systems; class equivalence problem; class inclusion problem; confluence problem; controlled rewriting systems; decidability; decidable; decision problems; deterministic context-free languages; equivalence classes; equivalence problem; finite semi-Thue systems; finitely generated congruences; partial confluence problem; recursively equivalent; refinement problem; rewriting systems; syntactic congruence; undecidable; word problem", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Ehrig:1990:CDT, author = "H. Ehrig and F. Parisi-Presicce and P. Boehm and C. Rieckhoff and C. Dimitrovici and M. Grosse-Rhode", title = "Combining data type and recursive process specifications using projection algebras", journal = j-THEOR-COMP-SCI, volume = "71", number = "3", pages = "347--380", day = "10", month = apr, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra)", corpsource = "Tech. Univ. Berlin, Inst. fur Software und Theor. Inf., West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebra; algebraic semantics; algebraic specification; complete process algebras; data type process specifications; metric approach; nonterminating processes; projection algebras; projection spaces; recursive process specifications; recursively defined processes", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Dulucq:1990:FSS, author = "S. Dulucq and D. Gouyou-Beauchamps", title = "On the factors of the {Sturmian} sequences", journal = j-THEOR-COMP-SCI, volume = "71", number = "3", pages = "381--400", day = "10", month = apr, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1120 (Analysis); C4150 (Nonlinear and functional equations); C4210 (Formal logic)", corpsource = "UER Math. et Inf., Bordeaux I Univ., Talence, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "alphabet; Euler function; formal languages; functional equation; functional equations; generating function; language; line; slope; Sturmian sequences; word", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Gibbons:1990:OEC, author = "A. Gibbons and W. Rytter", title = "Optimally edge-colouring outerplanar graphs is in {NC}", journal = j-THEOR-COMP-SCI, volume = "71", number = "3", pages = "401--411", day = "10", month = apr, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Warwick Univ., Coventry, UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; graph colouring; optimal edge colouring; outerplanar graphs; P-RAM; parallel random access machine; polylogarithmic time; write conflicts", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Manes:1990:TCI, author = "E. G. Manes", title = "A transformational characterization of if-then-else", journal = j-THEOR-COMP-SCI, volume = "71", number = "3", pages = "413--417", day = "10", month = apr, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. and Stat., Massachusetts Univ., Amherst, MA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "if-then-else; partial functions; programming theory; sets; transformational characterization", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Chrobak:1990:DSU, author = "M. Chrobak and T. Szymacha and A. Krawczyk", title = "A data structure useful for finding {Hamiltonian} cycles", journal = j-THEOR-COMP-SCI, volume = "71", number = "3", pages = "419--424", day = "10", month = apr, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithm; balanced trees; complexity; computational complexity; data structure; data structures; Hamiltonian cycles; reversals; reversible AVL-tree; sequence maintenance; trees (mathematics)", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Skandalis:1990:NOR, author = "K. Skandalis", title = "Nonrecursiveness of the operations on real numbers", journal = j-THEOR-COMP-SCI, volume = "71", number = "3", pages = "425--429", day = "10", month = apr, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Dept. of Math., Crete Univ., Greece", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "nonrecursiveness; number theory; real numbers", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Sakarovitch:1990:F, author = "J. Sakarovitch", title = "Foreword", journal = j-THEOR-COMP-SCI, volume = "72", number = "1", pages = "1--??", day = "25", month = apr, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Fri Nov 21 19:16:33 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", } @Article{Budach:1990:TIC, author = "L. Budach", title = "Topological invariants of classification problems", journal = j-THEOR-COMP-SCI, volume = "72", number = "1", pages = "3--26", day = "25", month = apr, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory); C4250 (Database theory)", corpsource = "Humboldt-Univ., Sektion Math., Berlin, East Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Betti numbers; classification problems; complexity; computational complexity; database theory; Euler-Poincare characteristic; formal logic; invariant structures; questionnaires; set theory; topological invariants", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hashiguchi:1990:ILT, author = "K. Hashiguchi", title = "Improved limitedness theorems on finite automata with distance functions", journal = j-THEOR-COMP-SCI, volume = "72", number = "1", pages = "27--38", day = "25", month = apr, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Inf. and Comput. Sci., Toyohashi Univ. of Technol., Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "distance functions; finite automata; limitedness theorems; sufficient condition; words", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", xxtitle = "Improved limitedness theorems of finite automata with distance functions", } @Article{Carpi:1990:NRW, author = "A. Carpi and A. {de Luca}", title = "Non-repetitive words relative to a rewriting system", journal = j-THEOR-COMP-SCI, volume = "72", number = "1", pages = "39--53", day = "25", month = apr, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dipartimento di Matematica ed Applicazioni, Napoli Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "context-free languages; context-free systems; decidability; decision problems; nonrepetitive words; rewriting system; rewriting systems; semi-commutations; square-free word; symmetric rewriting systems", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Restivo:1990:CLC, author = "A. Restivo", title = "Codes and local constraints", journal = j-THEOR-COMP-SCI, volume = "72", number = "1", pages = "55--64", day = "25", month = apr, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes); C4210 (Formal logic); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Matematica e Applicazioni, Palermo Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata; automata theory; codes; completeness; encoding; engineering applications; extremal properties; forbidden words; formal languages; languages; local constraints; maximality", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Simon:1990:FFF, author = "I. Simon", title = "Factorization forests of finite height", journal = j-THEOR-COMP-SCI, volume = "72", number = "1", pages = "65--94", day = "25", month = apr, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Instituto de Matematica e Estatistica, Sao Paulo Univ., Brazil", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bounded gap Ramsey-type property; factorization forests; finite height; finite semigroup; formal languages; free semigroup; group theory; morphism; Ramseyan factorization forest; vertex set", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Anonymous:1990:CCA, author = "Anonymous", title = "{CAAP} '88 --- 13th Colloque sur les Arbres en Alg{\`e}bre et en Programmation. ({French}) [{Colloquium} on Trees in Algebra and Programming]", journal = j-THEOR-COMP-SCI, volume = "72", number = "2-3", pages = "??--??", day = "23", month = may, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", conflocation = "Nancy, France; 21-25 March 1988", conftitle = "CAAP '88 --- 13th Colloque sur les Arbres en Algebre et en Programmation (Colloquium on Trees in Algebra and Programming)", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "A/sup 2/CCS; algebra; algorithm theory; atomic actions for CCS; AVL trees; combinatory differential fields; complexity; Dactl; data structures; directed hypergraphs; dynamic algorithms; equational completion; formal logic; functional languages; Hennessy--Milner Logic; logic programming; narrowing strategies; order-sorted algebras; parallelism; path length; proof systems; recursion; rewrite based algebraic specifications; rewriting systems; satisfiability; specification languages; term rewrite languages; trees (mathematics)", language = "French", pubcountry = "Netherlands", sponsororg = "AFCET; BCS; GI", treatment = "T Theoretical or Mathematical", } @Article{Dauchet:1990:E, author = "M. Dauchet and J. L. Remy", title = "Editorial", journal = j-THEOR-COMP-SCI, volume = "72", number = "2-3", pages = "95--??", day = "23", month = may, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Fri Nov 21 19:16:33 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", } @Article{Ausiello:1990:DMD, author = "G. Ausiello and U. Nanni and G. F. Italiano", title = "Dynamic maintenance of directed hypergraphs", journal = j-THEOR-COMP-SCI, volume = "72", number = "2-3", pages = "97--117", day = "23", month = may, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C4250 (Database theory); C6120 (File organisation)", conflocation = "Nancy, France; 21-25 March 1988", conftitle = "CAAP '88 --- 13th Colloque sur les Arbres en Algebre et en Programmation (Colloquium on Trees in Algebra and Programming)", corpsource = "Dipartimento di Inf. e Sistemistica, Rome Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computation theory; data structure; data structures; directed graphs; directed hypergraphs; hyperarcs", pubcountry = "Netherlands", sponsororg = "AFCET; BCS; GI", treatment = "T Theoretical or Mathematical", } @Article{Engeler:1990:CDF, author = "E. Engeler", title = "Combinatory differential fields", journal = j-THEOR-COMP-SCI, volume = "72", number = "2-3", pages = "119--131", day = "23", month = may, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra)", conflocation = "Nancy, France; 21-25 March 1988", conftitle = "CAAP '88 --- 13th Colloque sur les Arbres en Algebre et en Programmation (Colloquium on Trees in Algebra and Programming)", corpsource = "Eidgenossische Tech. Hochschule-Zentrum, Zurich, Switzerland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebra; closed-form solvability; combinatory equations; combinatory field; differential fields; Liouville-Ritt-Risch theory; problem solving", pubcountry = "Netherlands", sponsororg = "AFCET; BCS; GI", treatment = "T Theoretical or Mathematical", } @Article{Echahed:1990:CNS, author = "R. Echahed", title = "On completeness of narrowing strategies", journal = j-THEOR-COMP-SCI, volume = "72", number = "2-3", pages = "133--146", day = "23", month = may, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", conflocation = "Nancy, France; 21-25 March 1988", conftitle = "CAAP '88 --- 13th Colloque sur les Arbres en Algebre et en Programmation (Colloquium on Trees in Algebra and Programming)", corpsource = "LIFIA/IMAG, Inst. Nat. Polytech., Grenoble, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic specifications; completeness; E-unification; E-unifiers; formal specification; functional languages; functional programming; high level languages; LPG; many sorted algebras; narrowing occurrence selection strategy; narrowing strategies; reduction relations; relational languages; rewriting systems; specification languages; syntactical criteria; term rewriting systems; unification", pubcountry = "Netherlands", sponsororg = "AFCET; BCS; GI", treatment = "T Theoretical or Mathematical", } @Article{Francon:1990:ADA, author = "J. Francon and B. Randrianarimanana and R. Schott", title = "Analysis of dynamic algorithms in {Knuth}'s model", journal = j-THEOR-COMP-SCI, volume = "72", number = "2-3", pages = "147--167", day = "23", month = may, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", conflocation = "Nancy, France; 21-25 March 1988", conftitle = "CAAP '88 --- 13th Colloque sur les Arbres en Algebre et en Programmation (Colloquium on Trees in Algebra and Programming)", corpsource = "Dept. Inf., Univ. Louis Pasteur, Strasbourg, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithm theory; continued fractions; data structures; deletions; dictionaries; dynamic algorithms; dynamically varying data structures; insertions; integrated costs; limiting distributions; linear lists; negative query; orthogonal polynomials; priority queues; statistical analysis; statistical model", pubcountry = "Netherlands", sponsororg = "AFCET; BCS; GI", treatment = "T Theoretical or Mathematical", } @Article{Gnaedig:1990:ECO, author = "I. Gnaedig and C. Kirchner and H. Kirchner", title = "Equational completion in order-sorted algebras", journal = j-THEOR-COMP-SCI, volume = "72", number = "2-3", pages = "169--202", day = "23", month = may, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", conflocation = "Nancy, France; 21-25 March 1988", conftitle = "CAAP '88 --- 13th Colloque sur les Arbres en Algebre et en Programmation (Colloquium on Trees in Algebra and Programming)", corpsource = "LORIA, Vandoeuvre-les-Nancy, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebra; completion procedures; equational term rewriting systems; formal logic; logic programming; order-sorted algebras; order-sorted equational logic; proof orderings; rewriting systems", pubcountry = "Netherlands", sponsororg = "AFCET; BCS; GI", treatment = "T Theoretical or Mathematical", } @Article{Gorrieri:1990:AA, author = "R. Gorrieri and S. Marchetti and U. Montanari", title = "{$A^2 CCS$}: atomic actions for {$CCS$}", journal = j-THEOR-COMP-SCI, volume = "72", number = "2-3", pages = "203--223", day = "23", month = may, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", conflocation = "Nancy, France; 21-25 March 1988", conftitle = "CAAP '88 --- 13th Colloque sur les Arbres en Algebre et en Programmation (Colloquium on Trees in Algebra and Programming)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "A/sup 2/CCS; atomic actions; calculus for Communicating Systems; CCS; compositional transition systems; formal languages; prefix operation; specification languages; underlined action symbol", pubcountry = "Netherlands", sponsororg = "AFCET; BCS; GI", treatment = "T Theoretical or Mathematical", } @Article{Kennaway:1990:ITR, author = "R. Kennaway", title = "Implementing term rewrite languages in {Dactl}", journal = j-THEOR-COMP-SCI, volume = "72", number = "2-3", pages = "225--249", day = "23", month = may, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sun Oct 25 13:16:00 1998", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", conflocation = "Nancy, France; 21-25 March 1988", conftitle = "CAAP '88 --- 13th Colloque sur les Arbres en Algebre et en Programmation (Colloquium on Trees in Algebra and Programming)", corpsource = "Sch. of Inf. Syst., East Anglia Univ., Norwich, UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Dactl; evaluation strategy; functional language; functional programming; graph rewriting; low-level language; parallel machines; rewriting systems", pubcountry = "Netherlands", sponsororg = "AFCET; BCS; GI", treatment = "T Theoretical or Mathematical", } @Article{Klein:1990:TUB, author = "R. Klein and D. Wood", title = "A tight upper bound for the path length of {AVL} trees", journal = j-THEOR-COMP-SCI, volume = "72", number = "2-3", pages = "251--264", day = "23", month = may, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", conflocation = "Nancy, France; 21-25 March 1988", conftitle = "CAAP '88 --- 13th Colloque sur les Arbres en Algebre et en Programmation (Colloquium on Trees in Algebra and Programming)", corpsource = "Inst. f{\"u}r Inf., Freiburg Univ., West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "AVL trees; brother trees; comparison cost; computational complexity; path length; search problems; tight upper bound; trees (mathematics)", pubcountry = "Netherlands", sponsororg = "AFCET; BCS; GI", treatment = "T Theoretical or Mathematical", } @Article{Larsen:1990:PSS, author = "K. G. Larsen", title = "Proof systems for satisfiability in {Hennessy--Milner Logic} with recursion", journal = j-THEOR-COMP-SCI, volume = "72", number = "2-3", pages = "265--288", day = "23", month = may, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", conflocation = "Nancy, France; 21-25 March 1988", conftitle = "CAAP '88 --- 13th Colloque sur les Arbres en Algebre et en Programmation (Colloquium on Trees in Algebra and Programming)", corpsource = "Aalborg Univ. Centre, Denmark", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complete proof systems; concurrent programming; decision procedure; finite-state process; formal logic; Hennessy--Milner logic with recursion; introduction rule; observational equivalence; parallel programming; PROLOG; recursive functions; recursively specified formula; satisfiability; specification; theorem proving", pubcountry = "Netherlands", sponsororg = "AFCET; BCS; GI", treatment = "T Theoretical or Mathematical", } @Article{Jacopini:1990:RPC, author = "G. Jacopini and G. Sontacchi", title = "Reversible parallel computation: an evolving space-model", journal = j-THEOR-COMP-SCI, volume = "73", number = "1", pages = "1--46", day = "08", month = jun, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Matematica, Roma Univ., Italia, Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithm theory; colored spaces; compressibility of information; computation theory; computer science; computing functions; Euclidean spaces; finite automata; microscopic reversibility; parallel computation; parallel processing; space-model; transmission; Turing non-polynomial functions", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Kroger:1990:IAT, author = "F. Kroger", title = "On the interpretability of arithmetic in temporal logic", journal = j-THEOR-COMP-SCI, volume = "73", number = "1", pages = "47--60", day = "08", month = jun, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Inst. fur Inf., Ludwig-Maximilians-Univ. Munchen, West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "arithmetic; categorical axiomatizations; first-order theory; formal logic; incompleteness results; interpretability; temporal logic", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Lavault:1990:EAM, author = "C. Lavault", title = "Exact average message complexity values for distributed election on bidirectional rings of processors", journal = j-THEOR-COMP-SCI, volume = "73", number = "1", pages = "61--79", day = "08", month = jun, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4230B (Combinatorial switching theory); C4240 (Programming and algorithm theory)", corpsource = "INRIA, le Chesnay, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bidirectional rings; combinatorial enumeration methods; computational complexity; distributed election algorithm; distributed leader; distributed processing; distributed system; message complexity values; multiprocessor interconnection networks; rings of processors", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Varricchio:1990:FFM, author = "S. Varricchio", title = "Factorizations of free monoids and unavoidable regularities", journal = j-THEOR-COMP-SCI, volume = "73", number = "1", pages = "81--89", day = "08", month = jun, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math., Rome Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Burnside problem; combinatorics; factorizations; finite alphabet; formal languages; free monoids; searching; unavoidable regularities", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Jerrum:1990:FUG, author = "M. Jerrum and A. Sinclair", title = "Fast uniform generation of regular graphs", journal = j-THEOR-COMP-SCI, volume = "73", number = "1", pages = "91--100", day = "08", month = jun, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; degree sequences; graph theory; labelled graph; n-vertex sequences; polynomial time; rapidly convergent stochastic process; regular graphs; regular sequences; uniform generation", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Huwig:1990:NIC, author = "H. Huwig and A. Poigne", title = "A note on inconsistencies caused by fixpoints in a {Cartesian} closed category", journal = j-THEOR-COMP-SCI, volume = "73", number = "1", pages = "101--112", day = "08", month = jun, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Abt. Inf., Dortmund Univ., West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Cartesian closed category; category theory; computer science; coproducts; domain theory; fixpoints; inconsistencies; programming; programming theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Ganzinger:1990:F, author = "H. Ganzinger", title = "Foreword", journal = j-THEOR-COMP-SCI, volume = "73", number = "2", pages = "119--??", day = "22", month = jun, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Fri Nov 21 19:16:33 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", } @Article{Aiken:1990:TCB, author = "A. Aiken", title = "A theory of compaction-based parallelization", journal = j-THEOR-COMP-SCI, volume = "73", number = "2", pages = "121--154", day = "22", month = jun, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", corpsource = "IBM Almaden Res. Center, San Jose, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "compaction-based parallelization; doacross; formal system; infinite sequences; limits; measure; multiprocessor machines; parallel algorithms; parallel programming; program improvement; software pipelining; transformational system; transformations; vector machines; vectorization; VLIW machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Fuh:1990:TIS, author = "You-Chin C. Fuh and P. Mishra", title = "Type inference with subtypes", journal = j-THEOR-COMP-SCI, volume = "73", number = "2", pages = "155--175", day = "22", month = jun, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "classical unification algorithm; inference mechanisms; MATCH; polymorphic type inference; principal type property; principal types; programming theory; proof of correctness; structured theory; subtypes; syntactic completeness; type transformation; type-checker", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Giegerich:1990:CSI, author = "R. Giegerich", title = "Code selection by inversion of order-sorted derivors", journal = j-THEOR-COMP-SCI, volume = "73", number = "2", pages = "177--211", day = "22", month = jun, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6140D (High level languages)", corpsource = "Tech. Fak., Bielefeld Univ., West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "code selection problem; code selector specification; completeness; expressive power; formal criteria; hierarchic derivor; high level languages; intermediate languages; inversion; nonsyntactic subtasks; order-sorted derivors; order-sorted term algebras; pattern matching; programming theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Horwitz:1990:ARQ, author = "S. Horwitz", title = "Adding relational query facilities to software development environments", journal = j-THEOR-COMP-SCI, volume = "73", number = "2", pages = "213--230", day = "22", month = jun, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C4250 (Database theory); C6115 (Programming support); C6140D (High level languages); C6160D (Relational DBMS)", corpsource = "Dept. of Comput. Sci., Wisconsin-Univ., Madison, WI, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "database theory; implicit relations; nonrelational data structures; nonstandard relational operations; programming environments; programming theory; query evaluation; query languages; relational databases; relational query facilities; relationally-attributed grammars; software development environments; transitive closure", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Wadler:1990:DTP, author = "P. Wadler", title = "Deforestation: transforming programs to eliminate trees", journal = j-THEOR-COMP-SCI, volume = "73", number = "2", pages = "231--248", day = "22", month = jun, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., Glasgow Univ., UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithm; deforestation; eliminate; intermediate trees; optimizing compiler; program compilers; program transformation; programming theory; syntactic form; trees (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Beigel:1990:BIR, author = "R. Beigel", title = "Bi-immunity results for cheatable sets", journal = j-THEOR-COMP-SCI, volume = "73", number = "3", pages = "249--263", day = "22", month = jul, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bi-immunity; cheatable sets; computational complexity; parallel programming; parallel queries; polynomial-time algorithm; recursive set; set theory; time complexity classes", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Chen:1990:DBO, author = "Jian-er Chen", title = "The difference between one tape and two tapes: with respect to reversal complexity", journal = j-THEOR-COMP-SCI, volume = "73", number = "3", pages = "265--278", day = "22", month = jul, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Columbia Univ., New York, NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "1-tape; 2-tape; complexity measure; computational complexity; reversal complexity; Turing machine models; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hoffmann:1990:RNG, author = "J. Hoffmann and M. G. Main", title = "Results on {NLC} grammars with one-letter terminal alphabets", journal = j-THEOR-COMP-SCI, volume = "73", number = "3", pages = "279--294", day = "22", month = jul, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "grammars; graph languages; graph theory; language generating mechanism; NLC grammars; node label controlled graph grammars; restricted connection relation; terminal alphabets", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Kim:1990:CDR, author = "Changwook Kim", title = "Complexity and decidability for restricted classes of picture languages", journal = j-THEOR-COMP-SCI, volume = "73", number = "3", pages = "295--311", day = "22", month = jul, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Sch. of Electr. Eng. and Comput. Sci., Oklahoma Univ., Norman, OK, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexity; computational complexity; containment; decidability; equivalence; formal languages; picture languages; stripe picture languages; three-way picture languages", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Robson:1990:STB, author = "J. M. Robson", title = "Strong time bounds: non-computable bounds and a hierarchy theorem", journal = j-THEOR-COMP-SCI, volume = "73", number = "3", pages = "313--317", day = "22", month = jul, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Australian Nat. Univ., Canberra, ACT, Australia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computability; computational complexity; hierarchy theorem; non-computable bounds; RAM program; time bounds", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bertossi:1990:SMW, author = "A. A. Bertossi and F. Luccio and E. Lodi and L. Pagli", title = "String matching with weighted errors", journal = j-THEOR-COMP-SCI, volume = "73", number = "3", pages = "319--328", day = "22", month = jul, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; parallel algorithms; parallel time; PRAM model; sequential time; string matching problem; weighted differences; weighted errors", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Head:1990:SSM, author = "T. Head", title = "The set of strings mapped into a submonoid by iterates of a morphism", journal = j-THEOR-COMP-SCI, volume = "73", number = "3", pages = "329--333", day = "22", month = jul, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math. Sci., State Univ. of New York, Binghamton, NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "constructable regular language; endomorphism; formal languages; morphisms; strings; submonoid", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Schmitt:1990:HAI, author = "W. Schmitt", title = "{Hopf} algebras and identities in free partially commutative monoids", journal = j-THEOR-COMP-SCI, volume = "73", number = "3", pages = "335--340", day = "22", month = jul, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", 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 = "algebra of polynomials; commutative monoids; formal languages; Hopf algebras; partially commutative alphabet; partially commutative words; polynomials", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Diekert:1990:WPT, author = "V. Diekert", title = "Word problems over traces which are solvable in linear time", journal = j-THEOR-COMP-SCI, volume = "74", number = "1", pages = "3--18", day = "30", month = jul, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Inst. fur Inf., Tech. Univ. Munchen, West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "blocks; cones; confluence; decidability; decidable word problem; finite complete replacement systems; free partially commutative monoids; global condition; linear time; noetherian trace replacement system; semi Thue systems; trace replacement systems; vector replacement systems; weight-reducing", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Fussell:1990:SAP, author = "D. Fussell and R. Thurimella", title = "Successive approximation in parallel graph algorithms", journal = j-THEOR-COMP-SCI, volume = "74", number = "1", pages = "19--35", day = "30", month = jul, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comp. Sci., Texas Univ., Austin, TX, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "approximation theory; mesh of trees network model; neighboring vertices; open ear decomposition algorithm; parallel algorithms; parallel graph algorithms; parallel planarity testing; successive algorithm; triconnectivity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Gavilanes-Franco:1990:FOL, author = "A. Gavilanes-Franco and F. Lucio-Carrasco", title = "A first order logic for partial functions", journal = j-THEOR-COMP-SCI, volume = "74", number = "1", pages = "37--69", day = "30", month = jul, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. de Inf. y Autom., Fac. de Matematicas, Univ. Complutense de Madrid, Spain", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "calculi; completeness; first order logic; formal reasoning; many-valued logics; model theory; partial functions; program effects; semantical motivation; soundness; three valued logic", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Jancar:1990:DTL, author = "P. Jancar", title = "Decidability of a temporal logic problem for {Petri} nets", journal = j-THEOR-COMP-SCI, volume = "74", number = "1", pages = "71--93", day = "30", month = jul, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Min. Inst., Czechoslovak Acad. of Sci., Ostrava, Czechoslovakia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "decidability; decision algorithm; infinite weakly fair occurrence sequence; open problem; Petri nets; temporal logic", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Preparata:1990:DPP, author = "F. P. Preparata and R. Tamassia", title = "Dynamic planar point location with optimal query time", journal = j-THEOR-COMP-SCI, volume = "74", number = "1", pages = "95--114", day = "30", month = jul, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4190 (Other numerical methods)", corpsource = "Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational geometry; convex planar subdivision; depletion; dynamic planar point location; insertion; optimal query time; trapezoid method", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Szepietowski:1990:IDN, author = "A. Szepietowski", title = "If deterministic and nondeterministic space complexities are equal for $\log \log n$, then they are also equal for $\log n$", journal = j-THEOR-COMP-SCI, volume = "74", number = "1", pages = "115--119", day = "30", month = jul, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Tech. Univ. of Gdansk, Poland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; deterministic space complexity; nondeterministic space complexities", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Gastin:1990:AMD, author = "P. Gastin", title = "An asynchronous model for distributed systems", journal = j-THEOR-COMP-SCI, volume = "74", number = "2", pages = "121--162", day = "21", month = aug, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "LITP, Paris 6 Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "asynchronous model; bases; concatenation; concurrency; CSP; dependency; distributed model; distributed processing; distributed systems; ESTELLE; finitary part; formal languages; free partially commutative monoid; infinitary free monoid; infinite product; isomorphic; language theory; length; prefix order; semantics; upper bound", language = "French", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Gecseg:1990:ARP, author = "F. Gecseg and H. Jurgensen", title = "Automata represented by products of soliton automata", journal = j-THEOR-COMP-SCI, volume = "74", number = "2", pages = "163--181", day = "21", month = aug, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C5280 (Other digital techniques)", corpsource = "Jozsef Attila Tudomanyegyetem Bolyai Intezete, Szeged, Hungary", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; biocomputers; homomorphic representations; isomorphic representations; logic; mathematical model; molecular switching elements; simulation power; soliton automata; soliton switching; soliton valves; solitons; transition semigroups", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Oommen:1990:DOE, author = "B. J. Oommen and E. R. Hansen and J. I. Munro", title = "Deterministic optimal and expedient move-to-rear list organizing strategies", journal = j-THEOR-COMP-SCI, volume = "74", number = "2", pages = "183--197", day = "21", month = aug, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1140Z (Other and miscellaneous); C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "absorbing; access probabilities; constant space; counter-intuitive; descending order; deterministic; expedient; linear space; list processing; Markovian representation; move-to-rear list organizing; optimal; probability; programming theory; self-organizing; sorting", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Okulicka:1990:PC, author = "F. Okulicka", title = "On priority in {COSY}", journal = j-THEOR-COMP-SCI, volume = "74", number = "2", pages = "199--216", day = "21", month = aug, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Inst. of Math., Warsaw Univ. of Technol., Poland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "concurrency control; COSY path expressions; decomposition theorem; formal semantics; Petri nets; priority path; priority relation; programming theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hartmanis:1990:RMS, author = "J. Hartmanis and L. A. Hemachandra", title = "Robust machine saccept easy sets", journal = j-THEOR-COMP-SCI, volume = "74", number = "2", pages = "217--225", day = "21", month = aug, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata 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 = "computational property; easy sets; languages; nondeterministic oracle access; relativizations; robustly categorical machines; robustly complementary machines; robustly Sigma *-accepting machines; robustly Sigma *-spanning machines; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bezem:1990:CRR, author = "M. Bezem", title = "Completeness of resolution revisited", journal = j-THEOR-COMP-SCI, volume = "74", number = "2", pages = "227--237", day = "21", month = aug, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Centre for Math. and Comput. Sci., Amsterdam, Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "cardinality; clauses; completeness proofs; ground clauses; ground resolution; infinite sets; language; redundancies; set theory; Zorn Lemma", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Huttel:1990:SCM, author = "H. Huttel", title = "{SnS} can be modally characterized", journal = j-THEOR-COMP-SCI, volume = "74", number = "2", pages = "239--248", day = "21", month = aug, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Lab. for Found. of Comput. Sci., Edinburgh Univ., UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "equivalence; equivalence classes; formal languages; formal logic; label set; Milner; modal mu-calculus; Rabin recognizable tree languages", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Kummer:1990:EPF, author = "M. Kummer", title = "An easy priority-free proof of a theorem of Friedberg", journal = j-THEOR-COMP-SCI, volume = "74", number = "2", pages = "249--251", day = "21", month = aug, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Fakultat fur Inf., Karlsruhe Univ., West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "enumeration; Friedberg; partial recursive one-place functions; priority-free proof; set; set theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Zhang:1990:PNM, author = "Jingzhong Zhang and Lu Yang and M. Deng", title = "The parallel numerical method of mechanical theorem proving", journal = j-THEOR-COMP-SCI, volume = "74", number = "3", pages = "253--271", day = "28", month = aug, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4190 (Other numerical methods); C4210 (Formal logic)", corpsource = "Inst. of Math. Sci., Acad. Sinica, Chengdu, China", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic identity; complexity; geometry theorems; mechanical theorem proving; multi-instance numerical verification; nontrivial geometric theorems; parallel algorithms; parallel numerical method; theorem proving", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Casas:1990:ASC, author = "R. Casas and M.-I. Fernandez-Camacho and J.-M. Steyaert", title = "Algebraic simplification in computer algebra: an analysis of bottom-up algorithms", journal = j-THEOR-COMP-SCI, volume = "74", number = "3", pages = "273--298", day = "28", month = aug, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra); C4240 (Programming and algorithm theory)", corpsource = "Fac. de Inf., Univ. Politecnica de Catalunya, Barcelona, Spain", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebra; algebraic expressions; algebraic simplification; average size; average time complexity; bottom-up algorithms; computational complexity; computer algebra; logical expressions; simplification algorithms; space gain; worst-case behaviour", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{He:1990:EAE, author = "Xin He", title = "An efficient algorithm for edge coloring planar graphs with Delta colors", journal = j-THEOR-COMP-SCI, volume = "74", number = "3", pages = "299--312", day = "28", month = aug, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. 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; edge coloring; efficient algorithm; graph colouring; maximum degree; planar graphs; vertices", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Babai:1990:LBC, author = "L. Babai and P. Pudlak and V. Rodl and E. Szemeredi", title = "Lower bounds to the complexity of symmetry {Boolean} functions", journal = j-THEOR-COMP-SCI, volume = "74", number = "3", pages = "313--323", day = "28", month = aug, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "E{\"o}tv{\"o}s Univ., Budapest, Hungary", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Boolean functions; bounded widths; branching programs; complexity; computational complexity; lower bounds; symmetry Boolean functions; unbounded widths", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hertrampf:1990:RAM, author = "U. Hertrampf", title = "Relations among mod-classes", journal = j-THEOR-COMP-SCI, volume = "74", number = "3", pages = "325--328", day = "28", month = aug, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Inst. for Inf., Wurzburg Univ., West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "closed under union; deterministic polynomial time computation; mod-classes; oracle answer; prime divisors; relations; residue class modulo; subclasses; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Romeuf:1990:PAS, author = "J.-F. Romeuf", title = "A polynomial algorithm for solving systems of two linear {Diophantine} equations", journal = j-THEOR-COMP-SCI, volume = "74", number = "3", pages = "329--340", day = "28", month = aug, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Lab. d'Inf., Rouen Univ., Mont-Saint-Aignan, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "absolute values; complexity; computational complexity; linear algebra; linear diophantine equations; max; minimal length solution; polynomial algorithm; rational expression; upper bounds; variables", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Anselmo:1990:ZCT, author = "M. Anselmo", title = "On zigzag codes and their decidability", journal = j-THEOR-COMP-SCI, volume = "74", number = "3", pages = "341--354", day = "28", month = aug, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes); C4210 (Formal logic); C4220 (Automata theory); C6130 (Data handling techniques)", corpsource = "Lab. de'Inf. Theor. et Programmation, Paris Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; codes; crossing sequences; decidability; nonambiguous; regular language; two-way automata; zigzag codes; zigzag factorizations", language = "French", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Szymanski:1990:CAR, author = "J. Szymanski", title = "On the complexity of algorithms on recursive trees", journal = j-THEOR-COMP-SCI, volume = "74", number = "3", pages = "355--361", day = "28", month = aug, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Math., Tech. Univ., Poznan, Poland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; degree path lengths; mean path lengths; recursive tree algorithms; trees (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Anonymous:1990:ICF, author = "Anonymous", title = "{International Conference on Fifth Generation Computer Systems 1988}", journal = j-THEOR-COMP-SCI, volume = "75", number = "1-2", pages = "??--??", day = "25", month = sep, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", conflocation = "Tokyo, Japan; 28 Nov.-2 Dec. 1988", conftitle = "International Conference on Fifth Generation Computer Systems 1988", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "comparative metric semantics; complete sets; concurrent calculus; concurrent logic languages; concurrent Prolog; conditional equational programming; conditional equational theories; declarative semantics; finite failures; flat guarded Horn clauses; formal logic; halting problem; logic programming; partial computations; perpetual processes; preservation; programming theory; stronger equivalence; term rewriting systems; time complexity; unfold/fold logic program transformation; weighted graphs", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Milner:1990:IOC, author = "R. Milner", title = "Interpreting one concurrent calculus in another", journal = j-THEOR-COMP-SCI, volume = "75", number = "1-2", pages = "3--13", day = "25", month = sep, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", conflocation = "Tokyo, Japan; 28 Nov.-2 Dec. 1988", conftitle = "International Conference on Fifth Generation Computer Systems 1988", corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "applied calculus; calculus; communicating systems; concurrent calculus; formal logic; Hoare logic; imperative concurrent programming language; interpretation; logic programming; parallel programming; programming theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{deBakker:1990:CMS, author = "J. W. {de Bakker} and J. N. Kok", title = "Comparative metric semantics for Concurrent Prolog", journal = j-THEOR-COMP-SCI, volume = "75", number = "1-2", pages = "15--43", day = "25", month = sep, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory); C6140D (High level languages); C6150J (Operating systems)", conflocation = "Tokyo, Japan; 28 Nov.-2 Dec. 1988", conftitle = "International Conference on Fifth Generation Computer Systems 1988", corpsource = "Centre for Math. Comput. Sci., Amsterdam, Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "atomic actions; Banach fixed point theorem; concurrency control; Concurrent Prolog program; denotational semantics; domains; equivalence; formal logic; imperative languages; interpretation function; logic programming; metric semantics; metric spaces; nonflat guards; operational semantics; programming theory; PROLOG; transition system; uniform language", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Falaschi:1990:FFP, author = "M. Falaschi and G. Levi", title = "Finite failures and partial computations in concurrent logic languages", journal = j-THEOR-COMP-SCI, volume = "75", number = "1-2", pages = "45--66", day = "25", month = sep, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory); C6140D (High level languages)", conflocation = "Tokyo, Japan; 28 Nov.-2 Dec. 1988", conftitle = "International Conference on Fifth Generation Computer Systems 1988", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "commit operator; computation rule; concurrent logic languages; fair search rule; finite failure set; formal logic; high level languages; least fixpoint; logic programming; operational semantics; parallel computation rule; parallel programming; partial computations; partial computed answer substitutions; programming theory; semantic properties", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Murakami:1990:DSF, author = "M. Murakami", title = "A declarative semantics of flat guarded {Horn} clauses for programs with perpetual processes", journal = j-THEOR-COMP-SCI, volume = "75", number = "1-2", pages = "67--83", day = "25", month = sep, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory); C6140D (High level languages)", conflocation = "Tokyo, Japan; 28 Nov.-2 Dec. 1988", conftitle = "International Conference on Fifth Generation Computer Systems 1988", corpsource = "Inst. for New Generation Comput. Technol., Tokyo, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "concurrent programming language; declarative semantics; flat GHC; flat guarded Horn clauses; formal logic; goal clauses; greatest fixpoint; guard-commit mechanisms; guarded clauses; high level languages; I/O histories; input/output; logic programming; maximum model; parallel programming; perpetual computation; perpetual processes; programming theory; truth", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Holldobler:1990:CET, author = "S. Holldobler", title = "Conditional equational theories and complete sets of transformations", journal = j-THEOR-COMP-SCI, volume = "75", number = "1-2", pages = "85--110", day = "25", month = sep, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic); C4240 (Programming and algorithm theory)", conflocation = "Tokyo, Japan; 28 Nov.-2 Dec. 1988", conftitle = "International Conference on Fifth Generation Computer Systems 1988", corpsource = "FG Intellektik, FB Inf., Tech. Hochschule, Darmstadt, West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "canonical; complete sets of transformations; completeness proof; conditional equational theories; expressions; formal logic; general unifier; ground confluent; least Herbrand model; linear paramodulation; logic programming; programming theory; reflection; refutation; rules; search space", pubcountry = "Netherlands", treatment = "B Bibliography; T Theoretical or Mathematical", } @Article{Dershowitz:1990:RCE, author = "N. Dershowitz and M. Okada", title = "A rationale for conditional equational programming", journal = j-THEOR-COMP-SCI, volume = "75", number = "1-2", pages = "111--138", day = "25", month = sep, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", conflocation = "Tokyo, Japan; 28 Nov.-2 Dec. 1988", conftitle = "International Conference on Fifth Generation Computer Systems 1988", corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "built-in predicates; completeness; conditional equational programming; conditional rewriting program; correctness property; existentially quantified conditions; formal logic; ground confluence; higher-order terms; logic programming; narrowing; programming theory; rewriting systems; termination; variable-free input term", pubcountry = "Netherlands", treatment = "B Bibliography; T Theoretical or Mathematical", } @Article{Kawamura:1990:PSE, author = "T. Kawamura and T. Kanamori", title = "Preservation of stronger equivalence in unfold\slash fold logic program transformation", journal = j-THEOR-COMP-SCI, volume = "75", number = "1-2", pages = "139--156", day = "25", month = sep, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", conflocation = "Tokyo, Japan; 28 Nov.-2 Dec. 1988", conftitle = "International Conference on Fifth Generation Computer Systems 1988", corpsource = "Mitsubishi Electr. Corp., Central Res. Lab., Hyogo, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "answer substitutions; equivalence classes; formal logic; initial program; least Herbrand model; logic programming; programming theory; Prolog programs; semantics; stronger equivalence; Tamaki--Sato transformation; top-level goal; unfold/fold logic program transformation", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Devienne:1990:WGT, author = "P. Devienne", title = "Weighted graphs: a tool for studying the halting problem and time complexity in term rewriting systems and logic programming", journal = j-THEOR-COMP-SCI, volume = "75", number = "1-2", pages = "157--215", day = "25", month = sep, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", conflocation = "Tokyo, Japan; 28 Nov.-2 Dec. 1988", conftitle = "International Conference on Fifth Generation Computer Systems 1988", corpsource = "Lab. d'Inf. Fondamentale de Lille, Univ. des Sci. et Tech. de Lille, Villeneuve d'Ascq, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "arrows; branch; computational complexity; directed graph; directed graphs; finite interpretation; halting problem; indexes; infinite interpretation; infinite regular trees; logic programming; nonregular trees; periods; programming theory; PROLOG-like languages; recursive rules; rewriting systems; syntactic object; term rewriting systems; time complexity; unfolding; unification; weighted graph; weighting", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Degano:1990:POS, author = "P. Degano and R. {De Nicola} and U. Montanari", title = "A partial ordering semantics for {CCS}", journal = j-THEOR-COMP-SCI, volume = "75", number = "3", pages = "223--262", day = "01", month = oct, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6120 (File organisation)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract semantics; calculus of communicating sequences; concurrency; congruence; data structures; formal logic; observational equivalence; operational semantics; parallel operator; partial ordering semantics; partial orderings; rewriting systems; SOS style", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Katz:1990:IST, author = "S. Katz and D. Peled", title = "Interleaving set temporal logic", journal = j-THEOR-COMP-SCI, volume = "75", number = "3", pages = "263--287", day = "01", month = oct, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", 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 = "branching time; computational model; correctness proofs; distributed algorithms; formal logic; global snapshots; interleaving; interpretation; layering; specification; temporal logic; temporal semantics; theorem proving; theorems", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Droste:1990:NDI, author = "M. Droste and R. Gobel", title = "Non-deterministic information systems and their domains", journal = j-THEOR-COMP-SCI, volume = "75", number = "3", pages = "289--309", day = "01", month = oct, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6140 (Programming languages)", corpsource = "Fach. Math., Univ. GHS Essen, West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic partial orders; denotational semantics; domains; nondeterministic information systems; programming languages; programming languages Dedekind-complete; programming theory; representation theorem", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Blass:1990:SGF, author = "U. Blass and A. S. Fraenkel", title = "The {Sprague-Grundy} function for {Wythoff}'s game", journal = j-THEOR-COMP-SCI, volume = "75", number = "3", pages = "311--333", day = "01", month = oct, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Appl. Math. and Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "1-values; game theory; recursive algorithm; Sprague-Grundy function; Wythoff's game", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Allender:1990:DTE, author = "E. Allender and C. Wilson", title = "Downward translations of equality", journal = j-THEOR-COMP-SCI, volume = "75", number = "3", pages = "335--346", day = "01", month = oct, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexity classes; computational complexity; downward translations; equality; oracles", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Du:1990:MMF, author = "J. Du and J. Y.-T. Leung and G. H. Young", title = "Minimizing mean flow time with release time constraint", journal = j-THEOR-COMP-SCI, volume = "75", number = "3", pages = "347--355", day = "01", month = oct, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Texas Univ., Dallas, TX, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; independent tasks; mean flow time minimisation; NP-hard; polynomial time; preemptively scheduling; release time constraint; scheduling", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Lengauer:1990:BNF, author = "T. Lengauer and K. W. Wagner", title = "The binary network flow problem is logspace complete for {P}", journal = j-THEOR-COMP-SCI, volume = "75", number = "3", pages = "357--363", day = "01", month = oct, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Univ.-GH Paderborn, West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "acyclic graphs; binary network flow problem; computational complexity; edge capacities; graph theory; logspace complete; logspace Turing complete; many-one complete; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bonner:1990:HDC, author = "A. J. Bonner", title = "Hypothetical datalog: complexity and expressibility", journal = j-THEOR-COMP-SCI, volume = "76", number = "1", pages = "3--51", day = "31", month = oct, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C4250 (Database theory); C6160D (Relational DBMS)", conflocation = "Bruges, Belgium; 31 Aug.-2 Sept. 1988", conftitle = "ICDT 1988: 2nd International Conference on Database Theory", corpsource = "Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexities; computational complexity; data domain; data-complexity; database; database theory; expressibilities; formal logic; Horn-clause logic; predicate case; query language; relational databases", pubcountry = "Netherlands", sponsororg = "Agfa-Gevaert; Apple Computer; Bell Telephone; et al", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ohori:1990:STD, author = "A. Ohori", title = "Semantics of types for database objects", journal = j-THEOR-COMP-SCI, volume = "76", number = "1", pages = "53--91", day = "31", month = oct, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory); C6120 (File organisation)", conflocation = "Bruges, Belgium; 31 Aug.-2 Sept. 1988", conftitle = "ICDT 1988: 2nd International Conference on Database Theory", corpsource = "Dept. of Comput. and Inf. Sci., Pennsylvania Univ., Philadelphia, PA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "arbitrarily complex structures; data models; data structures; database objects; database theory; domains; finite sets; labeled disjoint unions; labeled records; mathematical theory; ML-like programming language; polymorphism; projection; recursion; static type inference; types", pubcountry = "Netherlands", sponsororg = "Agfa-Gevaert; Apple Computer; Bell Telephone; et al", treatment = "B Bibliography; P Practical; T Theoretical or Mathematical", } @Article{Karabeg:1990:PUT, author = "D. Karabeg and V. Vianu", title = "Parallel update transactions", journal = j-THEOR-COMP-SCI, volume = "76", number = "1", pages = "93--114", day = "31", month = oct, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory); C6160 (Database management systems (DBMS))", conflocation = "Bruges, Belgium; 31 Aug.-2 Sept. 1988", conftitle = "ICDT 1988: 2nd International Conference on Database Theory", corpsource = "Dept. of Comput Sci. and Eng., California Univ., San Diego, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "database management systems; database theory; optimal parallelizations; parallel update transactions; query languages; sequential transactions; transaction processing", pubcountry = "Netherlands", sponsororg = "Agfa-Gevaert; Apple Computer; Bell Telephone; et al", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Lipeck:1990:TDI, author = "U. W. Lipeck", title = "Transformation of dynamic integrity constraints into transaction specifications", journal = j-THEOR-COMP-SCI, volume = "76", number = "1", pages = "115--142", day = "31", month = oct, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory); C6160 (Database management systems (DBMS))", conflocation = "Bruges, Belgium; 31 Aug.-2 Sept. 1988", conftitle = "ICDT 1988: 2nd International Conference on Database Theory", corpsource = "Fachbereich Inf., Dortmund Univ., West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "admissible sequences; database theory; dynamic database behaviour; dynamic integrity constraints; predicate logic; temporal logic; transaction processing; transaction specifications; transition graphs", pubcountry = "Netherlands", sponsororg = "Agfa-Gevaert; Apple Computer; Bell Telephone; et al", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Dong:1990:DDP, author = "Guozhu Dong and S. Ginsburg", title = "On the decomposition of datalog program mappings", journal = j-THEOR-COMP-SCI, volume = "76", number = "1", pages = "143--177", day = "31", month = oct, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6160 (Database management systems (DBMS))", conflocation = "Bruges, Belgium; 31 Aug.-2 Sept. 1988", conftitle = "ICDT 1988: 2nd International Conference on Database Theory", corpsource = "Dept. of Comput. Sci., Univ. of Southern California, Los Angeles, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bounded programs; database management systems; datalog program mappings; decomposition; logic programming; optimisation; optimization; primality; single-rule programs; strongly linear programs", pubcountry = "Netherlands", sponsororg = "Agfa-Gevaert; Apple Computer; Bell Telephone; et al", treatment = "P Practical", } @Article{Kok:1990:CCC, author = "J. N. Kok and J. J. M. M. Rutten", title = "Contractions in comparing concurrency semantics", journal = j-THEOR-COMP-SCI, volume = "76", number = "2-3", pages = "179--222", day = "21", month = nov, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Centre for Math. and Comput. Sci., Amsterdam, Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complete metric spaces; concurrency semantics; concurrent imperative languages; contractions; denotational semantic models; fixed points; formal languages; operational semantic models", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Sakakibara:1990:LCF, author = "Y. Sakakibara", title = "Learning context-free grammars from structural data in polynomial time", journal = j-THEOR-COMP-SCI, volume = "76", number = "2-3", pages = "223--242", day = "21", month = nov, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Int. Inst. for Adv. Study of Social Inf. Sci., Fujitsu Ltd., Shizuoka, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; context-free grammars; correct grammar; efficient algorithm; equivalent; frontier-to-root tree automaton; learning protocol; minimally adequate teacher; polynomial time; query types; structural data; structural descriptions; structural equivalence queries; structural membership queries; unknown grammar; unlabelled derivation trees", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Timmerman:1990:TSR, author = "E. Timmerman", title = "The three subfamilies of rational omega-languages closed under omega-transduction", journal = j-THEOR-COMP-SCI, volume = "76", number = "2-3", pages = "243--250", day = "21", month = nov, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. Inf., CNRS, Lille 1 Univ., Villeneuve d'Ascq, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bimorphisms; closed; complementary; deterministic; formal languages; inverse non-erasing morphisms; non-erasing morphisms; omega-transductions; rational adherences; rational omega-languages; subfamilies; whole family", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Weil:1990:PLC, author = "P. Weil", title = "Products of languages with counter", journal = j-THEOR-COMP-SCI, volume = "76", number = "2-3", pages = "251--260", day = "21", month = nov, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "LITP, Paris, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "finite monoids; formal languages; one-to-one correspondence; product of languages with counter; rational languages; varieties", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Tirri:1990:CTC, author = "S. Tirri", title = "The congruence theory of closure properties of regular tree languages", journal = j-THEOR-COMP-SCI, volume = "76", number = "2-3", pages = "261--271", day = "21", month = nov, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Math., Turku Univ., Finland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Boolean operations; cardinalities; closure properties; congruence theory; converses; finite indexes; forest product; formal languages; frontier alphabets; index; Nerode type; ranked alphabets; recognizability; recognizable forests; regular tree languages; saturate; sigma-catenation; term algebras; tree automatas; tree homomorphisms; trees (mathematics); x-iteration; x-product; x-quotient", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hashiguchi:1990:ERE, author = "K. Hashiguchi and H. Yoo", title = "Extended regular expressions of star degree at most two", journal = j-THEOR-COMP-SCI, volume = "76", number = "2-3", pages = "273--284", day = "21", month = nov, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Inf. and Comput. Sci., Toyohashi Univ. of Technol., Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "closure; concatenation; context-free languages; extended regular expressions; finite languages; formal languages; Kleene star; star degree; star operator; subfamily; union", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Petit:1990:DSA, author = "A. Petit", title = "Distribution and synchronized automata", journal = j-THEOR-COMP-SCI, volume = "76", number = "2-3", pages = "285--308", day = "21", month = nov, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "LIFO, Orleans Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "distributed processes; distribution problem; finite automata; machines; sequential processes; synchronization states; synchronized automata", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Yamasaki:1990:RES, author = "S. Yamasaki", title = "Recursion equation sets computing logic programs", journal = j-THEOR-COMP-SCI, volume = "76", number = "2-3", pages = "309--322", day = "21", month = nov, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Inf. Technol., Okayama Univ., Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "continuous function; dataflow program; definite clauses; finite sequences; formal logic; ground atoms; inferences; infinite sequences; least fixpoint; Lisp-like program; logic programming; logic programs; merge functions; minimal Herbrand model; programming theory; recursion equation set; sequence domain; set unions", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Jiang:1990:CTA, author = "T. Jiang", title = "On the complexity of $1$-tape {ATMs} and off-line $1$-tape {ATMs} running in constant reversals", journal = j-THEOR-COMP-SCI, volume = "76", number = "2-3", pages = "323--330", day = "21", month = nov, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Syst., McMaster Univ., Hamilton, Ont., Canada", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "1-tape ATMs; alternating Turing machine; complexity; computational complexity; constant reversals; off-line 1-tape ATMs; recursive function; recursively enumerable set; regular languages; Turing machines; worktape head", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Gannett:1990:OPS, author = "E. Gannett and S. C. Kothari and H.-C. Yen", title = "On optimal parallelization of sorting networks", journal = j-THEOR-COMP-SCI, volume = "76", number = "2-3", pages = "331--341", day = "21", month = nov, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "mathematical proof; optimal parallelization; programming theory; semantic-preserving transformation; sequential program traces; sorting; sorting networks; systolic architecture; systolic design", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Sarnath:1990:PCG, author = "R. Sarnath and Xin He", title = "A {P}-Complete Graph Partition Problem", journal = j-THEOR-COMP-SCI, volume = "76", number = "2-3", pages = "343--351", day = "21", month = nov, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. 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; different than majority labelling; graph theory; lexicographical first DTML; P-complete graph partition problem; planar graphs; polynomial time sequential algorithm", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Anonymous:1990:ICA, author = "Anonymous", title = "{International Conference on Algebraic Methodology and Software Technology, AMAST}", journal = j-THEOR-COMP-SCI, volume = "77", number = "1-2", pages = "??--??", day = "07", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6110B (Software engineering techniques)", conflocation = "Iowa City, IA, USA; 22-24 May 1989", conftitle = "International Conference on Algebraic Methodology and Software Technology, AMAST", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic methodology; computational linguistics; formal languages; formal logic; formal specification; formal specifications; semantics; software engineering; syntax", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Rus:1990:E, author = "T. Rus", title = "Editorial", journal = j-THEOR-COMP-SCI, volume = "77", number = "1-2", pages = "1--??", day = "07", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Fri Nov 21 19:16:33 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", } @Article{Bradley:1990:ALD, author = "L. Bradley", title = "Abstract language design", journal = j-THEOR-COMP-SCI, volume = "77", number = "1-2", pages = "5--26", day = "07", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", conflocation = "Iowa City, IA, USA; 22-24 May 1989", conftitle = "International Conference on Algebraic Methodology and Software Technology, AMAST", corpsource = "CSE Dept., California Univ., San Diego, La Jolla, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract languages; computational linguistics; formal designs; formal languages; language definitions; semantics; syntax", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Ehrig:1990:CPD, author = "H. Ehrig and W. Fey and H. Hansen and M. Lowe and D. Jacobs and F. Parisi-Presicce", title = "Compatibility problems in the development of algebraic module specifications", journal = j-THEOR-COMP-SCI, volume = "77", number = "1-2", pages = "27--71", day = "07", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6110B (Software engineering techniques)", conflocation = "Iowa City, IA, USA; 22-24 May 1989", conftitle = "International Conference on Algebraic Methodology and Software Technology, AMAST", corpsource = "Tech. Univ. Berlin, West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic module specifications; compatibility problems; development steps; formal specification; interface specifications; modular software systems; morphisms; objects; partial functors; specification languages; structuring operations; vertical development steps", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Even:1990:CSA, author = "S. Even and D. A. Schmidt", title = "Category-sorted algebra-based action semantics", journal = j-THEOR-COMP-SCI, volume = "77", number = "1-2", pages = "73--95", day = "07", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4290 (Other computer theory)", conflocation = "Iowa City, IA, USA; 22-24 May 1989", conftitle = "International Conference on Algebraic Methodology and Software Technology, AMAST", corpsource = "Dept. of Comput. and Inf. Sci., Kansas State Univ, Manhattan, KS, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "action semantics; category of actions; category-sorted algebra; category-sorted algebra-based action semantics; coercions; completeness; computational linguistics; continuation semantics domains; decidable type inference algorithm; denotational semantics; direct semantics domains; domain structure; high level languages; metalanguage; modifiability; programming language; readability; resumption semantics domains; semantic soundness", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Janicki:1990:TSS, author = "R. Janicki and T. Muldner", title = "Transformations of sequential specifications into concurrent specifications by synchronization guards", journal = j-THEOR-COMP-SCI, volume = "77", number = "1-2", pages = "97--129", day = "07", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory); C6110B (Software engineering techniques)", conflocation = "Iowa City, IA, USA; 22-24 May 1989", conftitle = "International Conference on Algebraic Methodology and Software Technology, AMAST", corpsource = "Dept. of Comput. Sci. and Syst., McMaster Univ., Hamilton, Ont., Canada", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Banach; concurrent specifications; formal specification; high level languages; parallel programming; Pascal; Pascal-like language; programming language representation; programming theory; regular expression; sequential specifications; special actions; synchronisation; synchronization guards; transformations", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Manca:1990:ETL, author = "V. Manca and A. Salibra and G. Scollo", title = "Equational type logic", journal = j-THEOR-COMP-SCI, volume = "77", number = "1-2", pages = "131--159", day = "07", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", conflocation = "Iowa City, IA, USA; 22-24 May 1989", conftitle = "International Conference on Algebraic Methodology and Software Technology, AMAST", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "atomic formulae; binary relation; conditional term rewriting systems; dependent types; equational logic; equational type logic; formal logic; partiality; rewriting systems; type polymorphism; unified framework; universal algebras", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Pigozzi:1990:DTM, author = "D. Pigozzi", title = "Data types over multiple-valued logics", journal = j-THEOR-COMP-SCI, volume = "77", number = "1-2", pages = "161--194", day = "07", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6120 (File organisation)", conflocation = "Iowa City, IA, USA; 22-24 May 1989", conftitle = "International Conference on Algebraic Methodology and Software Technology, AMAST", corpsource = "Dept. of Math., Iowa State Univ., Ames, IA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "axiomatization; computer science; conditional-equational theory; data structures; equality-test algebra; equality-test data types; many-sorted algebra; many-valued logics; multiple-valued logics; nonclassical equality-test algebras; truth values", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Wagner:1990:ASL, author = "E. G. Wagner", title = "An algebraically specified language for data directed design", journal = j-THEOR-COMP-SCI, volume = "77", number = "1-2", pages = "195--219", day = "07", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4290 (Other computer theory); C6140D (High level languages)", conflocation = "Iowa City, IA, USA; 22-24 May 1989", conftitle = "International Conference on Algebraic Methodology and Software Technology, AMAST", corpsource = "Dept. of Math. Sci., 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; algebraically specified language; computational linguistics; data directed design; data types; formal specification; high level languages; LD/sup 3/; programming language; semantics", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Toda:1990:PRL, author = "S. Toda", title = "Positive relativizations for log space computability", journal = j-THEOR-COMP-SCI, volume = "77", number = "3", pages = "221--235", day = "15", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Univ. of Electro-commun., Tokyo, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computability; computational complexity; deterministic; log-space computability; nondeterministic; polynomial-time computability; positive relativizations; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bozapalidis:1990:ECF, author = "S. Bozapalidis", title = "Effective constructions on formal series of trees", journal = j-THEOR-COMP-SCI, volume = "77", number = "3", pages = "237--247", day = "15", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Dept. des Math., Salonique Univ., Greece", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "effective constructions; minimal matrix representation; natural number; recognizable tree series; series (mathematics); syntactic algebra; trees (mathematics)", language = "French", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Smith:1990:IAP, author = "C. H. Smith and M. Velauthapillai", title = "On the inference of approximate programs", journal = j-THEOR-COMP-SCI, volume = "77", number = "3", pages = "249--266", day = "15", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "approximate programs; inductive inference; inference; inference mechanisms; program; programming theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Kawahara:1990:PCB, author = "Y. Kawahara", title = "Pushout-complements and basic concepts of grammars in toposes", journal = j-THEOR-COMP-SCI, volume = "77", number = "3", pages = "267--289", day = "15", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math., Kyushu Univ., Fukuoka, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "binary relations; category theory; Church--Rosser theorem; directed graphs; elementary topos; embedding theorem; existence theorem; grammars; pushout-complements; relational calculus", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Atzeni:1990:EOQ, author = "P. Atzeni and E. P. F. Chan", title = "Efficient and optimal query answering on independent schemes", journal = j-THEOR-COMP-SCI, volume = "77", number = "3", pages = "291--308", day = "15", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory)", corpsource = "IASI-CNR, Roma, Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "chase join expressions; database theory; functional dependencies; independent schemes; optimal query answering; optimal unions; relational databases; total projections; Universal Relation Interface", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Dowling:1990:FPL, author = "W. F. Dowling and R. Kline", title = "The fixed points of logic programs with {Herbrand} base {$N$}", journal = j-THEOR-COMP-SCI, volume = "77", number = "3", pages = "309--319", day = "15", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. and Comput. Sci., Drexel Univ., Philadelphia, PA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; fixed points; Herbrand base; logic programming; logic programs; recursion-theoretic complexity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Fahmy:1990:APN, author = "H. M. A. Fahmy", title = "Analysis of {Petri} nets by partitioning: splitting transitions", journal = j-THEOR-COMP-SCI, volume = "77", number = "3", pages = "321--330", day = "15", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4200 (Computer theory)", corpsource = "Dept. of Electron. and Comput., Ain Shams Univ., Cairo, Egypt", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computation time; partitioning; Petri nets; reachability tree; splitting transitions", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Elbaz:1990:CVD, author = "M. Elbaz and J.-C. Spehner", title = "Construction of {Voronoi} diagrams in the plane by using maps", journal = j-THEOR-COMP-SCI, volume = "77", number = "3", pages = "331--343", day = "15", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Lab. de Math. et Inf., Univ. de Haute-Alsace, Mulhouse, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "approximation tests; cocircularity; collinearity; complexity; computational complexity; data structure; data structures; Delaunay diagram; finite set; set theory; triangulation; Voronoi diagrams", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Anonymous:1991:WDD, author = "Anonymous", title = "{Workshop on Deductive Database Theory}", journal = j-THEOR-COMP-SCI, volume = "78", number = "1", pages = "??--??", day = "21", month = jan, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory)", conflocation = "Illiers-Combray, France; 1989", conftitle = "Workshop on Deductive Database Theory", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "context-free graph grammars; database languages; database theory; Datalog; deductive databases; default; formal logic; grammars; negation; non-Horn deductive databases; recursive queries; rule-based; semantics; three-valued logic; unstratifiable logic programs", pubcountry = "Netherlands", } @Article{Bidoit:1991:NRB, author = "N. Bidoit", title = "Negation in rule-based database languages: a survey", journal = j-THEOR-COMP-SCI, volume = "78", number = "1", pages = "3--83", day = "21", month = jan, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4250 (Database theory); C6160Z (Other DBMS)", conflocation = "Illiers-Combray, France; 1989", conftitle = "Workshop on Deductive Database Theory", corpsource = "CNRS, Lab. de Recherche en Inf., Orsay, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "deductive databases; logic program; logic programming; negation; query languages; rule-based query; rule-based query languages", pubcountry = "Netherlands", treatment = "B Bibliography; T Theoretical or Mathematical", } @Article{Bidoit:1991:NDU, author = "N. Bidoit and C. Froidevaux", title = "Negation by default and unstratifiable logic programs", journal = j-THEOR-COMP-SCI, volume = "78", number = "1", pages = "85--112", day = "21", month = jan, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4250 (Database theory)", conflocation = "Illiers-Combray, France; 1989", conftitle = "Workshop on Deductive Database Theory", corpsource = "CNRS, LRI, Orsay, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "database theory; deductive databases; default logic; default rules; default semantics; logic programming; logic programs; stratifiable logic programs", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Royer:1991:SID, author = "V. Royer", title = "The semantics of incomplete databases as an expression of preferences", journal = j-THEOR-COMP-SCI, volume = "78", number = "1", pages = "113--136", day = "21", month = jan, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory)", conflocation = "Illiers-Combray, France; 1989", conftitle = "Workshop on Deductive Database Theory", corpsource = "Dept. d'inf., ONERA-CERT, Toulouse, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "database theory; deductive databases; disjunctive databases; incomplete databases; preferences; selection criteria", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Abiteboul:1991:FPD, author = "S. Abiteboul and E. Simon", title = "Fundamental properties of deterministic and nondeterministic extensions of Datalog", journal = j-THEOR-COMP-SCI, volume = "78", number = "1", pages = "137--158", day = "21", month = jan, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory)", conflocation = "Illiers-Combray, France; 1989", conftitle = "Workshop on Deductive Database Theory", corpsource = "INRIA, Le Chesnay, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "database theory; Datalog; deductive databases; deterministic extensions; deterministic semantics; nondeterministic extensions; nondeterministic semantics; query languages", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Abiteboul:1991:RQS, author = "S. Abiteboul and P. Kanellakis and G. Grahne", title = "On the representation and querying of sets of possible worlds", journal = j-THEOR-COMP-SCI, volume = "78", number = "1", pages = "159--187", day = "21", month = jan, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory)", conflocation = "Illiers-Combray, France; 1989", conftitle = "Workshop on Deductive Database Theory", corpsource = "INRIA, Rocquencourt, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Codd-table; containment; data complexity; database theory; incomplete information database; membership; negation; possible worlds; query languages; querying; recursion; representation; uniqueness", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Delahaye:1991:PTV, author = "J. P. Delahaye and V. Thibau", title = "Programming in three-valued logic", journal = j-THEOR-COMP-SCI, volume = "78", number = "1", pages = "189--216", day = "21", month = jan, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4250 (Database theory)", conflocation = "Illiers-Combray, France; 1989", conftitle = "Workshop on Deductive Database Theory", corpsource = "LIFL, Univ. des Sci. et Tech. de Lille Flandres Artois, Villeneuve d'Ascq, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "deductive databases; logic programming; logic programs; negation; obtention; operational semantics; ternary logic; three-valued interpreter; three-valued logic", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Courcelle:1991:RQC, author = "B. Courcelle", title = "Recursive queries and context-free graph grammars", journal = j-THEOR-COMP-SCI, volume = "78", number = "1", pages = "217--244", day = "21", month = jan, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4250 (Database theory)", conflocation = "Illiers-Combray, France; 1989", conftitle = "Workshop on Deductive Database Theory", corpsource = "Lab. d'Inf., CNRS, Bordeaux-I Univ., Talence, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computation graphs; context-free grammars; context-free graph grammars; hyperedges; hypergraphs; recursive query; relational database; relational databases", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Demolombe:1991:ESN, author = "R. Demolombe", title = "An efficient strategy for {non-Horn} deductive databases", journal = j-THEOR-COMP-SCI, volume = "78", number = "1", pages = "245--259", day = "21", month = jan, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory)", conflocation = "Illiers-Combray, France; 1989", conftitle = "Workshop on Deductive Database Theory", corpsource = "ONERA/CERT, Toulouse, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "ALEXANDRE strategy; database theory; Deductive Databases; deductive databases; formal logic; Horn clauses; non-Horn clauses; non-Horn deductive databases; pure logic; SL resolution", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Engelfriet:1991:MTT, author = "J. Engelfriet and H. Vogler", title = "Modular tree transducers", journal = j-THEOR-COMP-SCI, volume = "78", number = "2", pages = "267--303", day = "31", month = jan, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Leiden Univ., Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "modular tree transducer; modules; primitive recursive functions; recursive functions; rewriting systems; term rewriting system; tree transducer; trees (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Downey:1991:CCH, author = "R. Downey", title = "On computational complexity and honest polynomial degrees", journal = j-THEOR-COMP-SCI, volume = "78", number = "2", pages = "305--317", day = "31", month = jan, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Victoria Univ. of Wellington, New Zealand", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; honest polynomial; honest polynomial degrees; polynomial degrees; set theory; tally degrees", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Konig:1991:GFP, author = "R. Konig", title = "Graphs and free partially commutative monoids", journal = j-THEOR-COMP-SCI, volume = "78", number = "2", pages = "319--346", day = "31", month = jan, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Inst. fur Math. Maschinen und Datenverarbeitung I, Erlangen Univ., West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "clique-polynomial; graph theory; graphs; Mobius-function; partially commutative monoids; polynomials; set theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Harju:1991:EPM, author = "T. Harju and J. Karhumaki", title = "The equivalence problem of multitape finite automata", journal = j-THEOR-COMP-SCI, volume = "78", number = "2", pages = "347--355", day = "31", month = jan, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Math., Turku Univ., Finland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "conservative monoids; decidability; decidable; deterministic; equivalence classes; equivalence problem; finite automata; finite test set; multiplicity equivalence; multiplicity equivalence problem; multitape finite automata", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Barrington:1991:NSL, author = "D. A. M. Barrington and J. Corbett", title = "A note on some languages in uniform {ACC$^0$}", journal = j-THEOR-COMP-SCI, volume = "78", number = "2", pages = "357--362", day = "31", month = jan, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4230B (Combinatorial switching theory)", corpsource = "COINS Dept., Massachusetts Univ., Amherst, MA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "ACC; circuit families; combinatorial circuits; computational complexity; constant depth; formal languages; integer vectors; languages; polynomial size; related classes; unbounded fan-in; uniformity definitions", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Baeza-Yates:1991:SS, author = "R. A. Baeza-Yates", title = "Searching subsequences", journal = j-THEOR-COMP-SCI, volume = "78", number = "2", pages = "363--376", day = "31", month = jan, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. de Ciencias de la Comput., Escuela de Ingenieria, Chile Univ., Santiago, Chile", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithm theory; computational complexity; deterministic automata; deterministic partial finite automaton; directed acyclic subsequence graph; finite automata; longest common subsequence problem; multiple strings; search problems; transition function", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Burosch:1991:NDC, author = "G. Burosch and J. Demetrovics and G. O. H. Katona and Kleitman and D. J. and A. A. Sapozhenko", title = "On the number of databases and closure operations", journal = j-THEOR-COMP-SCI, volume = "78", number = "2", pages = "377--381", day = "31", month = jan, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory)", corpsource = "Wilhelm Pieck Univ., Rostock, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "closure operations; database models; database theory; databases; models of databases", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Anselmo:1991:ZZP, author = "M. Anselmo", title = "The zig-zag power series: a two-way version of the * operator", journal = j-THEOR-COMP-SCI, volume = "79", number = "1", pages = "3--24", day = "21", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Lab. d'Inf. Theor. et Programmation, Univ. Paris 7, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; formal languages; series (mathematics); star operator; two-way automata; two-way version; zig-zag power series", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bertoni:1991:RFP, author = "A. Bertoni and D. Bruschi and M. Goldwurm", title = "Ranking and formal power series", journal = j-THEOR-COMP-SCI, volume = "79", number = "1", pages = "25--35", day = "21", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dipartimento di Sci. dell'Inf., Univ. degli Studi di Milano, Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic formal power series; automata theory; context-free languages; integer division; log-space uniform boolean circuits; NC/sup 1/-reducible; noncommuting variables; P-uniform boolean circuits; polynomial size; ranking problem; regular languages; series (mathematics); unambiguous context-free languages; value problem", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Flajolet:1991:AAC, author = "P. Flajolet and B. Salvy and P. Zimmermann", title = "Automatic average-case analysis of algorithms", journal = j-THEOR-COMP-SCI, volume = "79", number = "1", pages = "37--109", day = "21", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "INRIA Rocquencourt, Le Chesnay, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "associated asymptotic theory; asymptotic estimations; automata theory; automatic average case analysis of algorithms; average-case complexity; combinatorial mathematics; complex analysis techniques; computational complexity; computer algebra; counting; decidability; decidable; elementary discrete combinatorial structures; exact analysis; generating function techniques; Lambda-Upsilon-Omega; probabilistic properties; symbol manipulation", pubcountry = "Netherlands", treatment = "B Bibliography; T Theoretical or Mathematical", } @Article{Krob:1991:SEF, author = "D. Krob", title = "Some examples of formal series used in non-commutative algebra", journal = j-THEOR-COMP-SCI, volume = "79", number = "1", pages = "111--135", day = "21", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6130 (Data handling techniques)", corpsource = "Lab. d'Inf. de Rouen, Rouen Univ., Mont Saint-Aignan, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; formal pseudodifferential operators; formal series; generalization; Hankel-like results; Malcev series; noncommutative algebra; series (mathematics); skew formal series; symbol manipulation", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Kuich:1991:ALG, author = "W. Kuich", title = "Automata and languages generalized to omega-continuous semirings", journal = j-THEOR-COMP-SCI, volume = "79", number = "1", pages = "137--150", day = "21", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Inst. fur Algebra und Diskrete Math., Tech. Univ. Wien, Austria", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata-theoretic results; context-free languages; finite automata; finite languages; Kleene's Theorem; languages; omega-continuous semirings; product; pushdown automata; star; union", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hespel:1991:AND, author = "C. Hespel and G. Jacob", title = "Approximation of nonlinear dynamic systems by rational series", journal = j-THEOR-COMP-SCI, volume = "79", number = "1", pages = "151--162", day = "21", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4130 (Interpolation and function approximation); C4210 (Formal logic); C4220 (Automata theory)", corpsource = "INSA, Rennes, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "approximation theory; automata theory; bilinear system; bilinear system of minimal dimension; digital encoding; generating series; Hankel matrices; linear algebra; noncommutative series computation; nonlinear dynamic systems approximation; R-automaton; rational series; series (mathematics); shortest successful path; Taylor expansion; truncated automaton", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Minh:1991:ET, author = "V. Hoang Ngoc Minh", title = "Evaluation transform", journal = j-THEOR-COMP-SCI, volume = "79", number = "1", pages = "163--177", day = "21", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1130 (Integral transforms); C6130 (Data handling techniques)C1340K (Nonlinear systems)", corpsource = "Lille I Univ., Villeneuve d'Ascq, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Cauchy products; convolutions of signals; correspondence theorem; evaluation transform; generating power series; input functions; inverse Laplace transform; Laplace transforms; noncommuting variables; nonlinear control system; nonlinear control systems; output function; power series; primitives; series (mathematics); symbol manipulation; symbolic calculus; symbolic description; temporal behaviour", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Leroux:1991:CAN, author = "P. Leroux and X. G. Viennot", title = "A combinatorial approach to nonlinear functional expansions: an introduction with an example", journal = j-THEOR-COMP-SCI, volume = "79", number = "1", pages = "179--193", day = "21", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); B0290P (Differential equations); C1160 (Combinatorial mathematics); C4170 (Differential equations)", corpsource = "Dept. de Math. et Inf., Quebec Univ., Montreal, Que., Canada", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic approach; causal functionals; combinatorial approach; combinatorial interpretations; combinatorial mathematics; forcing terms; formal power series; histories; noncommutative variables; nonlinear differential equations; nonlinear functional expansions; series (mathematics); Volterra kernels; weighted increasing trees; weighted paths", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Oussous:1991:CMM, author = "N. E. Oussous", title = "Computation, on {Macsyma}, of the Minimal Differential Representation of Noncommutative Polynomials", journal = j-THEOR-COMP-SCI, volume = "79", number = "1", pages = "195--207", day = "21", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib; UnCover library database", acknowledgement = ack-nhfb, affiliation = "C.N.R.S.", affiliationaddress = "Villeneuve d'Ascq, France", classification = "723; 921; C4130 (Interpolation and function approximation); C6130 (Data handling techniques); C7310 (Mathematics)", corpsource = "Lab. d'Inf. Fondamentale de Lille, Lille I Univ., Villeneuve d'Ascq, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", journalabr = "Theor Comput Sci Part B Logic Semantics Theory Program", keywords = "Algebraic computation language; algebraic computation language; Computer Programming --- Algorithms; finite alphabet; Finite alphabet; finite generating power series; Finite generating power series; Local minimal realization; local minimal realization; Macsyma; Macsyma Symbolic Language; Manipulation of words; manipulation of words; Mathematical Techniques; mathematics computing; minimal differential representation; Minimal differential representation; Minimal Differential Representation; noncommutative polynomials; Noncommutative Polynomials; Noncommutative polynomials; Noncommutative power series; noncommutative power series; polynomials; Polynomials; Power Series; series (mathematics); symbol manipulation", pubcountry = "Netherlands", thesaurus = "Mathematics computing; Polynomials; Series [mathematics]; Symbol manipulation", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Delest:1991:EPU, author = "M. Delest", title = "Enumeration of Polyominoes Using {Macsyma}", journal = j-THEOR-COMP-SCI, volume = "79", number = "1", pages = "209--226", day = "21", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "Compendex database; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib; UnCover library database", acknowledgement = ack-nhfb, affiliation = "Cent Natl de la Recherche Scientifique", affiliationaddress = "Talence, France", classification = "723; 921; C1160 (Combinatorial mathematics); C7310 (Mathematics)", corpsource = "Lab. Bordelais de Recherche en Inf., CNRS, Talence, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", journalabr = "Theor Comput Sci Part B Logic Semantics Theory Program", keywords = "Combinatorial Mathematics; combinatorial mathematics; Combinatorics; combinatorics; Computer Programming --- Algorithms; Computer Programming Languages; Enumerative combinatorics; enumerative combinatorics; Macsyma; Macsyma Symbolic Language; Mathematical Techniques; mathematics computing; polyominoes objects; Polyominoes objects; Polyominos; Power Series; Symbolic language; symbolic language", pubcountry = "Netherlands", thesaurus = "Combinatorial mathematics; Mathematics computing", treatment = "P Practical", } @Article{Duchamp:1991:OPF, author = "G. Duchamp", title = "Orthogonal projection onto the free {Lie} algebra", journal = j-THEOR-COMP-SCI, volume = "79", number = "1", pages = "227--239", day = "21", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation)", corpsource = "Rouen Univ., Mont Saint Aignan, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "free associative algebra; free Lie algebra; Lie algebras; normal form; orthogonal projection; polynomials; universal formula", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Koseleff:1991:WGF, author = "P.-V. Koseleff", title = "Word games in free {Lie} algebras: several bases and formulas", journal = j-THEOR-COMP-SCI, volume = "79", number = "1", pages = "241--256", day = "21", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", abstract = "The author compares the efficiency of many methods which allow calculations in Lie algebras. Many construction methods exist for the base of free Lie algebras developed from finite sets. They use two algorithms for calculation of several Campbell-Hausdorf formulas. Diverse implementations are realised in LISP on Scratchpad II.", acknowledgement = ack-nhfb, affiliation = "IBM, Paris, France", classification = "C6130 (Data handling techniques); C7310 (Mathematics)", corpsource = "IBM, Paris, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Bases; bases; Campbell-Hausdorf formulas; finite sets; Finite sets; free Lie algebras; Free Lie algebras; LISP; mathematics computing; Scratchpad II; symbol manipulation", language = "English", pubcountry = "Netherlands", thesaurus = "Mathematics computing; Symbol manipulation", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Rotella:1991:SPG, author = "F. Rotella", title = "Shuffle product of generating series", journal = j-THEOR-COMP-SCI, volume = "79", number = "1", pages = "257--261", day = "21", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0290H (Linear algebra); C4140 (Linear algebra)", corpsource = "Inst. Ind. du Nord, Villeneuve d'Ascq, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "explicit construction; generating series; linear algebra; linear matrix algebra; noncommutative formal power series; recurrent construction; series (mathematics); shuffle product", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Honkala:1991:AGZ, author = "J. Honkala", title = "On algebraic generalized zeta functions of formal power series", journal = j-THEOR-COMP-SCI, volume = "79", number = "1", pages = "263--273", day = "21", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math., Turku Univ., Finland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic generalized zeta functions; decidability; decidable; formal languages; formal power series; series (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Vaandrager:1991:DES, author = "F. W. Vaandrager", title = "Determinism to (event structure isomorphism=step sequence equivalence)", journal = j-THEOR-COMP-SCI, volume = "79", number = "2", pages = "275--294", day = "27", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Centre for Math. and Comput. Sci., Amsterdam, Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bisimulation; concurrent system; data structures; deterministic; event structure isomorphism; failure; interleaved equivalences; programming theory; step sequence equivalence; termination of events; trace-equivalence", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Holden:1991:WLT, author = "M. Holden", title = "Weak logic theory", journal = j-THEOR-COMP-SCI, volume = "79", number = "2", pages = "295--321", day = "27", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Inf., Oslo Univ., Norway", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "completeness theorem; cut elimination theorem; first order logic; formal logic; interpolation theorems; partial logic; program verification; resolution principle; sequent calculus; system specification; weak logic theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Jaoua:1991:RRM, author = "A. Jaoua and A. Mili and N. Boudriga and J. L. Durieux", title = "Regularity of relations: a measure of uniformity", journal = j-THEOR-COMP-SCI, volume = "79", number = "2", pages = "323--339", day = "27", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110B (Software engineering techniques)", corpsource = "Dept. of Inf., Tunis Univ., Tunisia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "binary relations; fault tolerant computing; formal specification; measure of uniformity; program construction; program exception handling; program fault tolerance; program specifications; program verification; regularity", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Szalas:1991:SAC, author = "A. Szalas", title = "On strictly arithmetical completeness in logics of programs", journal = j-THEOR-COMP-SCI, volume = "79", number = "2", pages = "341--355", day = "27", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithmic logic; dynamic logic; formal logic; logics of programs; metalanguage; model-theoretic semantics; programming theory; strictly arithmetical axiomatizations; strictly arithmetical completeness; temporal logic", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Stoughton:1991:IPO, author = "A. Stoughton", title = "Interdefinability of parallel operations in {PCF}", journal = j-THEOR-COMP-SCI, volume = "79", number = "2", pages = "357--358", day = "27", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C6140 (Programming languages)", corpsource = "Sch. of Cognitive and Comput. Sci., Sussex Univ., Brighton, UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "continuous function model; interdefinable elements; parallel conditional operations; parallel operations; programming language PCF; programming languages", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Jung:1991:DPC, author = "A. Jung", title = "The dependent product construction in various categories of domains", journal = j-THEOR-COMP-SCI, volume = "79", number = "2", pages = "359--363", day = "27", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Fachbereich Math., Tech. Hochschule, Darmstadt, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic L-domains; bifinite domains; categories; dependent product construction; domain theoretic models; domains; formal logic; Grothendieck fibration; polymorphic lambda calculus; polymorphism; Scott domains", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Koletsos:1991:PLC, author = "G. Koletsos", title = "Polymorphic lambda calculus: the {Church--Rosser} property", journal = j-THEOR-COMP-SCI, volume = "79", number = "2", pages = "365--371", day = "27", month = feb, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math., Nat. Tech. Univ., Athens, Greece", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Church--Rosser property; formal logic; normalizability; polymorphic lambda calculus", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Reisig:1991:PNA, author = "W. Reisig", title = "{Petri} nets and algebraic specifications", journal = j-THEOR-COMP-SCI, volume = "80", number = "1", pages = "1--34", day = "21", month = mar, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C6110B (Software engineering techniques)", corpsource = "Inst. fur Inf., Tech. Univ. Munchen, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic specifications; formal specification; modelling power; Petri nets; structured tokens; term substitution", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Gecseg:1991:PA, author = "F. Gecseg and H. Jurgensen", title = "On $\alpha_0$-$\nu_1$-products of automata", journal = j-THEOR-COMP-SCI, volume = "80", number = "1", pages = "35--51", day = "21", month = mar, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Jozsef Attila Tudomanyegyetem Bolyai Intezete, Szeged, Hungary", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "alpha /sub 0/- nu /sub 1/-products; automata; automata theory; homomorphic representation power", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Heilbrunner:1991:ERB, author = "S. Heilbrunner and L. Schmitz", title = "An efficient recognizer for the {Boolean} closure of context-free languages", journal = j-THEOR-COMP-SCI, volume = "80", number = "1", pages = "53--75", day = "21", month = mar, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Univ.-GH-Duisburg, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; Boolean closure; Boolean functions; context-free languages; Earley's recognition algorithm; Graham-Harrison-Ruzzo version; hci-grammars; recognizer", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Howell:1991:GLV, author = "R. R. Howell and L. E. Rosier and Hsu-Chun Yen", title = "Global and local views of state fairness", journal = j-THEOR-COMP-SCI, volume = "80", number = "1", pages = "77--104", day = "21", month = mar, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., Kansas State Univ., Manhattan, KS, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Boolean functions; complexity; computational complexity; concurrent Boolean programs; concurrent programs; decidability; EXPTIME-complete; fair nontermination problem; global views; local views; parallel programming; Petri nets; PSPACE-complete; state fairness", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Powell:1991:COV, author = "P. Powell and Viet Ngo", title = "Complexity of optimal vector code generation", journal = j-THEOR-COMP-SCI, volume = "80", number = "1", pages = "105--115", day = "21", month = mar, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6150C (Compilers, interpreters and other processors)", corpsource = "Minnesota Univ., Minneapolis, MN, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "chimes; computational complexity; heuristic approaches; multiple functional units; optimal vector code generation; optimizing compiler; program compilers; runtime performance; scalar code", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Hofer:1991:ESG, author = "G. Hofer", title = "Experiments and stability in group automata", journal = j-THEOR-COMP-SCI, volume = "80", number = "1", pages = "117--120", day = "21", month = mar, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Math., Linz Univ., Austria", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract deterministic automata; automata theory; group automata; identifier experiments; stability", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Andreka:1991:STP, author = "H. Andreka and I. Nemeti and I. Sain", title = "On the strength of temporal proofs", journal = j-THEOR-COMP-SCI, volume = "80", number = "2", pages = "125--151", day = "29", month = mar, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); 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 = "proof theoretic powers; provability; reasoning powers; temporal formulas; temporal logic; temporal logics; temporal proofs; theorem proving", pubcountry = "Netherlands", treatment = "B Bibliography; T Theoretical or Mathematical", } @Article{Courcelle:1991:MSO, author = "B. Courcelle", title = "The monadic second-order logic of graphs. {V}. On closing the gap between definability and recognizability", journal = j-THEOR-COMP-SCI, volume = "80", number = "2", pages = "153--202", day = "29", month = mar, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Lab. d'Inf., CNRS, Bordeaux-1 Univ., Talence, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "context-free grammars; definability; derivation tree; formal logic; graph theory; graphs; labels; monadic second-order logic; nodes; recognizability", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hemachandra:1991:SPE, author = "L. A. Hemachandra and A. Hoene and D. Siefkes and P. Young", title = "On sets polynomially enumerable by iteration", journal = j-THEOR-COMP-SCI, volume = "80", number = "2", pages = "203--225", day = "29", month = mar, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Rochester Univ., NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complex sets; computability; computational complexity; exponential-time complete sets; NP-complete sets; polynomial time hierarchy; polynomially enumerable by iteration; set theory; Turing machine; Turing machines", pubcountry = "Netherlands", treatment = "B Bibliography; T Theoretical or Mathematical", } @Article{Iwanowski:1991:TAS, author = "S. Iwanowski", title = "Testing approximate symmetry in the plane is {NP}-hard", journal = j-THEOR-COMP-SCI, volume = "80", number = "2", pages = "227--262", day = "29", month = mar, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Freie Univ., Fachbereich Math., Berlin, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "approximate congruence; approximate symmetry; computational complexity; decidability; decision problem; Euclidean plane; fixed tolerance factor; group theory; in-neighborhoods; NP-hard; polynomial algorithms; symmetry group", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Olderog:1991:CCP, author = "E.-R. Olderog", title = "Correctness of concurrent processes", journal = j-THEOR-COMP-SCI, volume = "80", number = "2", pages = "263--288", day = "29", month = mar, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "FB Inf., Oldenburg Univ., Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "CCS; concurrent processes; correctness; COSY; CSP; failure equivalence; finite communication sequences; formal logic; liveness property; logical formulas; P sat S; parallel programming; Petri net semantics; process terms; program verification; programming theory; readiness equivalence; readiness semantics; semantic equality; strong testing equivalence", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Ranjan:1991:SBC, author = "D. Ranjan and R. Chang and J. Hartmanis", title = "Space bounded computations: review and new separation results", journal = j-THEOR-COMP-SCI, volume = "80", number = "2", pages = "289--302", day = "29", month = mar, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); 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 = "computation model; computational complexity; proof techniques; separation results; space bounded complexity classes; space constructibility; Turing machine model; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Steffen:1991:FCC, author = "B. Steffen and J. Knoop", title = "Finite constants: characterizations of a new decidable set of constants", journal = j-THEOR-COMP-SCI, volume = "80", number = "2", pages = "303--318", day = "29", month = mar, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory); C6150C (Compilers, interpreters and other processors)", corpsource = "Lab. for Found. of Comput. Sci., Edinburgh, Univ., UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "compiler; completeness; constant propagation; constants; decidability; decidable set; finite constant; program compilers; program optimization method; program terms; programming theory; rewriting systems; term rewriting", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Szczepanska:1991:HLV, author = "D. Szczepanska", title = "A {Hoare}-like verification system for a language with an exception handling mechanism", journal = j-THEOR-COMP-SCI, volume = "80", number = "2", pages = "319--335", day = "29", month = mar, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6130 (Data handling techniques); C6140D (High level languages); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational linguistics; copy rule; correctness proof; error handling; exception handling mechanism; handler responses; high level languages; Hoare-like verification system; program verification; recursive procedures; resumption; robust programs; semantics; termination; typical statements", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Wiedermann:1991:CES, author = "J. Wiedermann", title = "On the computational efficiency of symmetric neural networks", journal = j-THEOR-COMP-SCI, volume = "80", number = "2", pages = "337--345", day = "29", month = mar, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4240 (Programming and algorithm theory)", corpsource = "VUSEI-AR, Bratislava, Czechoslovakia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexity theory; computational complexity; computational efficiency; computational power; neural nets; recursive function; symmetric neural networks; symmetric weights", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Fulop:1991:CCD, author = "Z. Fulop and S. Vagvolgyi", title = "A complete classification of deterministic root-to-frontier tree transformation classes", journal = j-THEOR-COMP-SCI, volume = "81", number = "1", pages = "1--15", day = "22", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4220 (Automata theory)", corpsource = "Hungarian Acad. of Sci., Szeged, Hungary", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complete classification; deterministic automata; deterministic root-to-frontier tree transformation classes; trees (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Boe:1991:BAT, author = "J.-M. Boe", title = "The boxes (automata theory)", journal = j-THEOR-COMP-SCI, volume = "81", number = "1", pages = "17--34", day = "22", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Centre de Recherche en Inf. de Montpellier, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic structure; automata; automata theory; combinational object; monoid", language = "French", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Tang:1991:PTR, author = "Shouwen Tang and R. V. Book", title = "Polynomial-time reducibilities and `almost all' oracle sets", journal = j-THEOR-COMP-SCI, volume = "81", number = "1", pages = "35--47", day = "22", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Theor. Comput. Sci., Beijing Comput. Inst., China", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; oracle sets; polynomial-time reducibilities", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Dubois:1991:CNS, author = "O. Dubois", title = "Counting the number of solutions for instances of satisfiability", journal = j-THEOR-COMP-SCI, volume = "81", number = "1", pages = "49--64", day = "22", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "LAFORIA, CNRS, Paris VI Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; enumeration problem; instances; NP-complete problems; number of solutions; satisfiability problem", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Dubois:1991:PAS, author = "O. Dubois and J. Carlier", title = "Probabilistic approach to the satisfiability problem", journal = j-THEOR-COMP-SCI, volume = "81", number = "1", pages = "65--75", day = "22", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "LAFORIA, CRNS, Paris VI Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; exponential time complexity; mathematical expectation; NP-complete problems; polynomial time complexity; probabilistic approach; satisfiability problem", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Piotrow:1991:CCP, author = "M. Piotrow", title = "On the complexity of counting in the polynomial hierarchy", journal = j-THEOR-COMP-SCI, volume = "81", number = "1", pages = "77--95", day = "22", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4130 (Interpolation and function approximation); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Comput. Sci., Wroclaw Univ., Poland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexity of counting; computational complexity; oracle alternating Turing machines; polynomial hierarchy; polynomials; time complexity; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Amir:1991:FPS, author = "A. Amir and G. M. Landau", title = "Fast parallel and serial multidimensional approximate array matching", journal = j-THEOR-COMP-SCI, volume = "81", number = "1", pages = "97--115", day = "22", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "alternate algorithm; computational complexity; d-dimensional array; multidimensional approximate array matching; parallel algorithm; parallel algorithms; serial algorithm; superfluous pattern character; superfluous text character", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Matus:1991:AFD, author = "F. Matus", title = "Abstract functional dependency structures", journal = j-THEOR-COMP-SCI, volume = "81", number = "1", pages = "117--126", day = "22", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory)", corpsource = "Inst. of Inf. Theory Autom., Czechoslovak Acad. of Sci., Prague, Czechoslovakia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract functional dependency structures; Boolean; closure systems; database relationships theory; database theory; functions; Galois connection; matroid theory; random variable", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Lutz:1991:UMS, author = "J. H. Lutz", title = "An upward measure separation theorem", journal = j-THEOR-COMP-SCI, volume = "81", number = "1", pages = "127--135", day = "22", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; ESPACE; language; upward measure separation theorem", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Leung:1991:LTF, author = "H. Leung", title = "Limitedness theorem on finite automata with distance functions: an algebraic proof", journal = j-THEOR-COMP-SCI, volume = "81", number = "1", pages = "137--145", day = "22", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., New Mexico State Univ., Las Curces, NM, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic proof; computational complexity; decidability; decidable; decision problem; distance functions; exponential-time decision algorithm; finite automata; nonnegative integer value; PSPACE-hard", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Cori:1991:NPA, author = "R. Cori and M. R. Formisano", title = "On the number of partially {Abelian} square-free words on a three-letter alphabet", journal = j-THEOR-COMP-SCI, volume = "81", number = "1", pages = "147--153", day = "22", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "LaBRI, Bordeaux Univ., Talence, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "combinatorial aspect; combinatorial mathematics; commutation relations; concurrent computations; formal model; number of partially abelian square-free words; polynomial; programming theory; three-letter alphabet", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hartmanis:1991:OWF, author = "J. Hartmanis", title = "One-way functions and the nonisomorphism of {NP-complete} sets", journal = j-THEOR-COMP-SCI, volume = "81", number = "1", pages = "155--163", day = "22", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "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 = "computational complexity; nonisomorphism; NP-complete sets; one-way conjecture; one-way functions; relativized counterexample", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Kapur:1991:SU, author = "D. Kapur and D. Musser and P. Narendran and J. Stillman", title = "Semi-unification", journal = j-THEOR-COMP-SCI, volume = "81", number = "2", pages = "169--187", day = "30", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", 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 = "canonical term-rewriting system; computational complexity; decision procedure; exponential computing time; Knuth--Bendix completion procedure; matching; polynomial-time algorithm; rewrite rule nontermination; rewriting systems; semi-unification; substitutions", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Khadilkar:1991:PCS, author = "S. N. Khadilkar and S. Biswas", title = "Padding, commitment and self-reducibility", journal = j-THEOR-COMP-SCI, volume = "81", number = "2", pages = "189--199", day = "30", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Eng., I.I.T., Kanpur, India", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "co-sparse sets; commitability; commitment; computational complexity; d-self-reducibility; formal languages; kernel constructibility; language; many-one reductions; NP sets; p-selective sets; paddability; padding; polynomial time; search problems; set theory; string; tree search method; trees (mathematics); witness prefix", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Pingali:1991:ANL, author = "K. Pingali and K. Ekanadham", title = "Accumulators: new logic variable abstractions for functional languages", journal = j-THEOR-COMP-SCI, volume = "81", number = "2", pages = "201--221", day = "30", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory); C6140D (High level languages)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "accumulators; declarative languages; formal languages; functional languages; functional programming; high level languages; logic programming; logic variable abstractions; natural sciences computing; parallel programming; parallelism; programming theory; scientific applications; storage efficiency; storage management", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bhatta:1991:RRW, author = "K. S. H. S. R. Bhatta and H. Karnick", title = "A resolution rule for well-formed formulae", journal = j-THEOR-COMP-SCI, volume = "81", number = "2", pages = "223--235", day = "30", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of Technol., Kanpur, India", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "completeness; inference mechanisms; inference rule; Q-unification; quantifiers in place; resolution proof procedure; resolution rule; soundness; theorem proving; unification algorithm; well-formed formulae; WFF-resolution", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bodlaender:1991:NLB, author = "H. L. Bodlaender", title = "New lower bound techniques for distributed leader finding and other problems on rings of processors", journal = j-THEOR-COMP-SCI, volume = "81", number = "2", pages = "237--256", day = "30", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4230 (Switching theory); C5440 (Multiprocessor systems and techniques)", corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "AND computation; asynchronous nonanonymous processor rings; deterministic extreme finding; distributed leader finding; distributed processing; extremal graph theory; graph theory; lower bounds; message complexity; multiprocessing systems; OR computation; randomized extrema finding; ring size; switching theory; unique identities; XOR computation", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Lenz:1991:CCQ, author = "K. Lenz and I. Wegener", title = "The conjunctive complexity of quadratic {Boolean} functions", journal = j-THEOR-COMP-SCI, volume = "81", number = "2", pages = "257--268", day = "30", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4230 (Switching theory); C4240 (Programming and algorithm theory)", corpsource = "Lehrstuhl fur Theor. Inf. II, Dortmund Univ., Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "almost optimal circuits; Boolean functions; computational complexity; conjunctive complexity; disjunctions; monotone circuits; NP-complete computation; polynomial time; quadratic Boolean functions; quadratic monomials; single level complexity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Asveld:1991:AGB, author = "P. R. J. Asveld", title = "Abstract grammars based on transductions", journal = j-THEOR-COMP-SCI, volume = "81", number = "2", pages = "269--288", day = "30", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Twente Univ. of Technol., Enschede, Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract grammatical model; complexity properties; computational complexity; control languages; decidability; formal languages; Gamma-controlled T-grammars; generating power; grammars; iteration; iterative methods; production; transductions", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Dassow:1991:CPC, author = "J. Dassow", title = "On the connectedness of pictures in chain code picture languages", journal = j-THEOR-COMP-SCI, volume = "81", number = "2", pages = "289--294", day = "30", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Math., Magdeburg Univ. of Technol., Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "alphabet; chain code picture languages; computational geometry; decidability; formal languages; grammars; graph theory; linear grammars; picture connectedness; plotter commands; plotters; stripe languages; unit lines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Cheung:1991:RDT, author = "To-Yat Cheung and Yunzhou Zhu", title = "Recognizing different types of beta-cycles in a database scheme", journal = j-THEOR-COMP-SCI, volume = "81", number = "2", pages = "295--304", day = "30", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory)", corpsource = "Dept. of Comput. Sci., Ottawa Univ., Ont., Canada", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithm complexity; attributes; beta-acyclic scheme; beta-cycles; beta-triangles; database scheme; database theory; nonempty pairwise intersections; relation schemes; transformation process", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Csuhaj-Varju:1991:PCR, author = "E. Csuhaj-Varju and J. Kelemen", title = "On the power of cooperation: a regular representation of recursively enumerable languages", journal = j-THEOR-COMP-SCI, volume = "81", number = "2", pages = "305--310", day = "30", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Comput. and Autom. Inst., Hungarian Acad. of Sci., Budapest, Hungary", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "cooperating conditional regular grammars; cooperating rule based knowledge sources; formal languages; grammars; knowledge based systems; production; recursive functions; recursively enumerable languages; sentential form; word occurrence checking", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Chytil:1991:PRU, author = "M. Chytil and M. Crochemore and B. Monien and W. Rytter", title = "On the parallel recognition of unambiguous context-free languages", journal = j-THEOR-COMP-SCI, volume = "81", number = "2", pages = "311--316", day = "30", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); 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; context-free languages; CREW PRAM; deterministic context-free languages; language recognition; parallel algorithm; parallel algorithms; polylogarithmic time; processor number; unambiguous context-free languages", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Megiddo:1991:TFE, author = "N. Megiddo and C. H. Papadimitriou", title = "On total functions, existence theorems and computational complexity", journal = j-THEOR-COMP-SCI, volume = "81", number = "2", pages = "317--324", day = "30", month = apr, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "IBM Almaden Res. Center, San Jose, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bimatrix equilibria; Brouwer's fixed points; computational complexity; existence theorems; factoring; functions; games; linear complementarity; local optimization; nondeterministic multivalued functions; P-matrices; polynomially verifiable functions; Sperner's lemma; TFNP complexity class; total functions", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Weihrauch:1991:TCC, author = "K. Weihrauch and C. Kreitz", title = "Type $2$ computational complexity of functions on {Cantor}'s space", journal = j-THEOR-COMP-SCI, volume = "82", number = "1", pages = "1--18", day = "22", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Fachbereich Math. und Inf., Fernuniv. Hagen, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Cantor space; compact sets; computability; computational complexity; continuity; dependence; input-lookahead; optimization; oracle machines; resource bounded functions; Type 2 computational complexity; Type 2 theory of effectivity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Lando:1991:PUP, author = "B. Lando", title = "Periodicity and ultimate periodicity of {D0L} systems", journal = j-THEOR-COMP-SCI, volume = "82", number = "1", pages = "19--33", day = "22", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math. Sci., Alaska Univ., Fairbanks, AK, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bounds; D0L systems; decidability; decidable; decision procedure; formal languages; index; morphisms; period; periodic systems; regular language; ultimate periodicity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hebrard:1991:ADE, author = "J.-J. Hebrard", title = "An algorithm for distinguishing efficiently bit-strings by their subsequences", journal = j-THEOR-COMP-SCI, volume = "82", number = "1", pages = "35--49", day = "22", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "LIUC, Caen Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithm theory; bit-strings; linear on-line algorithm; shortest subsequence; string factorization", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Ko:1991:AVN, author = "K.-I. Ko", title = "On adaptive versus nonadaptive bounded query machines", journal = j-THEOR-COMP-SCI, volume = "82", number = "1", pages = "51--69", day = "22", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; machines; nonadaptive bounded query machines; polynomial time adaptive bounded query machines; sparse oracles; truth table bounded query; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Mignosi:1991:NFS, author = "F. Mignosi", title = "On the number of factors of {Sturmian} words", journal = j-THEOR-COMP-SCI, volume = "82", number = "1", pages = "71--84", day = "22", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dipartimento di Matematica ed Applicazioni, Palermo Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "combinatorial Riemann hypothesis; Euler function; factors; formal languages; language; Sturmian words", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Snir:1991:SDT, author = "M. Snir", title = "Size-depth trade-offs for monotone arithmetic circuits", journal = j-THEOR-COMP-SCI, volume = "82", number = "1", pages = "85--93", day = "22", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4140 (Linear algebra); 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 = "computational complexity; linear recurrences; matrices; matrix algebra; monotone arithmetic circuits; size depth trade offs", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Engelfriet:1991:NSG, author = "J. Engelfriet and G. Leih and G. Rozenberg", title = "Nonterminal separation in graph grammars", journal = j-THEOR-COMP-SCI, volume = "82", number = "1", pages = "95--111", day = "22", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Leiden Univ., Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "apex eNCE graph grammar; apex eNCE graph language; formal languages; grammars; graph theory; nonterminal nodes; nonterminal separation; sentential forms", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Dietzfelbinger:1991:CMT, author = "M. Dietzfelbinger and W. Maass and G. Schnitger", title = "The complexity of matrix transposition on one-tape off-line {Turing} machines", journal = j-THEOR-COMP-SCI, volume = "82", number = "1", pages = "113--129", day = "22", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4140 (Linear algebra); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Fachbereich Math./Inf., Univ. GH-Paderborn, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bit length; Boolean matrices; complexity; computational complexity; lower bound argument; matrix algebra; matrix transposition; nonlinear lower bound; one-tape off-line Turing machines; optimal lower bound; sorting; Turing machines; two-way input tape; upper bound; worktape", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Salomaa:1991:DSE, author = "K. Salomaa and S. Yu", title = "Decidability of structural equivalence of {E0L} grammars", journal = j-THEOR-COMP-SCI, volume = "82", number = "1", pages = "131--139", day = "22", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. of Math., Turku Univ., Finland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; decidability; E0L grammars; equivalence problem; formal languages; grammars; height-counting tree automata; structural equivalence; syntax trees", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Robson:1991:LRR, author = "J. M. Robson", title = "An {O}({T} log {T}) reduction from {RAM} computations to satisfiability", journal = j-THEOR-COMP-SCI, volume = "82", number = "1", pages = "141--149", day = "22", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept of Comput. Sci., Australian Nat. Univ., Canberra, ACT, Australia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "accepting computation; Boolean algebra; Boolean expression; computational complexity; nondeterministic Turing machine; RAM computations; random access machines; satisfiability; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Calude:1991:DSS, author = "C. Calude and G. Istrate", title = "Determining and stationary sets for some classes of partial recursive functions", journal = j-THEOR-COMP-SCI, volume = "82", number = "1", pages = "151--155", day = "22", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math., Bucharest Univ., Romania", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "determining sets; Post simple sets; primitive recursive functions; real functions; recursive functions; stationary sets; unary partial recursive functions", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Palko:1991:ACM, author = "V. Palko and O. Sykora and I. Vrto", title = "Area complexity of merging", journal = j-THEOR-COMP-SCI, volume = "82", number = "1", pages = "157--163", day = "22", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B2570 (Semiconductor integrated circuits); C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Inst. of Tech. Cybern., Slovak Acad. of Sci., Bratislava, Czechoslovakia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "area complexity; area-time squared tradeoff; complexity measures; computational complexity; l-selection; merging; optimal algorithms; optimal lower bounds; ordering; sorting; VLSI; VLSI complexity; VLSI sorting algorithms", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Leo:1991:GCF, author = "J. M. I. M. Leo", title = "A general context-free parsing algorithm running in linear time on every {LR(k)} grammar without using lookahead", journal = j-THEOR-COMP-SCI, volume = "82", number = "1", pages = "165--176", day = "22", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Nijmegen Univ., Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; context-free grammars; context-free parsing algorithm; linear space; linear time; LR(k) grammar; right recursive grammars; space complexity; tabular parsing algorithms; time complexity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bauderon:1991:IHB, author = "M. Bauderon", title = "Infinite hypergraphs. {I}. Basic properties", journal = j-THEOR-COMP-SCI, volume = "82", number = "2", pages = "177--214", day = "31", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Lab. Bordelais de Recherche en Inf., Bordeaux Univ., Talence, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "directed graphs; directed hypergraphs; graph theory; hyperedge-labelled; hypergraph; infinite; recursive equations; recursive functions; rewriting system; rewriting systems", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Germano:1991:CFG, author = "G. M. Germano and S. Mazzanti", title = "Closure functions and general iterates as reflectors", journal = j-THEOR-COMP-SCI, volume = "82", number = "2", pages = "215--252", day = "31", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic structure; closure functions; constructive mathematics; general iterates; inclusion functor; iterative methods; programming theory; reflectors; semantics; while-do statements", pubcountry = "Netherlands", treatment = "B Bibliography; T Theoretical or Mathematical", } @Article{Abadi:1991:ERM, author = "M. Abadi and L. Lamport", title = "The existence of refinement mappings", journal = j-THEOR-COMP-SCI, volume = "82", number = "2", pages = "253--284", day = "31", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Digital Equipment Corp., Palo Alto, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; liveness requirements; lower-level specification; programming theory; refinement mappings; state machine", pubcountry = "Netherlands", } @Article{Baeten:1991:RPD, author = "J. C. M. Baeten and J. A. Bergtstra", title = "Recursive process definitions with the state operator", journal = j-THEOR-COMP-SCI, volume = "82", number = "2", pages = "285--302", day = "31", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Software Technol. Centre for Math. and Comput. Sci., Amsterdam, Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "finite recursive specifications; PA-processes; programming theory; recursive functions; recursive process definitions; state operator", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Lukassen:1991:FFI, author = "A. Lukassen and G. Vossen", title = "A formal framework for independence with respect to transactions in the universal relation model", journal = j-THEOR-COMP-SCI, volume = "82", number = "2", pages = "303--327", day = "31", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory)", corpsource = "Deutsche Vermogungsberatung AG DVAG, Frankfurt, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "database theory; database transactions; formal framework; independence; relational database scheme; relational databases; relational model; schema regions; tableau-based method; transaction semantics; universal relation model", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Szwast:1991:HS, author = "W. Szwast", title = "On {Horn} spectra", journal = j-THEOR-COMP-SCI, volume = "82", number = "2", pages = "329--339", day = "31", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Inst. of Math., Pedagogical Univ., Opole, Poland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Asser's problem; EXPTIME=?NEXPTIME question; formal languages; generator problem; Horn spectrum; oracles", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Howell:1991:TFT, author = "R. R. Howell and L. E. Rosier and Hsu-Chun Yen", title = "A taxonomy of fairness and temporal logic problems for {Petri} nets", journal = j-THEOR-COMP-SCI, volume = "82", number = "2", pages = "341--372", day = "31", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., Kansas State Univ., Manhattan, KS, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "checking problem; computational complexity; Petri nets; PTIME equivalent; reachability; reasoning; temporal logic", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Denis:1991:TAS, author = "F. Denis and J.-P. Delahaye", title = "Is there an axiomatic semantics for standard pure Prolog?", journal = j-THEOR-COMP-SCI, volume = "82", number = "2", pages = "373--388", day = "31", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6140D (High level languages)", corpsource = "Univ. des Sci. et des Tech. de Lille, Villeneuve d'Ascq, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "axiomatic semantics; finite invariant translation; finite standard translation; programming theory; PROLOG; Prolog", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Curien:1991:AFE, author = "P.-L. Curien", title = "An abstract framework for environment machines", journal = j-THEOR-COMP-SCI, volume = "82", number = "2", pages = "389--402", day = "31", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "LIENS-CNRS, Ecole Normale Sup{\'e}rieure, Paris, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract framework; automata theory; categorical abstract machine; Church--Rosser property; closures; environment machines; formal logic; nondeterministic calculus of closures; paradigm of environments; termination", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Badouel:1991:GR, author = "E. Badouel and P. Darondeau", title = "On guarded recursion", journal = j-THEOR-COMP-SCI, volume = "82", number = "2", pages = "403--408", day = "31", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Irisa, Rennes, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "arbitrary signatures; formal logic; logical rule; Plotkin's framework; programming theory; recursive functions; recursive terms; recursively defined expression; structural operational specifications; unfoldings; well-guardedness", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hoofman:1991:WEM, author = "R. Hoofman", title = "Weakly expressive models for {Hoare} logic", journal = j-THEOR-COMP-SCI, volume = "82", number = "2", pages = "409--418", day = "31", month = may, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. Utrecht Univ., Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "definable; domain; formal logic; Hoare logic; models; programming theory; weak expressivity; weakly expressive", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Breazu-Tannen:1991:PRC, author = "V. Breazu-Tannen and J. Gallier", title = "Polymorphic rewriting conserves algebraic strong normalization", journal = j-THEOR-COMP-SCI, volume = "83", number = "1", pages = "3--28", day = "21", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Comput. and Inf. Sci., Pennsylvania Univ., Philadelphia, PA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic signature; algebraic strong normalization; many-sorted algebraic term rewriting systems; mixed terms; polymorphic lambda calculus; polymorphic lambda term rewriting; rewriting systems", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Cardone:1991:RTF, author = "F. Cardone", title = "Recursive types for Fun", journal = j-THEOR-COMP-SCI, volume = "83", number = "1", pages = "29--56", day = "21", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Inf., Torino Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "equivalence classes; formal languages; Fun; partial equivalence relations; programming theory; quantifiers; recursive type; subtyping; typed polymorphic lambda calculus; untyped language", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Colson:1991:APR, author = "L. Colson", title = "About primitive recursive algorithms", journal = j-THEOR-COMP-SCI, volume = "83", number = "1", pages = "57--69", day = "21", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "CNRS, Ecole Normale Sup{\'e}rieure, Paris, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "call-by-name; computational complexity; computational model; denotational semantics; functional programming; functional programming languages; inf; necessary condition; primitive recursive algorithms; primitive recursive function; programming theory; rewriting system; rewriting systems", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Dershowitz:1991:RRR, author = "N. Dershowitz and S. Kaplan and D. A. Plaisted", title = "Rewrite, rewrite, rewrite, rewrite, rewrite", journal = j-THEOR-COMP-SCI, volume = "83", number = "1", pages = "71--96", day = "21", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic semantics; hierarchical systems; infinitary theories; operational semantics; rewrite systems; rewriting systems; sufficient completeness; transfinite derivations; uniqueness", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Manna:1991:CTP, author = "Z. Manna and A. Pnueli", title = "Completing the temporal picture (logic)", journal = j-THEOR-COMP-SCI, volume = "83", number = "1", pages = "97--130", day = "21", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "assertional reasoning; Borel hierarchy; inference mechanisms; proof rules; proof system; reactive programs; reactivity; response; safety; temporal logic; temporal properties; theorem proving; validity proving", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Parisi-Presicce:1991:FRB, author = "F. Parisi-Presicce", title = "Foundations of rule-based design of modular systems", journal = j-THEOR-COMP-SCI, volume = "83", number = "1", pages = "131--155", day = "21", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Matematica Pura ed Applicata, L'Aquila Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic graph grammars; derivation sequence; formal specification; goal specification; grammars; graph theory; library components; modular systems; module specification; primitive realized data type specifications; programming theory; reusable software components; rule-based design; software system specifications", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Winskel:1991:NMC, author = "G. Winskel", title = "A note on model checking the modal $\nu$-calculus", journal = j-THEOR-COMP-SCI, volume = "83", number = "1", pages = "157--167", day = "21", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Aarhus Univ., Denmark", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "calculus; correctness proof; formal logic; labelled transition system; modal nu-calculus; model checking; model-checking algorithm; mu-calculus; termination proof", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Luchkardt:1991:NFU, author = "H. Luchkardt", title = "New formally undecidable propositions: non-trivial lower bounds on proof complexity and related theorems", journal = j-THEOR-COMP-SCI, volume = "83", number = "2", pages = "169--188", day = "28", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Fachbereich Math. der J. W. Goethe-Univ., Frankfurt am main, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "axioms; computational complexity; formally undecidable propositions; incompleteness theorem; nontrivial lower bounds; proof complexity; theorem proving", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Mauro:1991:DLS, author = "D. Mauro", title = "Derived linear systems of context-free grammars", journal = j-THEOR-COMP-SCI, volume = "83", number = "2", pages = "189--203", day = "28", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Trinity Coll., Hartford, CT, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "connectedness; context-free grammars; derived linear systems; Euler path; graph-theoretic condition; matrix", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{deBoer:1991:PDP, author = "M. J. M. {de Boer} and A. Lindenmayer and Z. Tuza", title = "A periodic division pattern that cannot be generated by {D0L} systems", journal = j-THEOR-COMP-SCI, volume = "83", number = "2", pages = "205--218", day = "28", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "State Univ. of Utrecht, Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "D0L systems; grammars; periodic hexagonal division sequences", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Labhalla:1991:CCC, author = "S. Labhalla", title = "Computational complexity of continuous fraction real number development", journal = j-THEOR-COMP-SCI, volume = "83", number = "2", pages = "219--235", day = "28", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Univ. de Franche-Comte, Besancon, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Cauchy sequence representation; computational complexity; continued fraction form; continued fraction representation; Dedekind cut representation; formal computational theory; real numbers; recursive analysis", language = "French", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Seki:1991:SLC, author = "S. Seki and Y. Kobuchi", title = "On standard locally catenative {L} schemes", journal = j-THEOR-COMP-SCI, volume = "83", number = "2", pages = "237--248", day = "28", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., California State Univ., Fresno, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "grammars; locally catenative property; standard locally catenative L schemes", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Fachini:1991:NCC, author = "E. Fachini and A. M. Schettini and G. Resta and D. Sangiorgi", title = "Nonacceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata", journal = j-THEOR-COMP-SCI, volume = "83", number = "2", pages = "249--260", day = "28", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dipartimento di Inf. ed Applicazioni, Salerno Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; binary systolic tree automata; closure properties; formal languages; inductive characterization; Kleene iteration; languages; nonacceptability criteria; restricted concatenation; restricted iteration; selective concatenation; trees (mathematics)", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Kuster:1991:HPF, author = "G. Kuster", title = "On the {Hurwitz} product of formal power series and automata", journal = j-THEOR-COMP-SCI, volume = "83", number = "2", pages = "261--273", day = "28", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Inst. fur Algebra und Diskrete Math., Tech. Univ., Wien, Austria", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract families; AFPs; automata; automata theory; commutative power series; formal logic; formal power series; generalized wedge operator; Hurwitz product; matrices; series (mathematics)", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Azar:1991:PCM, author = "Y. Azar", title = "Parallel comparison merging of many-ordered lists", journal = j-THEOR-COMP-SCI, volume = "83", number = "2", pages = "275--285", day = "28", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; data structures; deterministic; disjoint ordered lists; many-ordered lists; merging; parallel comparison merging; randomized parallel comparison complexity; sorting", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Kundu:1991:MSR, author = "S. Kundu", title = "Minimal strings in a regular language with respect to a partial order on the alphabet", journal = j-THEOR-COMP-SCI, volume = "83", number = "2", pages = "287--300", day = "28", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "alphabet; artificial intelligence; common sense reasoning; finite automata; finite-state machine; formal languages; minimal strings; partial order; regular language; temporal events", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Cohen-Chesnot:1991:EPT, author = "J. Cohen-Chesnot", title = "On the expressive power of temporal logic for infinite words", journal = j-THEOR-COMP-SCI, volume = "83", number = "2", pages = "301--312", day = "28", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "LITP, Paris, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic proof; equivalence; expressive power; finite words; formal languages; formal logic; infinite words; prefix codes; star-free languages; temporal logic", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hemachandra:1991:KCC, author = "L. A. Hemachandra and G. Wechsung", title = "{Kolmogorov} characterizations of complexity classes", journal = j-THEOR-COMP-SCI, volume = "83", number = "2", pages = "313--322", day = "28", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Rochester Univ., NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexity classes; computational complexity; exponential hierarchy; Kolmogorov characterizations; polynomial hierarchy; pronouncements; query answers", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Mostowski:1991:HWA, author = "A. W. Mostowski", title = "Hierarchies of weak automata and weak monadic formulas", journal = j-THEOR-COMP-SCI, volume = "83", number = "2", pages = "323--335", day = "28", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Math., Gdansk Univ., Poland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "alternating finite automata; complexity; computational complexity; finite automata; hierarchies; Muller indices; Rabin indices; trees; weak automata; weak monadic formulas", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Watanabe:1991:IC, author = "O. Watanabe", title = "On the $p$-isomorphism conjecture", journal = j-THEOR-COMP-SCI, volume = "83", number = "2", pages = "337--343", day = "28", month = jun, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Tokyo Inst. of Technol., Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "class NP; co-NEXP; computational complexity; fixed paddable complete set; one-way function; p-isomorphism conjecture; super-polynomial complexity classes", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Beauquier:1991:LS, author = "D. Beauquier and J.-E. Pin", title = "Languages and scanners", journal = j-THEOR-COMP-SCI, volume = "84", number = "1", pages = "3--21", day = "22", month = jul, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "LITP, Paris VI Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata; automata theory; finite memory; formal languages; languages; model for computations; scanners", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Brassard:1991:CRP, author = "G. Brassard and C. Crepeau and M. Yung", title = "Constant-round perfect zero-knowledge computationally convincing protocols", journal = j-THEOR-COMP-SCI, volume = "84", number = "1", pages = "23--52", day = "22", month = jul, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C5620 (Computer networks and techniques)", corpsource = "Dept. d'inf., Montreal Univ., Que., Canada", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; computationally convincing; discrete logarithms modulo; NP-complete problems; one-way certified group actions; perfect zero-knowledge interactive protocol; protocols", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Bruyere:1991:MCB, author = "V. Bruyere", title = "Maximal codes with bounded deciphering delay", journal = j-THEOR-COMP-SCI, volume = "84", number = "1", pages = "53--76", day = "22", month = jul, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes); C1260 (Information theory)", corpsource = "Univ. de Mons-Hainaut, Belgium", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bounded deciphering delay; codes; finite code; finite deciphering delay; maximal codes", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Chazelle:1991:SES, author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas and M. Sharir", title = "A singly exponential stratification scheme for real semi-algebraic varieties and its applications", journal = j-THEOR-COMP-SCI, volume = "84", number = "1", pages = "77--105", day = "22", month = jul, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C4290 (Other computer theory)", corpsource = "Princeton Univ., NJ, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational geometry; geometric optimization; geometric programming; point location; real semi-algebraic varieties; singly exponential stratification scheme", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Gambosi:1991:PFD, author = "G. Gambosi and E. Nardelli and M. Talamo", title = "A pointer-free data structure for merging heaps and min-max heaps", journal = j-THEOR-COMP-SCI, volume = "84", number = "1", pages = "107--126", day = "22", month = jul, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Istituto di Analisi dei Sistemi ed Inf., CNR, Roma, Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "amortized time complexity; data structures; DeleteHeap; DeleteMax; DeleteMin; FindMax; FindMin; Insert; Merge; merging heaps; min-max heaps; NewHeap; pointer-free data structure", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Papadimitriou:1991:SPM, author = "C. H. Papadimitriou and M. Yannakakis", title = "Shortest paths without a map", journal = j-THEOR-COMP-SCI, volume = "84", number = "1", pages = "127--150", day = "22", month = jul, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C4290 (Other computer theory)", corpsource = "Dept. of Comput. Sci. and Eng., California Univ., San Diego, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; computational geometry; computational problem; dynamic decision rules; layered graphs; optimal decision rules; PSPACE-complete; shortest-path problem; two-dimensional scenes; unit square obstacles; worst-case ratio", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Clausen:1991:ZTI, author = "M. Clausen and A. Dress and J. Grabmeier and M. Karpinski", title = "On zero-testing and interpolation of $k$-sparse multivariate polynomials over finite fields", journal = j-THEOR-COMP-SCI, volume = "84", number = "2", pages = "151--164", day = "29", month = jul, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Inst. fur Inf., Bonn Univ., Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "black box; computational complexity; extension field; finite fields; information source; interpolation; k-sparse multivariate polynomials; polynomials; time complexity; zero-polynomial; zero-testing", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Saoudi:1991:GAI, author = "A. Saoudi", title = "Generalized automata on infinite trees and {Muller-McNaughton}'s theorem", journal = j-THEOR-COMP-SCI, volume = "84", number = "2", pages = "165--177", day = "29", month = jul, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Centre Sci. et Polytech., Paris XIII Univ., Villetaneuse, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; bottom-up generalized automata; deterministic generalized tress automata; grammars; infinite trees; monadic second order theory; Muller-McNaughton Theorem; nondeterministic generalized tree automata; top down generalized automata; tree grammars; trees (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Moran:1991:OCC, author = "S. Moran and Y. Wolfstahl", title = "Optimal covering of cacti by vertex-disjoint paths", journal = j-THEOR-COMP-SCI, volume = "84", number = "2", pages = "179--197", day = "29", month = jul, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Fac. of Comput. Sci., Technion, Israel Inst. of Technol., Haifa, Israel", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "cacti; code optimization; computational complexity; cubic 3-connected planar graphs; cycle; edge; graph covering; graph theory; NP-complete; optimal covering algorithm; parallel architectures; parallel programs; path cover; smallest possible cardinality; vertex-disjoint paths; vertices", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Beigel:1991:BQS, author = "R. Beigel", title = "Bounded queries to {SAT} and the {Boolean} hierarchy", journal = j-THEOR-COMP-SCI, volume = "84", number = "2", pages = "199--223", day = "29", month = jul, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Boolean hierarchy; bounded NP query hierarchies; computational complexity; decision problems complexity; deterministic polynomial time; languages; mind-change technique; NP oracle; NP set; P=NP; parallel queries; polynomial-time Turing machine; SAT; serial queries; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Becker:1991:CFM, author = "B. Becker and U. Sparmann", title = "Computations over finite monoids and their test complexity", journal = j-THEOR-COMP-SCI, volume = "84", number = "2", pages = "225--250", day = "29", month = jul, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0210 (Algebra); B1265 (Digital electronics); B2570 (Semiconductor integrated circuits); C1110 (Algebra); C4240 (Programming and algorithm theory); C5210 (Logic design methods)", corpsource = "Fachbereich Inf., Saarlandes Univ., Saarbrucken, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic properties; algebraic structure; best possible test size; best testable circuit; computational complexity; constant test complexity; expression evaluation; finite monoids; group theory; integrated circuit testing; linear test complexity; logarithmic test complexity; logic design; logic testing; membership problem; parallel prefix computation; test pattern generation problem; VLSI; VLSI circuits", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Rupert:1991:WKS, author = "C. P. Rupert", title = "Which {Kleene} semigroups are finite?", journal = j-THEOR-COMP-SCI, volume = "84", number = "2", pages = "251--264", day = "29", month = jul, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra); C4210 (Formal logic)", corpsource = "Dept. of Math. and Comput. Sci., North Carolina Central Univ., Durham, NC, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "formal languages; group theory; Kleene semigroups; rational idempotents; Simon theorem", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Maurer:1991:BDC, author = "H. A. Maurer and A. Salomaa and D. Wood", title = "Bounded delay {L} codes", journal = j-THEOR-COMP-SCI, volume = "84", number = "2", pages = "265--279", day = "29", month = jul, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes); C6130 (Data handling techniques)", corpsource = "IIG, Graz, Austria", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bounded delay; codes; L codes; ordinary codes", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Dassow:1991:DSA, author = "J. Dassow and H. Jurgensen", title = "Deterministic soliton automata with a single exterior node", journal = j-THEOR-COMP-SCI, volume = "84", number = "2", pages = "281--292", day = "29", month = jul, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "A0210 (Algebra, set theory, and graph theory); A0340K (Waves and wave propagation: general mathematical aspects); C1160 (Combinatorial mathematics); C4220 (Automata theory)", corpsource = "Sektion Math., Tech. Univ. Magdeburg, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automaton theory; deterministic automata; deterministic soliton paths; deterministic state transitions; graph theory; single exterior node; soliton switching; solitons; strongly deterministic soliton automata; underlying graphs", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Baldwin:1991:MT, author = "W. A. Baldwin and G. O. Strawn", title = "Multidimensional trees", journal = j-THEOR-COMP-SCI, volume = "84", number = "2", pages = "293--311", day = "29", month = jul, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Park Coll., Parkville, MO, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata; automata theory; context-free languages; data structure; data structures; formal languages; frontier operation; grammars; internal representations; macro languages; multidimensional tree; node; one-dimensional tree; programming languages specification; regular languages; string languages; tree forests; trees (mathematics); zero-dimensional tree", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Wang:1991:CSC, author = "Jie Wang", title = "On $p$-creative sets and $p$-completely creative sets", journal = j-THEOR-COMP-SCI, volume = "85", number = "1", pages = "1--31", day = "05", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Boston Univ., MA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; NP; p-completely creative sets; p-creative sets; polynomial setting; time complexity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Devolder:1991:FGB, author = "J. Devolder and I. Litovsky", title = "Finitely generated bi omega-languages", journal = j-THEOR-COMP-SCI, volume = "85", number = "1", pages = "33--52", day = "05", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "CNRS, Lille I Univ., Villeneuve d'Ascq, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bi-infinite words; biadherence; bilimit; decidability; decision problem; finitely generated bi omega-languages; formal languages; rational language", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Ibarra:1991:PPO, author = "O. H. Ibarra and Tao Jiang and Hui Wang", title = "Parallel parsing on a one-way linear array of finite-state machines", journal = j-THEOR-COMP-SCI, volume = "85", number = "1", pages = "53--74", day = "05", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "context-free languages; finite automata; finite-state machines; finite-state transducers; grammars; linear context-free languages; linear time; nondeterministic one-counter automata; one-way linear array; parallel algorithms; parallel parsing; RAM; recognition problems; transductions", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Lindell:1991:AFP, author = "S. Lindell", title = "An analysis of fixed-point queries on binary trees", journal = j-THEOR-COMP-SCI, volume = "85", number = "1", pages = "75--95", day = "05", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory); C6140D (High level languages)", corpsource = "Dept. of Math., Haverford Coll., PA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "cardinality; complete unordered binary trees; complexity; computational complexity; expressibility; finite structures; fixed-point queries; formal logic; inductive queries; logical expressibility; ordering; polynomial-time queries; query languages; trees (mathematics)", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Rodenburg:1991:ASD, author = "P. H. Rodenburg", title = "Algebraic specifiability of data types with minimal computable parameters", journal = j-THEOR-COMP-SCI, volume = "85", number = "1", pages = "97--116", day = "05", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Programming Res. Group, Amsterdam Univ., Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic specifiability; data structures; data types; finite equational specification; minimal algebras; minimal computable parameters; persistent parametrized data type; symbol manipulation", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Szpankowski:1991:CDS, author = "W. Szpankowski", title = "A characterization of digital search trees from the successful search viewpoint", journal = j-THEOR-COMP-SCI, volume = "85", number = "1", pages = "117--134", day = "05", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "average complexity; characterization; computational complexity; digital search trees; Patricia tries; regular tries; skewness property; trees (mathematics)", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Kutylowski:1991:MOW, author = "M. Kutylowski", title = "Multihead one-way finite automata", journal = j-THEOR-COMP-SCI, volume = "85", number = "1", pages = "135--153", day = "05", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Comput. Sci., Wroclaw Univ., Poland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; finite automata", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Wegener:1991:CPF, author = "I. Wegener", title = "The complexity of the parity function in unbounded fan-in, unbounded depth circuits", journal = j-THEOR-COMP-SCI, volume = "85", number = "1", pages = "155--170", day = "05", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C5210 (Logic design methods)", corpsource = "Fachbereich Inf., Dortmund Univ., Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "almost optimal bounds; asynchronous circuits; complexity theory; computational complexity; fan-in 2 circuits; logic design; NOR gates; parity function complexity; polynomial-size; real-life circuit design; synchronous circuits; threshold circuits; threshold functions; unbounded depth circuits; unbounded fan-in", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Cherubini:1991:QFA, author = "A. Cherubini and C. Citrini and S. C. Reghizzi and D. Mandrioli", title = "{QRT FIFO} automata, breadth-first grammars and their relations", journal = j-THEOR-COMP-SCI, volume = "85", number = "1", pages = "171--203", day = "05", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dipartimento di Matematica, Politecnico di Milano, Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; breadth-first grammars; closure properties; context-free grammars; counting capabilities; deterministic machines; generative system; homomorphism; multiqueue automata; periodicity property; permutation; QRT FIFO automata; quasi-real-time; queue automata; recognition power; semilinear", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Michel:1991:NCL, author = "P. Michel", title = "An {NP-complete} language accepted in linear time by a one-tape {Turing} machine", journal = j-THEOR-COMP-SCI, volume = "85", number = "1", pages = "205--212", day = "05", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Paris 7 Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; linear time; nonregular languages; NP-complete language; one-tape Turing machine; tight padding method; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Cialdea:1991:RSF, author = "M. Cialdea", title = "Resolution for some first-order modal systems", journal = j-THEOR-COMP-SCI, volume = "85", number = "2", pages = "213--229", day = "12", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6110 (Systems analysis and programming)", corpsource = "Univ. Paul Sabatier, Toulouse, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "first-order modal systems; formal logic; intensional languages; logic programming; modal logic; propositional method; quantification; resolution method", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Doggaz:1991:CU, author = "N. Doggaz and C. Kirchner", title = "Completion for unification", journal = j-THEOR-COMP-SCI, volume = "85", number = "2", pages = "231--251", day = "12", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6110 (Systems analysis and programming)", corpsource = "CRIN, Vandoeuvre-Les-Nancy, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "axioms; completion algorithm; logic programming; presentation; resolvent; theorem proving; unification", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Sopena:1991:HRC, author = "E. Sopena", title = "Hypermap rewriting: a combinatorial approach", journal = j-THEOR-COMP-SCI, volume = "85", number = "2", pages = "253--281", day = "12", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "CNRS, Bordeaux I Univ., Talence, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "combinatorial approach; connected planar maps; decidability; grammars; H-grammars; hypergraphs; hypermap grammar; hypermap rewriting; pumping theorem; rewriting systems; topological representations", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Tennent:1991:CPW, author = "R. D. Tennent and J. K. Tobin", title = "Continuations in possible-world semantics", journal = j-THEOR-COMP-SCI, volume = "85", number = "2", pages = "283--303", day = "12", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ., Kingston., Ont., Canada", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "ALGOL 60-like languages; block expressions; formal languages; formal logic; Hoare's logic; jumps; local-variable declarations; modelling; noninterference specifications; possible-world semantics", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Kamper:1991:NPS, author = "J. Kamper", title = "Nonuniform proof systems: a new framework to describe nonuniform and probabilistic complexity classes", journal = j-THEOR-COMP-SCI, volume = "85", number = "2", pages = "305--331", day = "12", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Fachbereich Inf., Oldenburg Univ., Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; framework; language classes; lowness results; nondeterministic time bounds; nonuniform complexity classes; nonuniform proof systems; polynomial-time hierarchy; probabilistic complexity classes; theorem proving; uniform approach; uniform complexity measures", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Goto:1991:PNN, author = "S. Goto", title = "Proof normalization with nonstandard objects", journal = j-THEOR-COMP-SCI, volume = "85", number = "2", pages = "333--351", day = "12", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "NTT Software Labs., Tokyo, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Borkowski-Slupecki's device; computational meaning; concurrent Prolog; formal proof systems; Gentzen's rule; lazy computation; mathematical induction; natural deduction formalism; nonstandard analysis; nonstandard objects; normalization; number theory; programming theory; proof normalization; pseudonormal proof; stream objects; theorem proving", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bethke:1991:CSU, author = "I. Bethke", title = "Coherence spaces are untopological", journal = j-THEOR-COMP-SCI, volume = "85", number = "2", pages = "353--357", day = "12", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Fac. Wiskunde en Inf., Amsterdam Univ., Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "coherence spaces; continuity; formal logic; stability; theorem proving", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Anonymous:1991:ICL, author = "Anonymous", title = "{6th International Conference on Logic Programming ({ICLP} 89)}", journal = j-THEOR-COMP-SCI, volume = "86", number = "1", pages = "??--??", day = "19", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic); C4240 (Programming and algorithm theory)", conflocation = "Lisbon, Portugal; 19-23 June 1989", conftitle = "6th International Conference on Logic Programming (ICLP 89)", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "acyclic logic programs; completeness; concurrent logic language; disjunctive logic programs; formal logic; horn; logic programming; loop checking; programming theory; semantic models; semantics; SLDNF-resolution; stratified programs; unfold/fold transformations", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{deBoer:1991:SMC, author = "F. S. {de Boer} and J. J. M. M. Rutten and J. N. Kok and C. Palamidessi", title = "Semantic models for concurrent logic languages", journal = j-THEOR-COMP-SCI, volume = "86", number = "1", pages = "3--33", day = "19", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic); C4240 (Programming and algorithm theory)", conflocation = "Lisbon, Portugal; 19-23 June 1989", conftitle = "6th International Conference on Logic Programming (ICLP 89)", corpsource = "Centre for Math. and Comput. Sci., Amsterdam, Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "answer substitutions; concurrent logic languages; deadlock computations; declarative semantics; denotational semantics; formal languages; formal logic; infinite computations; lattice of sets; logic programming; metric space; operational semantics; programming theory; semantic models; success set; terminating computations; transition system; tree-like structures; unification", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bol:1991:ALC, author = "R. N. Bol and K. R. Apt and J. W. Klop", title = "An analysis of loop checking mechanisms for logic programs", journal = j-THEOR-COMP-SCI, volume = "86", number = "1", pages = "35--79", day = "19", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic); C4240 (Programming and algorithm theory)", conflocation = "Lisbon, Portugal; 19-23 June 1989", conftitle = "6th International Conference on Logic Programming (ICLP 89)", corpsource = "Centre for Math. and Comput. Sci., Amsterdam, Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "closed world assumption; completeness; formal logic; logic programming; logic programs; loop checking; programming theory; Prolog programs; query evaluation algorithm; recursion; relative strength; simple loop check; soundness", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Cavedon:1991:ALP, author = "L. Cavedon", title = "Acyclic logic programs and the completeness of {SLDNF}-resolution", journal = j-THEOR-COMP-SCI, volume = "86", number = "1", pages = "81--92", day = "19", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic); C4240 (Programming and algorithm theory)", conflocation = "Lisbon, Portugal; 19-23 June 1989", conftitle = "6th International Conference on Logic Programming (ICLP 89)", corpsource = "Centre for Cognitive Sci., Edinburgh Univ., UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "acyclic condition; acyclic logic programs; atoms; completeness; formal logic; ground instances; hierarchical condition; logic programming; programming theory; recursion; SLDNF-resolution", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Lobo:1991:SHD, author = "J. Lobo and A. Rajasekar and J. Minker", title = "Semantics of {Horn} and disjunctive logic programs", journal = j-THEOR-COMP-SCI, volume = "86", number = "1", pages = "93--106", day = "19", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic); C4240 (Programming and algorithm theory)", conflocation = "Lisbon, Portugal; 19-23 June 1989", conftitle = "6th International Conference on Logic Programming (ICLP 89)", corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "disjunctive logic programs; equivalence; fixpoint semantics; formal logic; Horn logic programs; logic programming; model-theory; operational semantics; procedural semantics; programming theory; proof-theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Seki:1991:UFT, author = "H. Seki", title = "Unfold\slash fold transformation of stratified programs", journal = j-THEOR-COMP-SCI, volume = "86", number = "1", pages = "107--139", day = "19", month = aug, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic); C4240 (Programming and algorithm theory)", conflocation = "Lisbon, Portugal; 19-23 June 1989", conftitle = "6th International Conference on Logic Programming (ICLP 89)", corpsource = "Central Res. Lab., Mitsubishi Electr. Corp., Hyogo, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "definite programs; equivalence; finite failure set; formal logic; logic programming; perfect model semantics; programming theory; SLD-resolution; SLDNF-resolution; stratified programs; success set; unfold/fold rules; unfold/fold transformation", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Averbuch:1991:CAM, author = "A. Averbuch and Z. Galil and S. Winograd", title = "Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. {II}. The algebra {$ G(u)(u^n) $}", journal = j-THEOR-COMP-SCI, volume = "86", number = "2", pages = "143--203", day = "02", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Tel-Aviv Univ., Israel", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithm theory; minimal bilinear algorithms; polynomials; product of two polynomials", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Spehner:1991:MMP, author = "J.-C. Spehner", title = "Merging in maps and in pavings", journal = j-THEOR-COMP-SCI, volume = "86", number = "2", pages = "205--232", day = "02", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C4290 (Other computer theory)", corpsource = "Lab. de Math. et Inf., Haute Alsace Univ., Mulhouse, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational geometry; edges; faces; incidence relations; maps; merging; pavings; pieces; vertices", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hashiguchi:1991:RCS, author = "K. Hashiguchi", title = "Recognizable closures and submonoids of free partially commutative monoids", journal = j-THEOR-COMP-SCI, volume = "86", number = "2", pages = "233--241", day = "02", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Inf. and Comput. Sci., Toyohashi Univ. of Technol., Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "formal languages; free partially commutative monoids; group theory; recognizable closures; regular language; submonoids; sufficient conditions", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Chrobak:1991:POL, author = "M. Chrobak and D. Eppstein", title = "Planar orientations with low out-degree and compaction of adjacency matrices", journal = j-THEOR-COMP-SCI, volume = "86", number = "2", pages = "243--266", day = "02", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. and Comput. Sci., California Univ., Riverside, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "adjacency matrices; compaction; computational complexity; data structure; EREW PRAM; graph theory; linear time; out-degree; parallel algorithms; parallel time; planar graph; time complexity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Krause:1991:SET, author = "M. Krause and C. Meinel and S. Waack", title = "Separating the eraser {Turing} machine classes {$L_e$}, {$\hbox{NL}_e$}, {$\hbox{co-NL}_e$} and {$P_e$}", journal = j-THEOR-COMP-SCI, volume = "86", number = "2", pages = "267--275", day = "02", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Sektion Math., Humboldt Univ. Berlin, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; eraser Turing machine classes; logarithmic space-bounded complexity classes; polynomial upper bounds; read-once-only Omega-branching programs; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Gire:1991:ALB, author = "F. Gire and M. Nivat", title = "Algebraic languages of biinfinite words", journal = j-THEOR-COMP-SCI, volume = "86", number = "2", pages = "277--323", day = "02", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "LITP, Paris Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraity; biinfinite word languages; biinfinite words; finite algebraic substitution; formal languages; infinitary relations; rational infinite relations", language = "French", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bertoni:1991:CCN, author = "A. Bertoni and M. Goldwurm and N. Sabadini", title = "The complexity of computing the number of strings of given length in context-free languages", journal = j-THEOR-COMP-SCI, volume = "86", number = "2", pages = "325--342", day = "02", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Sci. dell'Inf., Milano Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "ambiguity degree; combinatorics; complexity; computational complexity; context-free languages; counting problems; exponential time recognizable languages; formal languages; parallel algorithms; sparse sets; string computations", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Seger:1991:ESI, author = "C.-J. Seger", title = "On the existence of speed-independent circuits", journal = j-THEOR-COMP-SCI, volume = "86", number = "2", pages = "343--364", day = "02", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B1130 (General analysis and synthesis methods); B1265B (Logic circuits); C4230 (Switching theory); C5210 (Logic design methods)", corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "gate circuits; logic circuits; logic gates; MOS switch-level circuits; network analysis; nontransient behavior; speed-independent circuits; switching theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Capocelli:1991:DIS, author = "R. M. Capocelli and L. Gargano and U. Vaccaro", title = "Decoders with initial state invariance for multivalued encodings", journal = j-THEOR-COMP-SCI, volume = "86", number = "2", pages = "365--375", day = "02", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes); C1260 (Information theory); C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Matematica G. Castelnuovo, Roma Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "accidental state transitions; algorithm theory; decoding; encoding; initial state invariance; multivalued encodings; optimal tolerance", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Benedek:1991:LRF, author = "G. M. Benedek and A. Itai", title = "Learnability with respect to fixed distributions", journal = j-THEOR-COMP-SCI, volume = "86", number = "2", pages = "377--389", day = "02", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1240 (Adaptive system 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 = "computability; computational complexity; concept class; finite cover; fixed distributions; learnability; learnable pairs; learning method; learning systems; robustness; undecidability; Vapnik--Chervonenkis dimension", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Stoltenberg-Hanssen:1991:AFP, author = "V. Stoltenberg-Hanssen and J. V. Tucker", title = "Algebraic and fixed point equations over inverse limits of algebras", journal = j-THEOR-COMP-SCI, volume = "87", number = "1", pages = "1--24", day = "16", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra)", corpsource = "Dept. of Math., Uppsala Univ., Sweden", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebra; complete ultrametric spaces; fixed point equations; inverse limits; Scott domains; semantics; ultrametric algebras", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Farmer:1991:SSO, author = "W. M. Farmer", title = "Simple second-order languages for which unification is undecidable", journal = j-THEOR-COMP-SCI, volume = "87", number = "1", pages = "25--41", day = "16", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Mitre Corp., Bedford, MA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "binary function; decidability; formal languages; function variables; Goldfarb theorem; k-provability problem; natural number; rewriting systems; second-order languages; second-order unification problem; term rewriting; undecidability; unification coding", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Heibig:1991:CMN, author = "A. G. Heibig", title = "Control machines: a new model of parallelism for compositional specifications and their effective compilation", journal = j-THEOR-COMP-SCI, volume = "87", number = "1", pages = "43--80", day = "16", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Paris Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract semantics; broadcasted signals; common states; communication mean; compilation; compositional specifications; control environment; control machines; dynamic creation; formal logic; hierarchical networks; instantaneous communications; linear space; linear time; logic programming; logical programming language; modular specifications; module specifications; natural representation; parallel algorithms; parallel processes; parallelism; programming theory; regular operations; specification language; specification languages; synchronization; temporal logic operators", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Balsters:1991:SCS, author = "H. Balsters and M. M. Fokkinga", title = "Subtyping can have a simple semantics", journal = j-THEOR-COMP-SCI, volume = "87", number = "1", pages = "81--96", day = "16", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Twente Univ., Enschede, Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "expressions; first order typed language; formal languages; partial order; programming theory; set theory; simple semantics; subtyping; types", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Fournier:1991:EDM, author = "R. Fournier and G. {von Bochmann}", title = "The equivalence in the {DCP} model", journal = j-THEOR-COMP-SCI, volume = "87", number = "1", pages = "97--114", day = "16", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. d'Inf. et de Recherche Operationnelle, Montreal Univ., Que., Canada", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bisimulation; black boxes; DCP model; deadlocks; discrete communicating processes; equivalence relation; external interactions; formal languages; Johnston model; observational equivalence; partial order; process identifier; processes equivalences; programming theory; testing equivalence; trace equivalence", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hallnas:1991:PID, author = "L. Hallnas", title = "Partial inductive definitions", journal = j-THEOR-COMP-SCI, volume = "87", number = "1", pages = "115--142", day = "16", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Chalmers Univ. of Technol., G{\"o}teborg Univ., Sweden", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexity; data structures; formal logic; logic programming; partial inductive definitions; partial recursive functions; programming theory; semantical notions; semantically oriented data types; totally defined objects", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Gardiner:1991:DRP, author = "P. Gardiner and C. Morgan", title = "Data refinement of predicate transformers", journal = j-THEOR-COMP-SCI, volume = "87", number = "1", pages = "143--162", day = "16", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Programming Res. Group, Oxford, UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract predicates; data refinement; data structures; data type; predicate transformers; program design; program development; programming theory; proofs", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Zierer:1991:RAD, author = "H. Zierer", title = "Relation algebraic domain constructions", journal = j-THEOR-COMP-SCI, volume = "87", number = "1", pages = "163--188", day = "16", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Fakultat fur Inf., Univ. der Bundeswehr Munchen, Neubiberg, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract relation algebra; deflations; domain constructions; domain theory; formal calculus; formal languages; partial functions; programming theory; symmetric quotients", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Wilm:1991:DNP, author = "A. Wilm", title = "Determinism and nondeterminism in {PDL}", journal = j-THEOR-COMP-SCI, volume = "87", number = "1", pages = "189--202", day = "16", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Christian-Albrechts-Univ. zu Kiel, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "formal logic; if then else fi; natural program concepts; nondeterminism; programming theory; propositional assignments; propositional program logic; strict propositional dynamic logic; while do od", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Mezghiche:1991:WCT, author = "M. Mezghiche", title = "Weak completeness of type assignment in lambda-calculus models: a generalization of {Hindley}'s result", journal = j-THEOR-COMP-SCI, volume = "87", number = "1", pages = "203--208", day = "16", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Paris, Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "equality rule; formal logic; lambda-calculus models; type assignment; weak completeness", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Milner:1991:CRS, author = "R. Milner and M. Tofte", title = "Conduction in relational semantics", journal = j-THEOR-COMP-SCI, volume = "87", number = "1", pages = "209--220", day = "16", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "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 = "coinduction; fixpoint induction; formal languages; formal logic; functional programming language; maximal fixed points; monotonic set operators; programming theory; recursive functions; relational semantics; set theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{McCune:1991:APF, author = "W. McCune and L. Wos", title = "The absence and the presence of fixed point combinators", journal = j-THEOR-COMP-SCI, volume = "87", number = "1", pages = "221--228", day = "16", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic)", corpsource = "Div. of Math. and Comput. Sci., Argonne Nat. Lab., IL, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automated theorem-proving program; fixed point combinators; formal logic; kernel strategy; theorem proving; weak combinatory logic", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Esik:1991:RHR, author = "Z. Esik", title = "Results on homomorphic realization of automata by $\alpha_0$-products", journal = j-THEOR-COMP-SCI, volume = "87", number = "2", pages = "229--249", day = "23", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Tue Jul 20 12:58:25 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4220 (Automata theory)", corpsource = "Inst. fur Inf., Tech. Univ. Munchen, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "alpha /sub 0/-products; automata; automata theory; cascade decompositions; group theory; homomorphic realization; irreducible semigroup; irreducible semigroups; Krohn-Rhodes decomposition; letter-to-letter replacement", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Diks:1991:OPC, author = "K. Diks and W. Rytter", title = "On optimal parallel computations for sequences of brackets", journal = j-THEOR-COMP-SCI, volume = "87", number = "2", pages = "251--262", day = "23", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bracket sequences; computational complexity; EREW PRAM; expression-trees; matching function; optimal parallel algorithm; optimal parallel computations; parallel access machine; parallel algorithms; time complexity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Gyssens:1991:CBA, author = "M. Gyssens and D. {Van Gucht}", title = "A comparison between algebraic query languages for flat and nested databases", journal = j-THEOR-COMP-SCI, volume = "87", number = "2", pages = "263--286", day = "23", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory)", corpsource = "Limburg Univ., Diepenbeek, Belgium", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic query languages; database theory; expressiveness; flat algebra; nested algebra; nested relations; nonmonotonic operator; powerset algebra; query languages; redundancy", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Csuhaj-Varju:1991:BIG, author = "E. Csuhaj-Varju and J. Dassow", title = "On bounded interpretations of grammar forms", journal = j-THEOR-COMP-SCI, volume = "87", number = "2", pages = "287--313", day = "23", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Comput. Automation Inst., Hungarian Acad. of Sci., Budapest, Hungary", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bounded grammar families; bounded interpretations; bounded language families; complexity results; context-free languages; decidability; equivalence problem; grammar form; grammars; membership problem; normal form theory; undecidability", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{deLuca:1991:FIC, author = "A. {de Luca} and S. Varricchio", title = "Finiteness and iteration conditions for semigroups", journal = j-THEOR-COMP-SCI, volume = "87", number = "2", pages = "315--327", day = "23", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Math., Roma Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "block-pumping property; finitely generated semigroup; formal languages; group theory; iteration property; regular languages; semigroup", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Nirmal:1991:MCE, author = "N. Nirmal and R. Rama", title = "Machine characterization of ({E0L-E0L}) array languages", journal = j-THEOR-COMP-SCI, volume = "87", number = "2", pages = "329--346", day = "23", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math., Madras Christian Coll., India", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "(E0L-E0L) array system; array languages; formal language theory; formal languages; machine characterization; machine models; two-dimensional language", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Calude:1991:RTS, author = "C. Calude", title = "Relativized topological size of sets of partial recursive functions", journal = j-THEOR-COMP-SCI, volume = "87", number = "2", pages = "347--352", day = "23", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Bucharest Univ., Romania", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Baire topological notions; complexity classes; computational complexity; partial recursive functions; recursive functions; relativized topological size", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Gavalda:1991:SRS, author = "R. Gavalda and J. L. Balcazar", title = "Strong and robustly strong polynomial-time reducibilities to sparse sets", journal = j-THEOR-COMP-SCI, volume = "88", number = "1", pages = "1--14", day = "30", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4230 (Switching theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Software, Univ. Politecnica de Catalunya, Barcelona, Spain", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; complexity theory; computational complexity; oracle strong nondeterministic machines; oracle-restricted positive relativisation; polynomial-time reducibilities; probabilistic class; reduction classes; relativized strength; sequential machines; sparse sets", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Larsen:1991:PSC, author = "K. G. Larsen and B. Thomsen", title = "Partial specifications and compositional verification", journal = j-THEOR-COMP-SCI, volume = "88", number = "1", pages = "15--32", day = "30", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110B (Software engineering techniques)", corpsource = "Aalborg Univ. Center, Inst. for Electron. Syst., Denmark", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bisimulation; compositional proof method; compositional verification; concurrent systems; formal specification; intuitive sub-specifications; nondeterministic systems; partial processes; program verification; programming theory; simple scheduler; theorem proving", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Miyano:1991:CLF, author = "S. Miyano", title = "{$\Delta_2^P$}-complete lexicographically first maximal subgraph problems", journal = j-THEOR-COMP-SCI, volume = "88", number = "1", pages = "33--57", day = "30", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Res. Inst. of Fundamental Inf. Sci., Kyushu Univ., Fukuoka, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; connected graphs; directed graphs; graph property; graph theory; lexicographically first maximal subgraph problems; LFM induced path problem; LFM rooted tree problem; polynomial-time testable; time complexity; topologically sorted directed acyclic graphs", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Crochemore:1991:UKM, author = "M. Crochemore and W. Rytter", title = "Usefulness of the {Karp-Miller-Rosenberg} algorithm in parallel computations on strings and arrays", journal = j-THEOR-COMP-SCI, volume = "88", number = "1", pages = "59--82", day = "30", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "LITP, Inst. Blaise Pascal, Paris Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "arrays; complexity bounds; computational complexity; data structure; finding squares; longest common factor; longest repeated factor; Lyndon factorization; maximal symmetric factor; palindromes; parallel algorithms; parallel computations; pattern-matching; repeated patterns; sequential algorithms; string matching; strings; testing even palstars", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Garzon:1991:CGG, author = "M. Garzon and Y. Zalcstein", title = "The complexity of {Grigorchuk} groups with application to cryptography", journal = j-THEOR-COMP-SCI, volume = "88", number = "1", pages = "83--98", day = "30", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes); C4210 (Formal logic); C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Math. Sci., Memphis State Univ., TN, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; cryptography; formal languages; Grigorchuk groups; infinite complete binary tree; natural complete sets; permutation groups; public-key cryptosystems; space complexity; time complexity; translation theorem; Turing complexity; word problems", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Cho:1991:FAA, author = "Sang Cho and Dung T. Huynh", title = "Finite-automaton aperiodicity is {PSPACE-complete}", journal = j-THEOR-COMP-SCI, volume = "88", number = "1", pages = "99--116", day = "30", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Texas Univ., Richardson, TX, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; dot-depth-one language recognition; exact complexity; finite automata; finite-automaton aperiodicity; formal languages; logspace-complete; NL; nondeterministic logspace-bounded Turing machines; piecewise testable language recognition", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Shankar:1991:GBR, author = "P. Shankar and B. S. Adiga", title = "A graph-based regularity test for deterministic context-free languages", journal = j-THEOR-COMP-SCI, volume = "88", number = "1", pages = "117--125", day = "30", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Autom., Indian Inst. of Sci., Bangalore, India", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexity; computational complexity; context-free languages; deterministic automata; deterministic context-free language; graph-based regularity test; LR(1) grammar; pushdown automaton; stack alphabet size", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Salomaa:1991:DAM, author = "A. Salomaa", title = "A deterministic algorithm for modular knapsack problems", journal = j-THEOR-COMP-SCI, volume = "88", number = "1", pages = "127--138", day = "30", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1290 (Applications of systems theory); C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Turku Univ., Finland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithm theory; deterministic algorithm; linear algebra; modular knapsack problems; modular multiplication; operations research; super-increasing vector; vectors", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Engelfriet:1991:RCG, author = "J. Engelfriet", title = "A regular characterization of graph languages definable in monadic second-order logic", journal = j-THEOR-COMP-SCI, volume = "88", number = "1", pages = "139--150", day = "30", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Leiden Univ., Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "boolean set operations; elementary graph languages; formal languages; formal logic; graph languages; graph theory; monadic second-order logic; projections; regular characterization", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Aizawa:1991:GGP, author = "K. Aizawa and A. Nakamura", title = "Graph grammars with path-controlled embedding", journal = j-THEOR-COMP-SCI, volume = "88", number = "1", pages = "151--170", day = "30", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Appl. Math., Hiroshima Univ., Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "context-free array languages; context-free languages; grammars; graph grammars; graph theory; node-replacement graph grammars; nPCE grammars; partial path group; path-controlled embedding", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Labhalla:1991:RRN, author = "S. Labhalla and H. Lombardi", title = "Representation of real numbers by developments in whole bases and complexity", journal = j-THEOR-COMP-SCI, volume = "88", number = "1", pages = "171--182", day = "30", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. de Math., Marrakech Univ., Morocco", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "basis beta; complexity; computational complexity; computational theory; Dedekind representation; real numbers; recursive analysis; recursive functions", language = "French", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Khuller:1991:PGC, author = "S. Khuller and V. V. Vazirani", title = "Planar graph coloring is not self-reducible, assuming {P} {not=NP}", journal = j-THEOR-COMP-SCI, volume = "88", number = "1", pages = "183--189", day = "30", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Inst. for Adv. Comput. Studies, Maryland Univ., College Park, MD, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; graph colouring; lexicographically first four coloring; NP hardness; planar graph; planar graph four-coloring; self-reducibility; Turing complexity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Seki:1991:MCF, author = "H. Seki and T. Matsumura and M. Fujii and T. Kasami", title = "On multiple context-free grammars", journal = j-THEOR-COMP-SCI, volume = "88", number = "2", pages = "191--229", day = "07", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Inf. and Comput. Sci., Osaka Univ., Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; context-free grammars; context-free languages; context-sensitive languages; formal language-theoretic closure properties; head grammars; multiple context-free grammars; multiple context-free languages; syntax of natural languages; time complexity; tree adjoining grammars", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Huckenbeck:1991:RAP, author = "U. Huckenbeck", title = "A result about the power of geometric oracle machines", journal = j-THEOR-COMP-SCI, volume = "88", number = "2", pages = "231--251", day = "07", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4260 (Computational geometry)", corpsource = "Lehrstuhl fur Inf., Wurzburg Univ., Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract geometric automaton; algebraic characterization; automata theory; Cartesian coordinate system; computational geometry; Euclidian plane; geometric oracle machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Peeva:1991:ERM, author = "K. Peeva", title = "Equivalence, reduction and minimization of finite automata over semirings", journal = j-THEOR-COMP-SCI, volume = "88", number = "2", pages = "269--285", day = "07", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Inst. of Appl. Math. and Comput. Sci., VMEI, Sofia, Bulgaria", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithmical decidability; decidability; deterministic; equivalence; finite automata; finite behaviour matrix; fuzzy automata; minimization; necessary and sufficient condition; Noetherian property; nondeterministic; reduction; semimodules; semirings; stochastic", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Inoue:1991:NRT, author = "K. Inoue and A. Ito and I. Takanami", title = "A note on real-time one-way alternating multicounter machines", journal = j-THEOR-COMP-SCI, volume = "88", number = "2", pages = "287--296", day = "07", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Comput. Sci. and Syst. Eng., Yamaguchi Univ., Ube, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "k-counter machines; Kleene closure; length-preserving homomorphism; linear time; real time; real-time one-way alternating multicounter machines; regular sets; reversal; Turing machines", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Bebjak:1991:SDN, author = "A. Bebjak and I. Stefanekova", title = "Separation of deterministic, nondeterministic and alternating complexity classes", journal = j-THEOR-COMP-SCI, volume = "88", number = "2", pages = "297--311", day = "07", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Theor. Cybernetics, Comenius Univ., Bratislava, Czechoslovakia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "alternating complexity classes; computation model; computational complexity; deterministic complexity classes; hierarchies; multihead Turing machines; nondeterministic complexity classes; one-head Turing machines; Turing machines", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Baur:1991:ACR, author = "W. Baur", title = "On the algebraic complexity of rational iteration procedures", journal = j-THEOR-COMP-SCI, volume = "88", number = "2", pages = "313--324", day = "07", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Konstanz Univ., Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "1-point procedures; algebraic complexity; algebraic numbers; computational complexity; iterative methods; Newton iteration; rational iteration procedures; Regula falsi", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Weber:1991:DAF, author = "A. Weber and H. Seidl", title = "On the degree of ambiguity of finite automata", journal = j-THEOR-COMP-SCI, volume = "88", number = "2", pages = "325--349", day = "07", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Fachbereich Inf., J. W. Goethe Univ., Frankfurt-am-Main, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "decidability; decidable; degree of ambiguity; finite automata; inner structure; maximal finite degree of ambiguity; polynomial time", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Yoo:1991:EAL, author = "H. Yoo and K. Hashiguchi", title = "Extended automata-like regular expressions of star degree at most (2, 1)", journal = j-THEOR-COMP-SCI, volume = "88", number = "2", pages = "351--363", day = "07", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. of Inf. and Comput. Sci., Toyohashi Univ. of Technol., Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; concatenation; context-free languages; extended automata-like regular expressions; finite languages; star degree; star operator; ultralinear languages; union", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Seebold:1991:FMS, author = "P. Seebold", title = "{Fibonacci} morphisms and {Sturmian} words", journal = j-THEOR-COMP-SCI, volume = "88", number = "2", pages = "365--384", day = "07", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "CNRS, LIFL, Lille I Univ., Villeneuve d'Ascq, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; binary morphisms; conjectures; Fibonacci morphisms; infinite words; stationary words; Sturmian words", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Ganzinger:1991:OSC, author = "H. Ganzinger", title = "Order-sorted completion: the many-sorted way", journal = j-THEOR-COMP-SCI, volume = "89", number = "1", pages = "3--32", day = "21", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Max-Planck-Inst. fur Inf., Saarbrucken, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "injections; many sorted specifications; many-sorted conditional equations; many-sorted rewriting; nonsort-decreasing rules; order sorted rewriting; order sorted specifications; order-sorted conditional equations; rewriting systems; sorting; subsort relations", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Habel:1991:DBP, author = "A. Habel and H.-J. Kreowski and W. Vogler", title = "Decidable boundedness problems for sets of graphs generated by hyperedge-replacement", journal = j-THEOR-COMP-SCI, volume = "89", number = "1", pages = "33--62", day = "21", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Fachbereich Math. und Inf., Bremen Univ., Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "boundedness problem; cyclic bandwidth; decidability; decidable; grammars; graph theory; hyperedge-replacement graph grammars; k-trees; language; nodes; numeric function; outerplanar graphs; series-parallel graphs; simple paths", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hanus:1991:HCP, author = "M. Hanus", title = "Horn clause programs with polymorphic types: semantics and resolution", journal = j-THEOR-COMP-SCI, volume = "89", number = "1", pages = "63--106", day = "21", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic)", corpsource = "Fachbereich Inf., Dortmund Univ., Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "arguments; formal logic; functions; higher-order programming; Horn clause logic; Horn clause programs; logic program; logic programming; ML-like polymorphic type system; polymorphic types; predicates; resolution method; semantic models; type declaration; type variables", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Harper:1991:TCU, author = "R. Harper and R. Pollack", title = "Type checking with universes", journal = j-THEOR-COMP-SCI, volume = "89", number = "1", pages = "107--136", day = "21", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "formal logic; formal theory; generalized calculus of constructions; ML; programming theory; type checking; type polymorphism; type theories; typical ambiguity convention; universe levels; universe polymorphism; well-typedness", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Pfenning:1991:MPC, author = "F. Pfenning and P. Lee", title = "Metacircularity in the polymorphic $\lambda$-calculus", journal = j-THEOR-COMP-SCI, volume = "89", number = "1", pages = "137--159", day = "21", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); 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 = "abstractions; encoding; formal logic; Girard-Reynolds second-order polymorphic lambda-calculus; inference; logic programming; metacircular interpreter; omega-order polymorphic lambda-calculus; programming language; programming theory; representations; third-order polymorphic lambda-calculus", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Stirling:1991:LMC, author = "C. Stirling and D. Walker", title = "Local model checking in the modal mu-calculus", journal = j-THEOR-COMP-SCI, volume = "89", number = "1", pages = "161--177", day = "21", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "branching time temporal logic; CCS; dynamic logic; fixpoint induction; local model checker; modal logic; modal mu-calculus; natural temporal logic; process systems; tableau system; temporal logic", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Vissers:1991:SSD, author = "C. A. Vissers and G. Scollo and M. {van Sinderen} and E. Brinksma", title = "Specification styles in distributed systems design and verification", journal = j-THEOR-COMP-SCI, volume = "89", number = "1", pages = "179--206", day = "21", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110B (Software engineering techniques); C6140D (High level languages); C6150N (Distributed systems)", corpsource = "Fac. of Inf., Twente Univ., Enschede, Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bisimulation equivalence; constraint-oriented; correctness preserving transformation; distributed processing; distributed systems design; equational laws; formal specification; formal specification languages; generality; ISO specification language; LOTOS; monolithic; open-endedness; orthogonality; program verification; programming theory; quality; query-answer service; resource-oriented; specification languages; specification styles; state-oriented; verification", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Krob:1991:CSB, author = "D. Krob", title = "Complete systems of {B}-rational identities", journal = j-THEOR-COMP-SCI, volume = "89", number = "2", pages = "207--343", day = "28", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra); C4210 (Formal logic)", corpsource = "CNRS, Lab. d'Inf., Rouen Univ., Mont Saint-Aignan, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "+ operation; B-rational expressions; B-rational identities; C(S,E)/sup +/; completeness; conjectures; formal languages; group identities; group theory; letter reduction; M(S,s) identity; matrix identities; maximal ideals; rules; semigroup rational identities; stability; structure theorem; universal rational expressions", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Knuth:1991:TPC, author = "D. E. Knuth", title = "Theory and practice (computer science)", journal = j-THEOR-COMP-SCI, volume = "90", number = "1", pages = "1--15", day = "11", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110B (Software engineering techniques)", corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computer programming; computer science; computer scientists; METAFONT; philosophical aspects; practice; programming theory; software engineering; T/sub E/X; theory", pubcountry = "Netherlands", treatment = "G General Review; T Theoretical or Mathematical", } @Article{Pottosin:1991:APO, author = "I. V. Pottosin", title = "Analysis of program optimization possibilities and further development", journal = j-THEOR-COMP-SCI, volume = "90", number = "1", pages = "17--36", day = "11", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", corpsource = "Inst. of Inf. Syst., Acad. of Sci., Novosibirsk, USSR", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "compiler construction; object code; program compilation; program optimization; programming theory; supercomputers", pubcountry = "Netherlands", treatment = "B Bibliography; T Theoretical or Mathematical", } @Article{Kasyanov:1991:TAP, author = "V. Kasyanov", title = "Transformational approach to program concretization", journal = j-THEOR-COMP-SCI, volume = "90", number = "1", pages = "37--46", day = "11", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", corpsource = "Inst. of Inf. Syst., Acad. of Sci., Novosibirsk, USSR", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "annotated program transformations; annotated programs; correctness-preserving; program concretization; program verification; programming theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bulyonkov:1991:PEM, author = "M. A. Bulyonkov", title = "From partial evaluation to mixed computation", journal = j-THEOR-COMP-SCI, volume = "90", number = "1", pages = "47--60", day = "11", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Inst. of Inf. Syst., Acad. of Sci., Novosibirsk, USSR", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "mixed computation; mixed computation control; partial evaluation; programming theory; residual program generation", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Futamura:1991:EGP, author = "Y. Futamura and K. Nogi and A. Takano", title = "Essence of generalized partial computation", journal = j-THEOR-COMP-SCI, volume = "90", number = "1", pages = "61--79", day = "11", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Inf. and Comput., Sch. of Sci. and Eng., Waseda Univ., Tokyo, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract data type; generalized partial computation; GPC; logical structure; partial computation; program optimization; programming theory; theorem proving", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Itkin:1991:AMC, author = "V. E. Itkin", title = "An algebra of mixed computation", journal = j-THEOR-COMP-SCI, volume = "90", number = "1", pages = "81--93", day = "11", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Inst. of Inf. Syst., Acad. of Sci., Novosibirsk, USSR", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "informational objects; mixed computation; program composition; program functions; programming theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Jones:1991:SST, author = "N. D. Jones", title = "Static semantics, types, and binding time analysis", journal = j-THEOR-COMP-SCI, volume = "90", number = "1", pages = "95--118", day = "11", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "DIKU, Copenhagen Univ., Denmark", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "binding time analysis; dynamic semantics; partial evaluation; programming theory; static semantics; type systems", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Turski:1991:PB, author = "W. M. Turski", title = "Prescribing behaviours", journal = j-THEOR-COMP-SCI, volume = "90", number = "1", pages = "119--125", day = "11", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "formalism; prescribing a behaviour; programming a process; programming theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{deBakker:1991:FDC, author = "J. W. {de Bakker} and J. H. A. Warmerdam", title = "Four domains for concurrency", journal = j-THEOR-COMP-SCI, volume = "90", number = "1", pages = "127--149", day = "11", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Centre for Math. and Comput. Sci., Amsterdam, Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "concurrency; concurrency control; concurrent language; denotational semantics; domain equations; interleaving concurrency; noninterleaving concurrency; operational semantics; parallel programming; programming theory; recursion", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Cherkasova:1991:ACN, author = "L. A. Cherkasova and V. E. Kotov", title = "An algebra of concurrent nondeterministic processes", journal = j-THEOR-COMP-SCI, volume = "90", number = "1", pages = "151--170", day = "11", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Inst. of Inf. Syst., Acad. of Sci., Novosibirsk, USSR", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebra of finite processes; axiomatization; compositionality; concurrency control; concurrency theory; concurrent processes; full abstractedness; parallel programming; process calculi; programming theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Mazurkiewicz:1991:CS, author = "A. Mazurkiewicz and A. Rabinovich and B. A. Trakhtenbrot", title = "Connectedness and synchronization", journal = j-THEOR-COMP-SCI, volume = "90", number = "1", pages = "171--184", day = "11", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Inst. of Comput. Sci., Polish Acad. of Sci., Warsaw, Poland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "concurrent systems; connected relations; description language; event oriented processes; parallel programming; programming theory; semantical domain; semantical processes; synchronisation; synchronization", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Tyugu:1991:HOD, author = "E. Tyugu", title = "Higher order dataflow schemas", journal = j-THEOR-COMP-SCI, volume = "90", number = "1", pages = "185--198", day = "11", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240P (Parallel programming and algorithm theory)", corpsource = "Inst. of Cybern., Acad. of Sci., Tallinn, Estonia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "dataflow schemas; formal logic; parallel programming; processing nodes; programming theory; propositional logic; safe computations", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Barzdin:1991:RCA, author = "J. M. Barzdin and G. J. Barzdin", title = "Rapid construction of algebraic axioms from samples", journal = j-THEOR-COMP-SCI, volume = "90", number = "1", pages = "199--208", day = "11", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Inst. of Math. and Comput. Sci., Univ. of Latvia, Riga, Latvia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebra; algebraic axioms; formal languages; formal logic; reliable axioms", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Blikle:1991:CES, author = "A. Blikle and A. Tarlecki and M. Thorup", title = "On conservative extensions of syntax in system development", journal = j-THEOR-COMP-SCI, volume = "90", number = "1", pages = "209--233", day = "11", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Inst. of Comput. Sci., Polish Acad. of Sci., Warsaw, Poland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "context-free grammar; context-free grammars; Den; denotational engineering; denotational semantics; formal languages; parsing; software system; Syn; YACC system", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hoare:1991:TDC, author = "C. A. R. Hoare", title = "A theory for the derivation of combinational {C-MOS} circuit designs", journal = j-THEOR-COMP-SCI, volume = "90", number = "1", pages = "235--251", day = "11", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4230B (Combinatorial switching theory)", corpsource = "Comput. Lab., Oxford Univ., UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "C-MOS; calculus of design; combinational switching circuits; combinatorial circuits; formal logic; propositional logic", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Nepejvoda:1991:BBC, author = "N. N. Nepejvoda", title = "A bridge between constructive logic and computer programming", journal = j-THEOR-COMP-SCI, volume = "90", number = "1", pages = "253--270", day = "11", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Appl. Logics and Systemotech. Dept., Izhevsk, USSR", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "analogies; complexities; computer programming; constructive logic; formal logic; logic notions; programming concepts; programming theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Rus:1991:ACC, author = "T. Rus", title = "Algebraic construction of compilers", journal = j-THEOR-COMP-SCI, volume = "90", number = "2", pages = "271--308", day = "25", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., Iowa Univ., Iowa City, IA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic construction; algebraic languages; compiler technology; compilers; formal languages; Omega-languages; parallel machines; program compilers; TICS system", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Tatsuta:1991:PSU, author = "M. Tatsuta", title = "Program synthesis using realizability", journal = j-THEOR-COMP-SCI, volume = "90", number = "2", pages = "309--353", day = "25", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Res. Inst. of Electr. Commun., Tohoku Univ., Sendai, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computation; EON+ mu; predicates; program synthesis; programming; programming theory; q-realizability; recursive definition; recursively defined predicates", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Saito:1991:DER, author = "T. Saito", title = "Dynamics of equivalence relations in automata networks", journal = j-THEOR-COMP-SCI, volume = "90", number = "2", pages = "355--367", day = "25", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Fac. of Sci. and Technol., Ryukyu Univ., Otsu, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic properties; automata network; automata theory; equivalence classes; equivalence relations; vertex set", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Toyama:1991:HPE, author = "Y. Toyama", title = "How to prove equivalence of term rewriting systems without induction", journal = j-THEOR-COMP-SCI, volume = "90", number = "2", pages = "369--390", day = "25", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "NTT Electr. Commun. Labs., Tokyo, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Church--Rosser property; equivalence; equivalence classes; inductionless; reachability; restricted domain; rewriting systems; term rewriting systems", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Dong:1991:LCO, author = "Guozhu Dong and S. Ginsburg", title = "Localizable constraints for object histories", journal = j-THEOR-COMP-SCI, volume = "90", number = "2", pages = "391--432", day = "25", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Univ. of Southern California, Los Angeles, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computation-tuple sequence scheme; constraints; conversion; object histories; programming theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Vakarelov:1991:MLK, author = "D. Vakarelov", title = "Modal logics for knowledge representation systems", journal = j-THEOR-COMP-SCI, volume = "90", number = "2", pages = "433--456", day = "25", month = nov, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic)", corpsource = "Lab. for Appl. Logic, Sofia Univ., Bulgaria", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "formal logic; knowledge representation; logical foundations; modal logics", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Srinivasan:1991:EAM, author = "A. Srinivasan and C. P. Rangan", title = "Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs", journal = j-THEOR-COMP-SCI, volume = "91", number = "1", pages = "1--21", day = "09", month = dec, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", 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 = "algorithms; computational complexity; dominating clique; EREW PRAM algorithm; minimum weighted dominating clique problem; parallel algorithms; permutation graphs; space complexity; vertices", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Buneman:1991:UPG, author = "P. Buneman and A. Jung and A. Ohori", title = "Using powerdomains to generalize relational databases", journal = j-THEOR-COMP-SCI, volume = "91", number = "1", pages = "23--55", day = "09", month = dec, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C4250 (Database theory); C6160D (Relational DBMS)", corpsource = "Dept. of Comput. and Inf. Sci., Pennsylvania Univ., Philadelphia, PA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "concurrency; database theory; denotational semantics; functional dependencies; generalize relational databases; generalized framework; higher-order relations; natural join; nondeterminism; powerdomains; programming languages; programming theory; protection; recursive structures; relational databases; theory of domains; typed objects; universal relations", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Culik:1991:ESF, author = "K. {Culik, II} and S. Dube", title = "An efficient solution of the firing mob problem", journal = j-THEOR-COMP-SCI, volume = "91", number = "1", pages = "57--69", day = "09", month = dec, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Wed Jul 28 18:19:37 1999", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C5620 (Computer networks and techniques)", corpsource = "Dept. of Comput. Sci., South Carolina Univ., Columbia, SC, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computer networks; deterministic finite automaton; finite automata; finite bounded-degree networks; firing mob problem; firing squad synchronization; generalization; synchronisation; synchronizing tree-connected networks", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Arfi:1991:POH, author = "M. Arfi", title = "Polynomial operations and hierarchies of concatenation", journal = j-THEOR-COMP-SCI, volume = "91", number = "1", pages = "71--84", day = "09", month = dec, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Lab. d'Inf., Rouen Univ., Mont-Saint-Aigan, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Boolean algebra; boolean algebra; concatenation; decidability; decidable; formal languages; languages; polynomial closure", language = "French", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Hashiguchi:1991:ADR, author = "K. Hashiguchi", title = "Algorithms for determining relative inclusion star height and inclusion star height", journal = j-THEOR-COMP-SCI, volume = "91", number = "1", pages = "85--100", day = "09", month = dec, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Inf. and Comput. Sci., Toyohashi Univ. of Technol., Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithm; formal languages; inclusion star height; regular languages; relative inclusion star height", pubcountry = "Netherlands", treatment = "P Practical; X Experimental", } @Article{Kinber:1991:CSS, author = "E. B. Kinber", title = "On complete sets of samples for generalized regular expressions", journal = j-THEOR-COMP-SCI, volume = "91", number = "1", pages = "101--117", day = "09", month = dec, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Comput. Centre, Latvian State Univ., Riga, Latvia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "arbitrary class; complete sets of samples; decidability; equivalence problem; equivalent programs; formal languages; generalized regular expressions; inductive formalizations; language; program structures; stronger equivalence relation", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Moews:1991:SGB, author = "D. Moews", title = "Sums of games born on {Days 2 and 3}", journal = j-THEOR-COMP-SCI, volume = "91", number = "1", pages = "119--128", day = "09", month = dec, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0240E (Game theory); B0250 (Combinatorial mathematics); C1140E (Game theory); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Math., California Univ., Berkeley, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "combinatorial mathematics; finite partizan combinatorial games; game theory; game-trees; games; groups", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Kearney:1991:EFP, author = "P. Kearney and J. Staples", title = "An extensional fixed-point semantics for nondeterministic data flow", journal = j-THEOR-COMP-SCI, volume = "91", number = "2", pages = "129--179", day = "23", month = dec, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming)", corpsource = "Sch. of Comput. and Inf. Technol., Griffith Univ., Brisbane, Qld., Australia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "associativity result; automata theory; extensional fixed-point semantics; network construction; nondeterministic data flow; parallel programming; programming theory", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Knijnenburg:1991:MPD, author = "P. M. W. Knijnenburg and J. {van Leeuwen}", title = "On models for propositional dynamic logic", journal = j-THEOR-COMP-SCI, volume = "91", number = "2", pages = "181--203", day = "23", month = dec, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6110P (Parallel programming)", corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "characteristic algebra; completeness theorem; dynamic algebras; formal logic; infinitary axiomatization; Kripke model; logic programming; model theorem; models; propositional dynamic logic; Segerberg axiomatization", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Vogler:1991:ENP, author = "W. Vogler", title = "Executions: a new partial-order semantics of {Petri} nets", journal = j-THEOR-COMP-SCI, volume = "91", number = "2", pages = "205--238", day = "23", month = dec, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240P (Parallel programming and algorithm theory)", corpsource = "Inst. fur Inf., Tech. Univ. Munchen, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "executions; formal logic; partial-order semantics; Petri nets; programming theory", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Tarlecki:1991:SFA, author = "A. Tarlecki and R. M. Burstall and J. A. Goguen", title = "Some fundamental algebraic tools for the semantics of computation. 3. Indexed categories", journal = j-THEOR-COMP-SCI, volume = "91", number = "2", pages = "239--264", day = "23", month = dec, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110B (Software engineering techniques); C6120 (File organisation)", corpsource = "Inst. of Comput. Sci., Polish Acad. of Sci., Warsaw, Poland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "data structures; disjoint union; formal specification; fundamental algebraic tools; indexed categories; morphisms; programming theory; semantics of computation; uniformly defined families of categories", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Zhang:1991:CEA, author = "Wenhui Zhang", title = "Cut elimination and automatic proof procedures", journal = j-THEOR-COMP-SCI, volume = "91", number = "2", pages = "265--284", day = "23", month = dec, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Oslo Univ., Norway", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automatic proof procedures; auxiliary theorems; complexity; cut elimination; theorem proving; upper bound", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Rozoy:1991:EST, author = "B. Rozoy and P. S. Thiagarajan", title = "Event structures and trace monoids", journal = j-THEOR-COMP-SCI, volume = "91", number = "2", pages = "285--313", day = "23", month = dec, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C6120 (File organisation)", corpsource = "Caen Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "data structures; distributed processing; distributed systems; formal languages; independent theory; labelled event structures; Petri nets; poset-based model; Scott domains; string-based formalism; trace monoids", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Anonymous:1992:CPM, author = "Anonymous", title = "{Combinatorial Pattern Matching School}", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "??--??", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1160 (Combinatorial mathematics) and algorithm theory; C1250 (Pattern recognition); C4220 (Automata theory); C4240P (Parallel programming and algorithm theory)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "acyclic deterministic automata; algorithm theory; automata theory; average-case pattern matching; Boyer--Moore--Horspool algorithm; canonical form; circular string; computational complexity; data compression; dynamic programming; factor automata; fast linear-space computations; linear time; longest common subsequences; minimisation; optimal algorithms; pattern recognition; search problems; string matching", pubcountry = "Netherlands", } @Article{Crochemore:1992:FSI, author = "M. Crochemore", title = "Foreword to the {Special Issue on Selected Papers of the Combinatorial Pattern Matching School, Paris, July 1990}", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "1--??", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Fri Nov 21 19:16:33 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", } @Article{Apostolico:1992:FLS, author = "A. Apostolico and S. Browne and C. Guerra", title = "Fast linear-space computations of longest common subsequences", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "3--17", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C7320 (Physics and Chemistry)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "asymptotic time complexity; classical paradigms; computational complexity; fast linear space computations; longest common subsequences; molecular sequence comparisons; physics computing; shortest input string; space reduction; time quadratic", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Baeza-Yates:1992:ART, author = "R. A. Baeza-Yates and M. Regnier", title = "Average running time of the {Boyer--Moore--Horspool} algorithm", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "19--31", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1250 (Pattern recognition); C4240P (Parallel programming and algorithm theory); C6130 (Data handling techniques)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "Dept. de Ciencias de la Comput., Chile Univ., Santiago, Chile", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "average running time; Boyer--Moore--Horspool algorithm; Boyer--Moore-type string searching algorithms; cardinality; computational complexity; exact expression; linearity constant; pattern recognition; search problems; stationary process; symbol manipulation; text editing; word enumeration problem", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Crochemore:1992:SMO, author = "M. Crochemore", title = "String-matching on ordered alphabets", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "33--47", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1250 (Pattern recognition); C4240P (Parallel programming and algorithm theory); C6130 (Data handling techniques)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "LITP, Paris Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexity; computational complexity; constant space; data handling; linear time; memory locations; ordered alphabets; pattern recognition; search problems; string-matching algorithm; time-space optimal", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Galil:1992:DPC, author = "Z. Galil and K. Park", title = "Dynamic programming with convexity, concavity, and sparsity", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "49--76", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0260 (Optimisation techniques); C1180 (Optimisation techniques)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "Dept. of Comput. Sci., Columbia Univ., New York, NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "biology; computer science; concavity; control theory; convexity; dynamic programming; operations research; problem-solving technique; sparsity", pubcountry = "Netherlands", treatment = "B Bibliography; T Theoretical or Mathematical", } @Article{Hashiguchi:1992:TRS, author = "K. Hashiguchi and K. Yamada", title = "Two recognizable string-matching problems over free partially commutative monoids", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "77--86", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1250 (Pattern recognition); C4200 (Computer theory)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "Dept. of Inf. and Comput. Sci., Toyohashi Univ. of Technol., Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computation theory; constant-size alphabet; free partially commutative monoids; linear-time algorithms; pattern recognition; recognizable string-matching problems; search problems", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Iliopoulos:1992:OAC, author = "C. S. Iliopoulos and W. F. Smyth", title = "Optimal algorithms for computing the canonical form of a circular string", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "87--105", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "Dept. of Comput. Sci., R. Holloway Coll., London Univ., UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "canonical form; circular string; computational complexity; least lexicographic rotation; logarithmic running time; O(log n) time CRCW PRAM algorithm; optimal algorithms; parallel algorithms; random-access storage; space complexity; unbounded alphabets", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Kim:1992:ASM, author = "J. Y. Kim and J. Shawe-Taylor", title = "An approximate string-matching algorithm", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "107--117", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1250 (Pattern recognition); C4240P (Parallel programming and algorithm theory)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "Dept. of Comput. Sci., R. Holloway and Bedford New Coll., London Univ., UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithm theory; approximate searches; approximate string-matching algorithm; attribute-matching algorithms; complexity analysis; computational complexity; data structure; look-up phase; pattern recognition; regularity assumptions; search problems; text string", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Lecroq:1992:VBM, author = "T. Lecroq", title = "A variation on the {Boyer--Moore} algorithm", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "119--144", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "CERIL, Evry, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; Boyer--Moore algorithm; linear-time method; longest prefix; smallest suffix automaton", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Neraud:1992:SMI, author = "J. Neraud and M. Crochemore", title = "A string matching interpretation of the equation $x^m y^n=z^p$", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "145--164", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1250 (Pattern recognition); C4240P (Parallel programming and algorithm theory)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "LITP, Rouen Univ., Mont-Saint-Aignan, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithm theory; biprefix code; computational complexity; finite alphabet; maximal factors; NP-complete problem; on-line algorithm; pattern recognition; preprocessing phase; string-matching interpretation; time linear", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Quong:1992:FAC, author = "R. W. Quong", title = "Fast average-case pattern matching by multiplexing sparse tables", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "165--179", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1250 (Pattern recognition); C4240P (Parallel programming and algorithm theory)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "Sch. of Electr. Eng., Purdue Univ., West Lafayette, IN, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; data collecting evidence; encode; fast average case pattern matching; k-mismatches string searching problem; multiplexing sparse tables; occurrences; pattern matching; pattern recognition; search problems; text string; uniform character distribution", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Revuz:1992:MAD, author = "D. Revuz", title = "Minimisation of acyclic deterministic automata in linear time", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "181--189", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C4220 (Automata theory)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "CERIL, Evry, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "acyclic deterministic automata; automaton; finite automata; lexicons; linear time; minimisation", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ukkonen:1992:ASM, author = "E. Ukkonen", title = "Approximate string-matching with $q$-grams and maximal matches", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "191--211", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1250 (Pattern recognition); C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "Dept. of Comput. Sci., Helsinki Univ., Finland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithm theory; approximate string-matching; associated string-matching problem; data structures; edit distance; edit distance based string-matching; fast hybrid algorithms; linear time; locally best approximate occurrences; lower bound; maximal common substrings; maximal matches; pattern recognition; q-grams; string distance functions; unit cost model", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Zipstein:1992:DCF, author = "M. Zipstein", title = "Data compression with factor automata", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "213--221", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes); C1260 (Information theory); C4220 (Automata theory)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "CERIL, Evry, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; data compression; data compression algorithm; encoding; entropy; factor automata; text", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ehrenfeucht:1992:AS, author = "A. Ehrenfeucht and G. Rozenberg", title = "Angular $2$-structures", journal = j-THEOR-COMP-SCI, volume = "92", number = "2", pages = "227--248", day = "20", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "angular 2-structures; graph theory; graphs; partial order; primitivity; symmetric graph", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Goldwurm:1992:PEN, author = "M. Goldwurm", title = "Probabilistic estimation of the number of prefixes of a trace", journal = j-THEOR-COMP-SCI, volume = "92", number = "2", pages = "249--268", day = "20", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1140Z (Other and miscellaneous); C1160 (Combinatorial mathematics); C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dipartimento di Sci. dell'Inf., Milano Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "asymptotic estimations; combinatorial results; context-free languages; context-free trace languages; dependency graph; equiprobable strings; finite automata; finite-state automaton; formal languages; free partially commutative monoids; generating function technique; graph theory; membership problems; prefixes of trace number; probabilistic behaviour; probabilistic estimation; probability; trace languages", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hebisch:1992:GSS, author = "U. Hebisch and H. J. Weinert", title = "Generalized semigroup semirings which are zero-divisor-free or multiplicatively left-cancellative", journal = j-THEOR-COMP-SCI, volume = "92", number = "2", pages = "269--289", day = "20", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4130 (Interpolation and function approximation); C4220 (Automata theory)", corpsource = "Tech. Univ., Clausthal-Zellerfeld, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; free partially commutative monoids; generalized semigroup semirings; multiplicatively left-cancellative; polynomial semiring; polynomials; power series; series (mathematics); zero-divisor-free", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bitar:1992:PCF, author = "J. Bitar and E. Goles", title = "Parallel chip firing games on graphs", journal = j-THEOR-COMP-SCI, volume = "92", number = "2", pages = "291--300", day = "20", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0240E (Game theory); B0250 (Combinatorial mathematics); C1140E (Game theory); C1160 (Combinatorial mathematics)", corpsource = "Dept. de Ingenieria Matematica, Escuela de Ingenieria, Chile Univ., Santiago, Chile", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "game theory; graph theory; graphs; logical functions; nontrivial computing capabilities; parallel chip firing games; parallel dynamics; periodic behaviour; trees", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Lutz:1992:IRO, author = "J. H. Lutz", title = "On independent random oracles", journal = j-THEOR-COMP-SCI, volume = "92", number = "2", pages = "301--307", day = "20", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithmically random oracle; computational complexity; independent random oracles; polynomial time complexity classes", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hemachandra:1992:SCC, author = "L. A. Hemachandra and R. S. Rubinstein", title = "Separating complexity classes with tally oracles", journal = j-THEOR-COMP-SCI, volume = "92", number = "2", pages = "309--318", day = "20", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Rochester Univ., NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexity classes; computational complexity; separating the classes; tally oracles", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Edelsbrunner:1992:ACP, author = "H. Edelsbrunner and L. Guibas and J. Pach and R. Pollack and Seidel and R. and M. Sharir", title = "Arrangements of curves in the plane-topology, combinatorics and algorithms", journal = j-THEOR-COMP-SCI, volume = "92", number = "2", pages = "319--336", day = "20", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C4260 (Computational geometry)", corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic cell decomposition; algorithms; combinatorial complexity; combinatorial geometry; combinatorial mathematics; combinatorics; computational complexity; computational geometry; construction; curves; manipulation; motion planning; nearly quadratic incremental algorithm; topology; zone theorem", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Kfoury:1992:EPF, author = "A. J. Kfoury and J. Tiuryn and P. Urzyczyn", title = "On the expressive power of finitely typed and universally polymorphic recursive procedures", journal = j-THEOR-COMP-SCI, volume = "93", number = "1", pages = "1--41", day = "03", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Boston Univ., MA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational power; expressive power; finite interpretations; finitely typed functional programs; finitely typed recursive procedures; FL; functional programming; halting problem; ML; P; polymorphic fixpoint constructor; polymorphic let-in constructor; programming language; programming theory; semantical classification; syntactic classification; undecidability; universally polymorphic recursive procedures", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Vagvolgyi:1992:TTT, author = "S. Vagvolgyi", title = "Top-down tree transducers with two-way tree walking look-ahead", journal = j-THEOR-COMP-SCI, volume = "93", number = "1", pages = "43--74", day = "03", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Res. Group on Theory of Automata, Hungarian Acad. of Sci., Szeged, Hungary", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; closure properties; composition; computational linguistics; deterministic; formal languages; inclusion diagram; induced tree transformation classes; nondeterministic; strongly deterministic; top-down tree transducers; transformational powers; trees (mathematics); two-way tree walking look-ahead; universal", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Revesz:1992:LOE, author = "G. E. Revesz", title = "A list-oriented extension of the lambda-calculus satisfying the {Church--Rosser} theorem", journal = j-THEOR-COMP-SCI, volume = "93", number = "1", pages = "75--89", day = "03", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "IBM T. J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Backus functional programming system; church-Rosser theorem; formal languages; formal logic; FP; high-level functional languages; list processing; list-oriented extension; programming theory; reduction rules; type-free lambda-calculus", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Harrison:1992:NAR, author = "P. G. Harrison and H. Khoshnevisan", title = "A new approach to recursion removal", journal = j-THEOR-COMP-SCI, volume = "93", number = "1", pages = "91--113", day = "03", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4130 (Interpolation and function approximation); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. London Univ., UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "imperative language loop; interactive forms; iterative methods; primitive subexpressions; programming theory; recursion removal; recursive functions; two-loop program", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Subrahmanian:1992:PDD, author = "V. S. Subrahmanian", title = "Paraconsistent disjunctive deductive databases", journal = j-THEOR-COMP-SCI, volume = "93", number = "1", pages = "115--141", day = "03", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory); C6160K (Deductive databases); C6170 (Expert systems)", corpsource = "Dept. of Comput. Sci., Maryland Univ., MD, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "annotated atoms; database theory; deductive databases; disjunctive deductive databases; indefinite information; knowledge based systems; knowledge bases; negated atoms; paraconsistency; reasoning; semantic", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Zhang:1992:SN, author = "Guo-Qiang Zhang", title = "Stable neighbourhoods", journal = j-THEOR-COMP-SCI, volume = "93", number = "1", pages = "143--157", day = "03", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Georgia Univ., Athens, GA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "coherent spaces; dI-domains; open sets; programming theory; set theory; stable functions; stable neighbourhoods; type constructions", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Goerdt:1992:URV, author = "A. Goerdt", title = "Unrestricted resolution versus {N}-resolution", journal = j-THEOR-COMP-SCI, volume = "93", number = "1", pages = "159--167", day = "03", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Praktische Inf., Univ.-GH-Duisburg, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; N-resolution proof; negative literals; propositional formulas; resolution rule; superpolynomial length; theorem proving; unrestricted resolution", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Peladeau:1992:LDS, author = "P. Peladeau", title = "Logically defined subsets of {$N^k$}", journal = j-THEOR-COMP-SCI, volume = "93", number = "2", pages = "169--183", day = "17", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240P (Parallel programming and algorithm theory)", corpsource = "LITP, Paris 6 Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "=predicate; computational complexity; equals predicate; first-order logic; formal logic; parallel complexity class; rational subsets; recognizable subsets; semi-simple sets; set theory; successor function", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hiraishi:1992:SCW, author = "K. Hiraishi and A. Ichikawa", title = "On structural conditions for weak persistency and semilinearity of {Petri} nets", journal = j-THEOR-COMP-SCI, volume = "93", number = "2", pages = "185--199", day = "17", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Int. Inst. for Adv. Study of Social Inf. Sci., Fujitsu Ltd., Shizuoka, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "initial marking; minimal circuit; necessary and sufficient condition; Petri nets; semilinear reachability set; sinklessness; structural conditions; tokens; weak persistency", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Louchard:1992:DAD, author = "G. Louchard and B. Randrianarimanana and R. Schott", title = "Dynamic algorithms in {D. E. Knuth}'s model: a probabilistic analysis", journal = j-THEOR-COMP-SCI, volume = "93", number = "2", pages = "201--225", day = "17", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Lab. d'Inf. Theor. Univ. Libre de Bruxelles, Brussels, Belgium", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithm theory; average costs; binary search trees; binary tournaments; binomial queues; Brownian excursion functionals; data organizations; data structures; deletions; dictionaries; dynamic algorithms; dynamically varying data structures; Gaussian; insertions; Knuth model; limiting processes; linear lists; pagodas; priority queues; probabilistic analysis; queries; random variables; sorted lists; space costs; time costs; unsorted lists; variance estimates", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bonizzoni:1992:AIT, author = "P. Bonizzoni and G. Mauri", title = "On automata on infinite trees", journal = j-THEOR-COMP-SCI, volume = "93", number = "2", pages = "227--244", day = "17", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dipartimento di Sci. dell'Inf., Milano Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "acceptance conditions; And-control automaton; automata theory; Boolean closure; Boolean operators; Buchi automata; control automaton; deterministic classes; formal logic; infinite tree automata; infinite words; language; limited Muller automata; M-automata; trees (mathematics); weak monadic logic", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Kedem:1992:OPA, author = "Z. M. Kedem and K. V. Palem", title = "Optimal parallel algorithms for forest and term matching", journal = j-THEOR-COMP-SCI, volume = "93", number = "2", pages = "245--264", day = "17", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1230 (Artificial intelligence); C4210 (Formal logic); C4240P (Parallel programming and algorithm theory); C6110L (Logic programming)", corpsource = "Dept. of Comput. Sci., Courant Inst. of Math. Sci., New York Univ., NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; concurrent writes; CRCW PRAM; CREW PRAM; forest matching; hashing; logic programming; nodes; parallel algorithm; parallel algorithms; rewriting systems; term matching; trees (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Toda:1992:RRP, author = "S. Toda", title = "Restricted relativizations of probabilistic polynomial time", journal = j-THEOR-COMP-SCI, volume = "93", number = "2", pages = "265--277", day = "17", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Inf. Math., Univ. of Electro-communications, Tokyo, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computation tree; computational complexity; computational power; negative strings; PH; polynomial time-bounded probabilistic Turing machines; positive strings; PP; probabilistic oracle machines; probabilistic polynomial time; PSPACE; quantitative restriction; relativization results; sets; sparse oracle sets; Turing machines; two-sided unbounded error probability", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Ramanan:1992:TOA, author = "P. Ramanan", title = "Testing the optimality of alphabetic trees", journal = j-THEOR-COMP-SCI, volume = "93", number = "2", pages = "279--301", day = "17", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Wichita State Univ., KS, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "alphabetic trees; computational complexity; correctness; Hu-Tucker algorithm; linear decision tree; lower bound; necessary and sufficient conditions; optimality testing; skewed trees; tree shape; trees (mathematics); weight sequence; well-balanced trees; worst-case time complexity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Boyar:1992:AMC, author = "J. Boyar and G. Frandsen and C. Sturtivant", title = "An arithmetic model of computation equivalent to threshold circuits", journal = j-THEOR-COMP-SCI, volume = "93", number = "2", pages = "303--319", day = "17", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0210 (Algebra); B1265B (Logic circuits); C4210 (Formal logic); C4240 (Programming and algorithm theory); C5120 (Logic and switching circuits)", corpsource = "Chicago Univ., IL, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic laws; arbitrary weights; arithmetic circuit depth; arithmetic model; Boolean computations; Boolean functions; Boolean threshold computations; characteristic-two finite fields; circuit size; computational complexity; fan-in arithmetic gates; logic circuits; threshold circuit depth; threshold functions; threshold logic", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Dehornoy:1992:CPN, author = "P. Dehornoy", title = "A criterion for proving noetherianity of a relation", journal = j-THEOR-COMP-SCI, volume = "93", number = "2", pages = "321--325", day = "17", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Caen Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "binary relation; completeness; locally confluent; noetherianity; reflexive-transitive closure; rewriting rule; rewriting systems; set", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Herbst:1992:KFP, author = "T. Herbst", title = "On a kind of {Fatou} property of context-free groups", journal = j-THEOR-COMP-SCI, volume = "93", number = "2", pages = "327--331", day = "17", month = feb, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra); C4210 (Formal logic)", corpsource = "Inst. fur Inf. und Praktische Math., Christian-Albrechts-Univ. Kiel, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic sets; context-free languages; Fatou property; group theory; homomorphic images; infinite context-free groups; rational set; recursively enumerable languages", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Waldmann:1992:SOS, author = "U. Waldmann", title = "Semantics of order-sorted specifications", journal = j-THEOR-COMP-SCI, volume = "94", number = "1", pages = "1--35", day = "02", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6110B (Software engineering techniques); C6120 (File organisation)", corpsource = "Max-Planck-Inst. fur Inf., Saarbrucken, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract data types; Church--Rosser property; confluence; data structures; decidability; decidable sufficient criterion; equality; error handling; formal specification; many-sorted specifications; order-sorted specifications; overloaded term algebra; partially defined functions; rewrite systems; rewriting; rewriting systems; semantics; subsort relations", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Lamarche:1992:QDI, author = "F. Lamarche", title = "Quantitative domains and infinitary algebras", journal = j-THEOR-COMP-SCI, volume = "94", number = "1", pages = "37--62", day = "02", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "LIENS, Paris, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "formal logic; lambda calculus; linear logic; models; morphisms; quantitative domains; universal domain", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Filippenko:1992:DLP, author = "I. Filippenko and F. L. Morris", title = "Domains for logic programming", journal = j-THEOR-COMP-SCI, volume = "94", number = "1", pages = "63--69", day = "02", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C6110L (Logic programming)", corpsource = "Aerospace Corp., Los Angeles, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract implementation; acyclic; approximation order; directed graphs; first-order data structures; grafts; logic programming; modelling; occur check; open subset; Scott domains", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Manca:1992:SCB, author = "V. Manca and A. Salibra", title = "Soundness and completeness of the {Birkhoff} equational calculus for many-sorted algebras with possibly empty carrier sets", journal = j-THEOR-COMP-SCI, volume = "94", number = "1", pages = "101--124", day = "02", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebras; Birkhoff equational calculus; completeness; computability; many-sorted algebras; many-valued logics; possibly empty carrier sets; soundness; strong satisfiability; strongly sensible signatures; sufficient and necessary conditions; weak satisfiability", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Caspi:1992:CDL, author = "P. Caspi", title = "Clocks in dataflow languages", journal = j-THEOR-COMP-SCI, volume = "94", number = "1", pages = "125--140", day = "02", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages); C6150J (Operating systems)", corpsource = "Lab. de Genie Inf., CNRS, INPG, Grenoble, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bounded memory; clock calculus; continuously operating systems; dataflow languages; Ginsburg-Rose theorem; multiple input-output sequential machines; operating systems (computers); parallel languages; real-time; synchronous dataflow language Lustre", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Koutney:1992:APT, author = "M. Koutney", title = "Adequacy-preserving transformations of {COSY} path programs", journal = j-THEOR-COMP-SCI, volume = "94", number = "1", pages = "141--158", day = "02", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Comput. Lab., Newcastle upon Tyne Univ., UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "adequacy; adequacy-preserving transformations; atomic action; COSY path programs; dynamic properties; elementary actions; insertion; partial deadlocks; program verification; single event; sufficient conditions; verification tool", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Mauduit:1992:I, author = "C. Mauduit", title = "Introduction", journal = j-THEOR-COMP-SCI, volume = "94", number = "2", pages = "159--??", day = "09", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Fri Nov 21 19:16:33 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", } @Article{Allouche:1992:PSS, author = "J.-P. Allouche and P. Morton and J. Shallit", title = "Pattern spectra, substring enumeration, and automatic sequences", journal = j-THEOR-COMP-SCI, volume = "94", number = "2", pages = "161--174", day = "09", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4220 (Automata theory)", corpsource = "CNRS, Talence, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; automatic sequences; enumeration of substrings; formal logic; infinite sequences; number theory; pattern sequences; pattern spectra; pattern spectrum; Prouhet--Thue--Morse sequence; purely language-theoretic result; substring enumeration; termwise product", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Baratchart:1992:RAP, author = "L. Baratchart and M. Olivi and F. Wielonsky", title = "On a rational approximation problem in the real {Hardy} space {$H_2$}", journal = j-THEOR-COMP-SCI, volume = "94", number = "2", pages = "175--197", day = "09", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0260 (Optimisation techniques); B0290F (Interpolation and function approximation); C1180 (Optimisation techniques); C4130 (Interpolation and function approximation)", corpsource = "Inst. Nat. de Recherche en Inf. et Autom., Valbonne, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "approximation theory; global approximants; local approximants; optimisation; optimization algorithms; rational approximation problem; real Hardy space H/sub 2/; uniqueness; well-posedness", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Dehornoy:1992:PMG, author = "P. Dehornoy", title = "Probl{\`e}me de mots dans les gerbes libres. ({French}) [{Word} problems in free groups]", journal = j-THEOR-COMP-SCI, volume = "94", number = "2", pages = "199--213", day = "09", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. de Math., Caen Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "braid group; correction; free groups; free left distributive structures; normal forms; rewriting systems; termination; tractable algorithm; word problem; word problems", language = "French", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Ferenczi:1992:TMS, author = "S. Ferenczi", title = "Tiling the {Morse} sequence", journal = j-THEOR-COMP-SCI, volume = "94", number = "2", pages = "215--221", day = "09", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes); C1260 (Information theory)", corpsource = "CNRS, Marseille, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "codes; ergodic interpretations; holes; Morse sequence; pattern; tiling", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Frougny:1992:SNL, author = "Ch. Frougny", title = "Syst{\`e}mes de num{\'e}ration lin{\'e}aires et theta-repr{\'e}sentations. ({French}) [{Linear} numeration systems and theta-representation]", journal = j-THEOR-COMP-SCI, volume = "94", number = "2", pages = "223--236", day = "09", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4220 (Automata theory)", corpsource = "Paris 8 Univ., Lab. Inf. Theor. et Programmation, Inst. Blaise Pascal, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "finite automata; finite automation; greedy algorithm; integer coefficients; integer representation; linear numeration systems; linear recurrence; normalization; number theory; recurrence; representation of real numbers; symbol manipulation; symbolic dynamics; theta-representation", language = "French", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Galmiche:1992:PDC, author = "D. Galmiche", title = "Program development in constructive type theory", journal = j-THEOR-COMP-SCI, volume = "94", number = "2", pages = "237--259", day = "09", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110B (Software engineering techniques); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Centre de Recherche en Inf. de Nancy, Vandeuvre-les-Nancy, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "constructive type theory; formal specification; formal specifications; logical framework; logical frameworks; program development; program proof; program verification; programming; programming with proofs", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Gardy:1992:MCL, author = "D. Gardy", title = "{M}{\'e}thode de col et lois limit{\'e}s en analyse combinatoire. ({French}) [{Bottleneck} method and limit laws in combinational analysis]", journal = j-THEOR-COMP-SCI, volume = "94", number = "2", pages = "261--280", day = "09", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Lb. de Recherche en Inf., Univ. de Paris-Sud, Orsay, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "combinational analysis; combinatorial mathematics; Gaussian; generating functions; probability distributions; sets of numbers", language = "French", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Gil:1992:CEG, author = "B. Gil", title = "Complete extension of general logic programs", journal = j-THEOR-COMP-SCI, volume = "94", number = "2", pages = "281--294", day = "09", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C6110L (Logic programming)", corpsource = "Dept. de Math. Inf., Fac. des Sci. de Luminy, Marseille, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "axioms; complete extension; databases; declarative semantics; general logic programs; logic programming; negation-as-failure rule; SLDNF procedural interpretation", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Lachaud:1992:ASC, author = "G. Lachaud", title = "{Artin--Schreier} curves, exponential sums, and coding theory", journal = j-THEOR-COMP-SCI, volume = "94", number = "2", pages = "295--310", day = "09", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes); C1260 (Information theory); C4260 (Computational geometry)", corpsource = "Equipe CNRS, Arithm{\'e}tique et Theor. de l'Inf., Marseille, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic curves; Artin--Schreier curves; classical linear codes; codes; coding theory; computational geometry; encoding; exponential sums; geometric BCH codes; Kloosterman sums; Melas code; weights", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Mery:1992:NSD, author = "D. Mery", title = "The {NU} system as a development system for concurrent programs: delta {NU}", journal = j-THEOR-COMP-SCI, volume = "94", number = "2", pages = "311--334", day = "09", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C6110B (Software engineering techniques); C6110P (Parallel programming)", corpsource = "CRIN-CNRS, Vandeuvre, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "concurrent programs; development system; logical framework; mathematical principles; NU system; parallel programming; programming language; rules; software engineering", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Perrin:1992:RPP, author = "D. Perrin and M. Parigot", title = "Recursive programming with proofs", journal = j-THEOR-COMP-SCI, volume = "94", number = "2", pages = "335--356", day = "09", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240P (Parallel programming and algorithm theory)", corpsource = "Equipe de Logique, Paris 7 Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithmic content; conceptual content; conditions; development of correct programs; finite automata; fixed-point combinator; linear map; positive matrices; program verification; programming theory; programs construction; proofs; recursive data types; recursive programming; symbolic dynamics; theorem proving", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", xxauthor = "M. Parigot", } @Article{Perrin:1992:PM, author = "D. Perrin", title = "On positive matrices", journal = j-THEOR-COMP-SCI, volume = "94", number = "2", pages = "357--??", day = "09", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Fri Nov 21 19:16:33 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", } @Article{Restivo:1992:NRS, author = "A. Restivo", title = "A note on renewal systems", journal = j-THEOR-COMP-SCI, volume = "94", number = "2", pages = "367--371", day = "09", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dipartimento di Matematica e Applicazioni, Palermo Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "decidability; decidable; finite set of words; formal language theory; formal languages; free concatenations; Markov systems; renewal systems; symbolic dynamical system; topologically conjugate", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Wen:1992:SST, author = "Zhi-Xiong Wen and Zhi-Ying Wen", title = "Some studies on the $(p,q)$-type sequences", journal = j-THEOR-COMP-SCI, volume = "94", number = "2", pages = "373--393", day = "09", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. de Math., Wuhan Univ., Hubei, China", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "(p,q)-type sequences; analytic properties; arithmetic properties; classical paperfolding sequences; finite automata", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Vianu:1992:CLC, author = "V. Vianu and G. Vossen", title = "Conceptual level concurrency control of relational update transactions", journal = j-THEOR-COMP-SCI, volume = "95", number = "1", pages = "1--42", day = "23", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems); C6160D (Relational DBMS)", corpsource = "Dept. of Comput. Sci. and Eng., California Univ., San Diego, La Jolla, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "conceptual level; concrete database model; concurrency control; concurrency control problem; database constraints; dynamic scheduling; relational databases; relational update transactions; scheduling; semantic information; static serializability testing; transaction processing", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Giordano:1992:EHC, author = "L. Giordano and A. Martelli and G. Rossi", title = "Extending {Horn} clause logic with implication goals", journal = j-THEOR-COMP-SCI, volume = "95", number = "1", pages = "43--74", day = "23", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6110L (Logic programming); C6140D (High level languages)", corpsource = "Dipartimento di Inf., Torino Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "block structured programming languages; extending positive Horn clause logic; formal logic; Herbrand interpretations; implication goals; local clause declarations; logic programming; logic programs; model-theoretic semantics; program structuring; programming languages; static scope rules", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Sain:1992:TLN, author = "I. Sain", title = "Temporal logics need their clocks", journal = j-THEOR-COMP-SCI, volume = "95", number = "1", pages = "75--95", day = "23", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic)", corpsource = "Math. Inst. of the Hungarian Acad. of Sci., Budapest, Hungary", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "clocks; completeness; first-order temporal logics; inference mechanisms; inference systems; open problems; soundness; temporal logic", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Arikawa:1992:LEF, author = "S. Arikawa and T. Shinohara and A. Yamamoto", title = "Learning elementary formal systems", journal = j-THEOR-COMP-SCI, volume = "95", number = "1", pages = "97--113", day = "23", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C1240 (Adaptive system theory); C6110L (Logic programming)", corpsource = "Res. Inst. of Fundamental Inf. Sci., Kyushu Univ., Fukuoka, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Chomsky hierarchy; completeness; elementary formal systems learning; inference mechanisms; learning systems; logic programming; logic programming language; logic programs; model inference; recursive function theory; refinement operators; resolution procedure; semantics", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Bellin:1992:DPR, author = "G. Bellin and J. Ketonen", title = "A decision procedure revisited: Notes on direct logic, linear logic and its implementation", journal = j-THEOR-COMP-SCI, volume = "95", number = "1", pages = "115--142", day = "23", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1140E (Game theory); C1230 (Artificial intelligence); C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "artificial intelligence; correspondences; decidability; decidable fragments; decision procedure; decision theory; direct logic; formal logic; graph-theoretic results; linear logic; natural deduction; predicate calculus", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Jacobs:1992:FMP, author = "B. Jacobs and I. Margaria and M. Zacchi", title = "Filter models with polymorphic types", journal = j-THEOR-COMP-SCI, volume = "95", number = "1", pages = "143--158", day = "23", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Nijmegen Univ., Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "beta eta-expansion; continuous lattice; filter lambda-models; filter models; formal logic; inclusion; intersection types; polymorphic types", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Schwer:1992:FCV, author = "S. R. Schwer", title = "Fine covers of a {VAS} language", journal = j-THEOR-COMP-SCI, volume = "95", number = "1", pages = "159--168", day = "23", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4220 (Automata theory)", corpsource = "CNAM, Paris, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "concurrent systems; constructible refinement; coverability automaton; coverability tree; finite automata; finite automaton; formal languages; mathematical frame; parallelism; Petri nets; trees (mathematics); VAS language; vector addition systems", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Beauquier:1992:TDP, author = "J. Beauquier", title = "Two distributed problems involving {Byzantine} processes", journal = j-THEOR-COMP-SCI, volume = "95", number = "1", pages = "169--185", day = "23", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5640 (Protocols)", corpsource = "LRI-CNRS, Univ. Paris Sud, Orsay, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "byzantine faulty behavior; byzantine processes; complexity; computational complexity; digital signature; distributed problems; distributed processing; message passing; mutual exclusion problem; naming problem; protocol; protocols; synchrony", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ollagnier:1992:PDC, author = "J. Moulin Ollagnier", title = "Proof of {Dejean}'s conjecture for alphabets with 5, 6, 7, 8, 9, 10 and 11 letters", journal = j-THEOR-COMP-SCI, volume = "95", number = "2", pages = "187--205", day = "30", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. de Math. et Inf., Univ. de Paris-Nord, Villetaneuse, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "alphabets; computer-aided proof; decidability; Dejean's conjecture; formal languages; overlapping factors; repetition threshold; square factors; theorem proving", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Quinton:1992:SCA, author = "P. Quinton and Y. Robert", title = "Systolic convolution of arithmetic functions", journal = j-THEOR-COMP-SCI, volume = "95", number = "2", pages = "207--229", day = "30", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5120 (Logic and switching circuits); C5230 (Digital arithmetic methods)", corpsource = "IRISA, Rennes, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "arithmetic functions; digital arithmetic; inverse convolution problem; linear arrays; Mobius function; real-time computation; systolic arrays; systolic convolution; Verhoeff design", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Rabani:1992:SCS, author = "Y. Rabani and Z. Galil", title = "On the space complexity of some algorithms for sequence comparison", journal = j-THEOR-COMP-SCI, volume = "95", number = "2", pages = "231--244", day = "30", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Tel-Aviv Univ., Israel", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algorithms; computational complexity; modified edit distance; sequence comparison; space complexity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Ausiello:1992:LCM, author = "G. Ausiello and G. F. Italiano and A. Marchetti Spaccamela and U. Nanni", title = "On-line computation of minimal and maximal length paths", journal = j-THEOR-COMP-SCI, volume = "95", number = "2", pages = "245--261", day = "30", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", corpsource = "Dipartimento di Inf. e Sistemistica, Rome Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "acyclic diagraphs; acyclicity; add operation; arc; computational complexity; data structure; data structures; directed graph; directed graphs; maximal length paths; minimal length paths; minpath operation; online computation; space complexity", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Zhang:1992:PTA, author = "S. Zhang", title = "Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of {R}-strongly connected automata", journal = j-THEOR-COMP-SCI, volume = "95", number = "2", pages = "263--277", day = "30", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Math. and Stat., Simon Fraser Univ., Burnaby, BC, Canada", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; automorphism group; group type; permutation; polynomial-time algorithms; R-strongly connected automata; strong isomorphism", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Pierre:1992:RIG, author = "L. Pierre", title = "Rational indexes of generators of the cone of context-free languages", journal = j-THEOR-COMP-SCI, volume = "95", number = "2", pages = "279--305", day = "30", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Paris X Univ., Nanterre, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "asymptotic behavior; cone; context-free languages; generators; nonempty language; rational indexes", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Spencer:1992:USG, author = "J. Spencer", title = "{Ulam}'s searching game with a fixed number of lies", journal = j-THEOR-COMP-SCI, volume = "95", number = "2", pages = "307--321", day = "30", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Courant Inst. of Math. Sci., New York Univ., NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "fixed number of lies; game theory; necessary and sufficient conditions; search problems; searching game", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Akl:1992:DMI, author = "S. G. Akl and M. Cosnard and A. G. Ferreira", title = "Data-movement-intensive problems: two folk theorems in parallel computation revisited", journal = j-THEOR-COMP-SCI, volume = "95", number = "2", pages = "323--337", day = "30", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Comput. and Inf. Sci., Queen's Univ., Kingston, Ont., Canada", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract models of computation; Brent's theorem; computational complexity; data movement intensive problems; folk theorems; parallel computation; PRAM; RAM; speedup theorem", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Shankar:1992:GBR, author = "P. Shankar and B. S. Adiga", title = "A graph-based regularity test for deterministic context-free languages", journal = j-THEOR-COMP-SCI, volume = "95", number = "2", pages = "339--340", day = "30", month = mar, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci. and Autom., Indian Inst. of Sci., Bangalore, India", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "context-free languages; deterministic context-free languages; graph-based regularity test; LR(1) grammar; reverse Greibach normal form", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Anonymous:1992:WCC, author = "Anonymous", title = "{2nd Workshop on Concurrency and Compositionality}", journal = j-THEOR-COMP-SCI, volume = "96", number = "1", pages = "??--??", day = "06", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C6150J (Operating systems)", conflocation = "San Miniato, Italy; 28 Feb.-3 March 1990", conftitle = "2nd Workshop on Concurrency and Compositionality", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "chemical abstract machine; concurrency control; conditional rewriting logic; elementary transition systems; formal logic; infinite state spaces; local model checking; logical characterisation; observational structures; Petri net semantics; Petri nets; priority systems; rewriting systems; unified model of concurrency; well branching event structures", pubcountry = "Netherlands", } @Article{DeNicola:1992:P, author = "R. {De Nicola} and U. Montanari", title = "Preface", journal = j-THEOR-COMP-SCI, volume = "96", number = "1", pages = "1--??", day = "06", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Fri Nov 21 19:16:33 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", } @Article{Nielsen:1992:ETS, author = "M. Nielsen and G. Rozenberg and P. S. Thiagarajan", title = "Elementary transition systems", journal = j-THEOR-COMP-SCI, volume = "96", number = "1", pages = "3--33", day = "06", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C6150J (Operating systems)", conflocation = "San Miniato, Italy; 28 Feb.-3 March 1990", conftitle = "2nd Workshop on Concurrency and Compositionality", corpsource = "Dept. of Comput. Sci., Aarhus Univ., Denmark", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "causality; concurrency control; conflict; confusion; distributed processing; distributed systems; elementary net systems; elementary transition systems; models of concurrency; net theory; operational behaviour; Petri nets; systems model", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Mukund:1992:LCW, author = "M. Mukund and P. S. Thiagarajan", title = "A logical characterization of well branching event structures", journal = j-THEOR-COMP-SCI, volume = "96", number = "1", pages = "35--72", day = "06", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C1240 (Adaptive system theory); C4210 (Formal logic)", conflocation = "San Miniato, Italy; 28 Feb.-3 March 1990", conftitle = "2nd Workshop on Concurrency and Compositionality", corpsource = "Sch. of Math., SPIC Sci. Found., Madras, India", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "axiomatization; causality relation; cognitive systems; concurrency; concurrency control; formal languages; formal logic; inference mechanisms; Kripke frames; logical characterization; logical language; minimal conflict; planning (artificial intelligence); prime event structures; reasoning; tense logic; well branching event structures", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Meseguer:1992:CRL, author = "J. Meseguer", title = "Conditional rewriting logic as a unified model of concurrency", journal = j-THEOR-COMP-SCI, volume = "96", number = "1", pages = "73--155", day = "06", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6110J (Object-oriented programming); C6110P (Parallel programming)", conflocation = "San Miniato, Italy; 28 Feb.-3 March 1990", conftitle = "2nd Workshop on Concurrency and Compositionality", corpsource = "SRI Int., Menlo Park, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "concurrency control; concurrent programming; concurrent rewriting; cpo; functional programming; high level declarative programming; logical deduction; Maude; object-oriented programming; parallel programming; poset; preorder; programming language; rewriting systems; semantics; standard algebraic models; structural axioms", pubcountry = "Netherlands", treatment = "B Bibliography; P Practical", xxtitle = "Conditioned rewriting logic as a unified model of concurrency", } @Article{Bradfield:1992:LMC, author = "J. Bradfield and C. Stirling", title = "Local model checking for infinite state spaces", journal = j-THEOR-COMP-SCI, volume = "96", number = "1", pages = "157--174", day = "06", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240P (Parallel programming and algorithm theory); C6150G (Diagnostic, testing, debugging and evaluating systems)", conflocation = "San Miniato, Italy; 28 Feb.-3 March 1990", conftitle = "2nd Workshop on Concurrency and Compositionality", corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "arbitrary transition system model; computational systems; infinite state spaces; local model checking; modal mu-calculus; program verification; tableau proof system; temporal logic; theorem proving; verification method", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Best:1992:PNS, author = "E. Best and M. Koutny", title = "{Petri} net semantics of priority systems", journal = j-THEOR-COMP-SCI, volume = "96", number = "1", pages = "175--215", day = "06", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C6150J (Operating systems)", conflocation = "San Miniato, Italy; 28 Feb.-3 March 1990", conftitle = "2nd Workshop on Concurrency and Compositionality", corpsource = "Inst. f{\"u}r Inf., Hildesheim Univ., Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "concurrent computing systems; conflicts resolution; formal logic; formal semantics; operating systems; operating systems (computers); P/T-nets; Petri net semantics; Petri nets; primitives; priority systems; programming languages; specification", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Berry:1992:CAM, author = "G. Berry and G. Boudol", title = "The chemical abstract machine", journal = j-THEOR-COMP-SCI, volume = "96", number = "1", pages = "217--248", day = "06", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessor systems and techniques)", conflocation = "San Miniato, Italy; 28 Feb.-3 March 1990", conftitle = "2nd Workshop on Concurrency and Compositionality", corpsource = "Centre de Math. Appliqu{\'e}es, Ecole Nat. Sup{\'e}rieure des Mines de Paris, Valbonne, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "CCS process calculi; chemical abstract machine; chemical metaphor; computational complexity; encode; floating molecules; lambda-calculus; membranes; operational semantics; parallel processing; TCCS", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Astesiano:1992:OST, author = "E. Astesiano and A. Giovini and G. Reggio", title = "Observational structures and their logics", journal = j-THEOR-COMP-SCI, volume = "96", number = "1", pages = "249--283", day = "06", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6110B (Software engineering techniques); C6120 (File organisation)", conflocation = "San Miniato, Italy; 28 Feb.-3 March 1990", conftitle = "2nd Workshop on Concurrency and Compositionality", corpsource = "Dept. of Math., Genova Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract generalization; bisimulation equivalences; data structures; data types; first-order structures; formal logic; formal specification; Hennessy--Milner logic; modal observational logics; observational structures; pattern sets; propagation law; semantics; similarity law", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Garg:1992:CRE, author = "V. K. Garg and M. T. Ragunath", title = "Concurrent regular expressions and their relationship to {Petri} nets", journal = j-THEOR-COMP-SCI, volume = "96", number = "2", pages = "285--304", day = "13", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C6110B (Software engineering techniques)", corpsource = "Dept. of Electr. and Comput. Eng., Texas Univ., Austin, TX, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic systems; concurrent regular expressions; concurrent systems specification; formal languages; formal specification; interleaving; interleaving closure; modular description of languages; Petri nets; renaming; synchronous composition", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Huynh:1992:NCR, author = "D. T. Huynh", title = "Nonuniform complexity and the randomness of certain complete languages", journal = j-THEOR-COMP-SCI, volume = "96", number = "2", pages = "305--324", day = "13", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory); C4240P (Parallel programming and algorithm theory)", corpsource = "Texas Univ., Richardson, TX, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; automaton size; complete languages; computational complexity; context-free language; context-free languages; grammar; grammars; Kolmogorov complexity; nonuniform complexity; one-way log-space reductions", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ito:1992:LWE, author = "M. Ito and H. Jurgensen and H. J. Shyr and G. Thierrin", title = "Languages whose $n$-element subsets are codes", journal = j-THEOR-COMP-SCI, volume = "96", number = "2", pages = "325--344", day = "13", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Fac. of Sci., Kyoto Sangyo Univ., Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Chomsky hierarchy; codes; decidability; formal languages; n-code hierarchy; n-element subsets; notation; primitive words; syntactic congruence", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Barua:1992:HKH, author = "R. Barua", title = "The {Hausdorff-Kuratowski} hierarchy of omega-regular languages and a hierarchy of {Muller} automata", journal = j-THEOR-COMP-SCI, volume = "96", number = "2", pages = "345--360", day = "13", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory); C4240P (Parallel programming and algorithm theory)", corpsource = "Div. of Stat.-Math., Indian Stat. Inst., Calcutta, India", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; Buchi automata; complexity; computational complexity; formal languages; Hausdorff-Kuratowski hierarchy; Muller automata; omega-regular languages", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Plambeck:1992:DKS, author = "T. E. Plambeck", title = "Daisies, {Kayles}, and the {Sibert-Conway} decomposition in misere octal games", journal = j-THEOR-COMP-SCI, volume = "96", number = "2", pages = "361--388", day = "13", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0240E (Game theory); C1140E (Game theory)", corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "combinatorial game theory; game theory; impartial two-player game; misere octal games; Sibert-Conway decomposition", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Ferguson:1992:MBK, author = "T. S. Ferguson", title = "Mate with bishop and knight in {Kriegspiel} (mathematical games)", journal = j-THEOR-COMP-SCI, volume = "96", number = "2", pages = "389--403", day = "13", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0240E (Game theory); C1140E (Game theory)", corpsource = "Dept. of Math., California Univ., Los Angeles, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bishop; game theory; king; knight; kriegspiel; probability one; randomization", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Duchamp:1992:PCS, author = "G. Duchamp and D. Krob", title = "On the partially commutative shuffle product", journal = j-THEOR-COMP-SCI, volume = "96", number = "2", pages = "405--410", day = "13", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Paris Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "formal logic; partially commutative shuffle product; partially commutative words; recursive formulas", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Slobodova:1992:SPS, author = "A. Slobodova", title = "Some properties of space-bounded synchronized alternating {Turing} machines with universal states only", journal = j-THEOR-COMP-SCI, volume = "96", number = "2", pages = "411--419", day = "13", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240P (Parallel programming and algorithm theory)", corpsource = "Inst. of Comput. Sci., Comenius Univ., Czechoslovakia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; one hiding synchronization; one-way version; space complexity classes; space lower bound; space-bounded synchronized alternating Turing machines; synchronisation; Turing machines; universal states", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Girard:1992:BLL, author = "J. Y. Girard and A. Scedrov and P. J. Scott", title = "Bounded linear logic: a modular approach to polynomial-time computability", journal = j-THEOR-COMP-SCI, volume = "97", number = "1", pages = "1--66", day = "20", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110B (Software engineering techniques)", corpsource = "Paris Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bounded linear logic; complexity specifications; computational complexity; dynamics; encoding; formal specification; lambda-calculi yield input/output specifications; modular approach; polynomial-time computability; syntax", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{German:1992:SRF, author = "S. M. German", title = "Semantics and reasoning with free procedures", journal = j-THEOR-COMP-SCI, volume = "97", number = "1", pages = "67--81", day = "20", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Comput. and Intelligent Syst. Lab., GTE Labs. Inc., Waltham, MA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "assertions; computable elements; denotational constructions; free procedures; partial correctness assertions; program statements; program verification; proof system; quantification; reachable relations; reasoning; semantics", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Perraud:1992:OSK, author = "J. Perraud and O. Roux and M. Huou", title = "Operational semantics of a kernel of the language {ELECTRE}", journal = j-THEOR-COMP-SCI, volume = "97", number = "1", pages = "83--103", day = "20", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "LAN/ENSM, Nantes, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "attribute evaluation; context-free grammar; context-free grammars; ELECTRE language; formal languages; kernel; language ELECTRE; modules; operational semantics; real-time application; real-time language; transition system", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Monfroglio:1992:IPL, author = "A. Monfroglio", title = "Integer programs for logic constraint satisfaction", journal = j-THEOR-COMP-SCI, volume = "97", number = "1", pages = "105--130", day = "20", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C4240P (Parallel programming and algorithm theory)", corpsource = "OMAR Tech. Inst., Novara, Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "CNF-SAT problem; computational complexity; conjunctive normal form; general deterministic polynomial time algorithm; general NP-hard; integer optimization problem; integer programming; integer programs; linear programming; logic constraint satisfaction; logic programming", pubcountry = "Netherlands", treatment = "B Bibliography; P Practical; T Theoretical or Mathematical", } @Article{Darondeau:1992:FDD, author = "P. Darondeau and D. Nolte and L. Priese and S. Yoccoz", title = "Fairness, distances and degrees", journal = j-THEOR-COMP-SCI, volume = "97", number = "1", pages = "131--142", day = "20", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240P (Parallel programming and algorithm theory)", corpsource = "IRISA, Rennes 1 Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Baire metrics; cluster points; degrees; distances; fair computations; fairness; finite computations; formal languages; omega-regular languages; programming theory; recursive marked trees; recursive transition graphs", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Baratella:1992:CRA, author = "S. Baratella", title = "A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses", journal = j-THEOR-COMP-SCI, volume = "97", number = "1", pages = "143--156", day = "20", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dipartimento di Matematica, Trento Univ., Povo, Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "2-valued logic; 3-valued logical consequences; allowed query clauses; allowed semi-strict programs; completeness result; many-valued logics; NAF-rule; SLDNF-refutation; strictness; sufficient condition; well-behaved query clauses; well-behavedness", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Weibel:1992:ECL, author = "T. Weibel", title = "Extension of combinatory logic to a theory of combinatory representation", journal = j-THEOR-COMP-SCI, volume = "97", number = "1", pages = "157--173", day = "20", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Inst. of Theor. Comput. Sci., ETH, Zurich, Switzerland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic classes; algorithmic classes; combinatorial mathematics; combinatory logic; discipline algebra; first-order logic formulae; formal logic; models; second-order logic axioms; theory of combinatory representation; universal classes", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Doets:1992:SST, author = "K. Doets", title = "A slight strengthening of a theorem of {Blair} and {Kunen}", journal = j-THEOR-COMP-SCI, volume = "97", number = "1", pages = "175--181", day = "20", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0260 (Optimisation techniques); C1180 (Optimisation techniques)", corpsource = "Dept. of Math. and Comput. Sci., Amsterdam Univ., Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "cocomputability; consequence operator; definite logic program; greatest fixed point; logic programming", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Krentel:1992:GOP, author = "M. W. Krentel", title = "Generalizations of Opt {P} to the polynomial hierarchy", journal = j-THEOR-COMP-SCI, volume = "97", number = "2", pages = "183--198", day = "27", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "alternating Turing machines; computational complexity; max operators; min operators; natural complete problems; nondeterministic machine; NP; Opt P function; oracle; polynomial hierarchy; polynomial space; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Watanabe:1992:PTT, author = "O. Watanabe and Shouwen Tang", title = "On polynomial-time {Turing} and many-one completeness in {PSPACE}", journal = j-THEOR-COMP-SCI, volume = "97", number = "2", pages = "199--215", day = "27", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Tokyo Inst. of Technol., Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; dense set; deterministic; many-one completeness; polynomial-time computation; polynomial-time Turing; PSPACE-complete sets; randomized completeness; sparse sets; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Yoo:1992:ERE, author = "H. Yoo and K. Hashiguchi", title = "Extended regular expressions of arbitrary star degrees", journal = j-THEOR-COMP-SCI, volume = "97", number = "2", pages = "217--231", day = "27", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Inf. and Comput. Sci., Toyohashi Univ. of Technol., Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "closure; concatenation; context-free languages; context-sensitive languages; finite languages; inclusion problem; regular expressions; star operators; union", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Muller:1992:AAW, author = "D. E. Muller and A. Saoudi and P. E. Schupp", title = "Alternating automata, the weak monadic theory of trees and its complexity", journal = j-THEOR-COMP-SCI, volume = "97", number = "2", pages = "233--244", day = "27", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Illinois Univ., Urbana, IL, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "alternating automaton; automata theory; Buchi acceptance; complexity; computational complexity; formal languages; formal logic; language; prenex normal form; quantifiers; time bound; trees; trees (mathematics); weak acceptance condition; weak monadic logic; weak monadic sentences", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Karner:1992:NTP, author = "G. Karner", title = "{Nivat}'s theorem for pushdown transducers", journal = j-THEOR-COMP-SCI, volume = "97", number = "2", pages = "245--262", day = "27", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Alcatel Austria-Elin Forschungszentrum, Wien, Austria", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; Dyck reduction; formal languages; mirror image; Nivat theorem; one-counter; pushdown automaton; pushdown transducers; pushdown transition matrix; real-time types; reset-pushdown; semiring structure", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Shore:1992:DRS, author = "R. A. Shore and T. A. Slaman", title = "The $p$-{$T$}-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory", journal = j-THEOR-COMP-SCI, volume = "97", number = "2", pages = "263--284", day = "27", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Cornell Univ., Ithaca, NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; density type; formal languages; looking back; nondistributive lattices; polynomial-time Turing degrees; priority style arguments; recursive lattice; recursive sets; sentences; Turing machines; two-quantifier theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hromkovic:1992:LBA, author = "J. Hromkovic and S. A. Lozkin and A. I. Rybko and A. A. Sapozenko and N. A. Skalikova", title = "Lower bounds on the area complexity of {Boolean} circuits", journal = j-THEOR-COMP-SCI, volume = "97", number = "2", pages = "285--300", day = "27", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B1265B (Logic circuits); C4210 (Formal logic); C4230 (Switching theory); C4240 (Programming and algorithm theory); C5120 (Logic and switching circuits)", corpsource = "Dept. of Theor. Cybern., Comenius Univ., Bratislava, Czechoslovakia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "area complexity; Boolean functions; border; circuit communication complexity; computational complexity; gates; input vertices; layout area; logic circuits; lower bound; planar Boolean circuits; three-dimensional layout", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Guaiana:1992:SFT, author = "G. Guaiana and A. Restivo and S. Salemi", title = "Star-free trace languages", journal = j-THEOR-COMP-SCI, volume = "97", number = "2", pages = "301--311", day = "27", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dipartimento di Matematica e Applicazioni, Palermo Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "aperiodic trace languages; formal languages; free partially commutative monoids; star-free trace languages", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Duchamp:1992:SWA, author = "G. Duchamp and G. Jacob and D. Krob", title = "{Second Workshop on Algebraic and Computer-Theoretic Aspects of Formal Power Series}", journal = j-THEOR-COMP-SCI, volume = "98", number = "1", pages = "??--??", day = "11", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra); C4210 (Formal logic); C4220 (Automata theory)", conflocation = "Paris, France; April 1990", conftitle = "Second Workshop on Algebraic and Computer-Theoretic Aspects of Formal Power Series", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebra; attribute grammars; automata theory; combinatorics; commutation formula; commutative ring; complete semirings; computable identities; differential-algebraic decision methods; formal languages; formal matrices; formal power series; Malcev-Neumann series; Mobius function; multiplicities; nondeterminism; rational relations; rational series; rationality; series (mathematics); skew power series rings; subword order; system theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Choffrut:1992:RRR, author = "C. Choffrut", title = "Rational relations and rational series", journal = j-THEOR-COMP-SCI, volume = "98", number = "1", pages = "5--13", day = "11", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", conflocation = "Paris, France; April 1990", conftitle = "Second Workshop on Algebraic and Computer-Theoretic Aspects of Formal Power Series", corpsource = "LITP, Paris VII Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; coefficients; decidability; equality; Fatou extensions; finiteness; formal languages; free monoid; intersection; noncommuting indeterminates; rational relations; rational series; rational subsets; semiring; series (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Karhumaki:1992:MDV, author = "J. Karhumaki", title = "Multiplicities: {A} deterministic view of nondeterminism", journal = j-THEOR-COMP-SCI, volume = "98", number = "1", pages = "15--25", day = "11", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", conflocation = "Paris, France; April 1990", conftitle = "Second Workshop on Algebraic and Computer-Theoretic Aspects of Formal Power Series", corpsource = "Dept. of Math., Turku Univ., Finland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; deterministic; deterministic automata; formal languages; multiplicities; nondeterminism", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Karner:1992:TFP, author = "G. Karner", title = "On transductions of formal power series over complete semirings", journal = j-THEOR-COMP-SCI, volume = "98", number = "1", pages = "27--39", day = "11", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", conflocation = "Paris, France; April 1990", conftitle = "Second Workshop on Algebraic and Computer-Theoretic Aspects of Formal Power Series", corpsource = "Alcatel Austria-Elin Forschungszentrum, Wien, Austria", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "commutativity; complete semirings; finite automata; formal languages; formal power series; Nivat theorem; pushdown transductions; rational transductions; series (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Varricchio:1992:RSC, author = "S. Varricchio", title = "Rational series with coefficients in a commutative ring", journal = j-THEOR-COMP-SCI, volume = "98", number = "1", pages = "41--50", day = "11", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", conflocation = "Paris, France; April 1990", conftitle = "Second Workshop on Algebraic and Computer-Theoretic Aspects of Formal Power Series", corpsource = "Dipartimento di Matematica Pura e Applicata, Aquila Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; coefficients; commutative ring; Eilenberg equality theorem; field; formal languages; languages; rational series; series (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bjorner:1992:RMF, author = "A. Bjorner and C. Reutenauer", title = "Rationality of the {M{\"o}bius} function of subword order", journal = j-THEOR-COMP-SCI, volume = "98", number = "1", pages = "53--63", day = "11", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", conflocation = "Paris, France; April 1990", conftitle = "Second Workshop on Algebraic and Computer-Theoretic Aspects of Formal Power Series", corpsource = "Dept. of Math., R. Inst. of Technol., Stockholm, Sweden", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; formal languages; Mobius function; noncommutative formal power series; noncommutative monomials; rationality; series (mathematics); subword partial order; zeta function", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Delest:1992:AGU, author = "M. P. Delest and J. M. Fedou", title = "Attribute grammars are useful for combinatorics", journal = j-THEOR-COMP-SCI, volume = "98", number = "1", pages = "65--76", day = "11", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", conflocation = "Paris, France; April 1990", conftitle = "Second Workshop on Algebraic and Computer-Theoretic Aspects of Formal Power Series", corpsource = "CNRS, Bordeaux Univ., Talence, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "attribute grammars; Bessel functions; cells; columns; combinatorial mathematics; combinatorics; generating function; shape; skew Ferrers diagrams", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Cauchon:1992:SMN, author = "G. Cauchon", title = "{S}{\'e}ries de {Malcev-Neumann} sur le groupe libre et questions de rationalit{\'e}. ({French}) [{Malcev-Neumann} series on the free group and questions on nationality]", journal = j-THEOR-COMP-SCI, volume = "98", number = "1", pages = "79--97", day = "11", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra)", conflocation = "Paris, France; April 1990", conftitle = "Second Workshop on Algebraic and Computer-Theoretic Aspects of Formal Power Series", corpsource = "UFR Sci. Reims, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "basis; field; group theory; intersections; Malcev-Neumann series; ordered free group; rational series; series (mathematics); sub-division rings; sub-monoid", language = "French", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Dumas:1992:SPS, author = "F. Dumas", title = "Skew power series rings with general commutation formula", journal = j-THEOR-COMP-SCI, volume = "98", number = "1", pages = "99--114", day = "11", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra)", conflocation = "Paris, France; April 1990", conftitle = "Second Workshop on Algebraic and Computer-Theoretic Aspects of Formal Power Series", corpsource = "Dept. de Math., Reims Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebra; commutation formula; commutation law; commutation rules; fractions; noncommutative product; series (mathematics); skew power series ring; skewfield", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Mourrain:1992:CIA, author = "B. Mourrain", title = "Computable identities in the algebra of formal matrices", journal = j-THEOR-COMP-SCI, volume = "98", number = "1", pages = "115--133", day = "11", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra); C4140 (Linear algebra)", conflocation = "Paris, France; April 1990", conftitle = "Second Workshop on Algebraic and Computer-Theoretic Aspects of Formal Power Series", corpsource = "Centre de Math., Ecole Polytech., Palaiseau, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "canonical form; Cayley--Hamilton identity; characteristic 0; formal manipulations; formal matrices; fraction ring; generic matrices; linear combinations; matrix algebra; multilinear traces; prime ideal; skew field; substitutions; symmetric group; tensor product; trace; universal free algebra", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Diop:1992:DAD, author = "S. Diop", title = "Differential-algebraic decision methods and some applications to system theory", journal = j-THEOR-COMP-SCI, volume = "98", number = "1", pages = "137--161", day = "11", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra); C1140E (Game theory); C1210 (General system theory)", conflocation = "Paris, France; April 1990", conftitle = "Second Workshop on Algebraic and Computer-Theoretic Aspects of Formal Power Series", corpsource = "Lab. d'Autom. et de G{\'e}nie des Proc{\'e}d{\'e}s, Univ. Claude Bernard, Villeurbanne, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebra; characteristic set; decision theory; differential ideal; differential polynomials; differential-algebraic decision methods; finite subset; reduction procedures; system theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Allouche:1992:RRS, author = "J.-P. Allouche and J. Shallit", title = "The ring of $k$-regular sequences", journal = j-THEOR-COMP-SCI, volume = "98", number = "2", pages = "163--197", day = "18", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. de Math. et Inf., CNRS, Talence, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "analysis of algorithms; automatic sequence; combinatorics; formal languages; formal power series; fractals; k-regular sequences; number theory; numerical analysis; topology; Z-rational formal series", pubcountry = "Netherlands", treatment = "B Bibliography; T Theoretical or Mathematical", } @Article{Schwer:1992:CFL, author = "S. R. Schwer", title = "The context-freeness of the languages associated with vector addition systems is decidable", journal = j-THEOR-COMP-SCI, volume = "98", number = "2", pages = "199--247", day = "18", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. de Math. et Inf., CNAM, Paris, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "context-free languages; context-freeness; decidability; Petri nets; vector addition systems", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Santean:1992:INC, author = "L. Santean and J. Kari", title = "The impact of the number of cooperating grammars on the generative power", journal = j-THEOR-COMP-SCI, volume = "98", number = "2", pages = "249--262", day = "18", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Math., Turku Univ., Finland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "cooperating grammars; formal languages; generative power; grammars; language hierarchies; parallel communicating grammar systems; parallel computing; parallel programming", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Yen:1992:MAD, author = "Hsu-Chun Yen", title = "A multiparameter analysis of domino tiling with an application to concurrent systems", journal = j-THEOR-COMP-SCI, volume = "98", number = "2", pages = "263--287", day = "18", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1140E (Game theory); C4240P (Parallel programming and algorithm theory); C4260 (Computational geometry)", corpsource = "Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Cartesian plane; complexities; computational complexity; computational geometry; concurrent systems; deterministic time; domino game problem; domino tiling; game theory; k communicating processes; lockout problem; multiparameter analysis; parallel programming; winning strategy", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Palis:1992:UBR, author = "M. A. Palis and S. M. Shende", title = "Upper bounds on recognition of a hierarchy of non-context-free languages", journal = j-THEOR-COMP-SCI, volume = "98", number = "2", pages = "289--319", day = "18", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., Pennsylvania Univ., University Park, PA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; context-free grammars; control grammars; control language hierarchy; exponential time; formal languages; language recognition; natural language recognition; noncontext-free languages; polynomial time; time complexity; uniform boolean circuits", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Van:1992:VFM, author = "Do Long Van and Phan Trung Huy", title = "Varieties of finite monoids and {Buchi-McNaughton} theorem", journal = j-THEOR-COMP-SCI, volume = "98", number = "2", pages = "321--337", day = "18", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Inst. of Math., Hanoi, Viet Nam", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata; Buchi-McNaughton theorem; finite automata; finite monoids; formal languages; group theory; recognizable languages", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Chrobak:1992:HCT, author = "M. Chrobak and L. L. Larmore", title = "{HARMONIC} is $3$-competitive for two servers", journal = j-THEOR-COMP-SCI, volume = "98", number = "2", pages = "339--346", day = "18", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1140C (Queueing theory); C1140E (Game theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., California Univ., Riverside, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "3-competitive; algorithm theory; competitiveness constant; game theory; HARMONIC; queueing theory; request point; server algorithm", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Amtoft:1992:PMO, author = "T. Amtoft and J. {Larsson Traff}", title = "Partial memoization for obtaining linear time behavior of a {2DPDA}", journal = j-THEOR-COMP-SCI, volume = "98", number = "2", pages = "347--356", day = "18", month = may, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept of Comput. Sci., Aarhus, Denmark", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "2-way deterministic pushdown automaton; 2DPDA; clever evaluation strategy; computational complexity; deterministic automata; generalization; linear time; linear time behavior; memoization; partial memoization; read-only input tape; time complexity", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Cazanescu:1992:GRA, author = "V.-E. Cazanescu and Gh. Stefanescu", title = "A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization", journal = j-THEOR-COMP-SCI, volume = "99", number = "1", pages = "1--63", day = "01", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Fac. of Math., Bucharest Univ., Romania", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract flowchart schemes; accessibility; adequate abstract structure; flowcharting; minimization; programming theory; reduction; support theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hein:1992:CPL, author = "J. Hein", title = "Completions of perpetual logic programs", journal = j-THEOR-COMP-SCI, volume = "99", number = "1", pages = "65--78", day = "01", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6110L (Logic programming)", corpsource = "Dept. of Comput. Sci., Portland State Univ., OR, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Herbrand based semantics; logic programming; logic programs; perpetual logic programs; SLD-resolution", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Lambert:1992:SDR, author = "J. L. Lambert", title = "A structure to decide reachability in {Petri} nets", journal = j-THEOR-COMP-SCI, volume = "99", number = "1", pages = "79--104", day = "01", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Lab. de Recherche en Inf., Univ. de Paris-Sud., Orsay, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "consistent marking; graph theory; Petri nets; precovering graph; reachability; regular constraint graphs", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hesselink:1992:PFU, author = "W. H. Hesselink", title = "Processes and formalisms for unbounded choice", journal = j-THEOR-COMP-SCI, volume = "99", number = "1", pages = "105--119", day = "01", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Rijksuniv. Groningen, Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "angelic choice; demonic choice; program refinement; programming theory; specification algebras; specification construct; specification languages; unbounded choice", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Priese:1992:SFU, author = "L. Priese and D. Nolte", title = "Strong fairness and ultra metrics", journal = j-THEOR-COMP-SCI, volume = "99", number = "1", pages = "121--140", day = "01", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Univ.-GH-Paderborn, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; finite labeled transition systems; infinite fair computations; logical complexity; metric spaces; programming theory; ultra metrics", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Mulry:1992:MAS, author = "P. S. Mulry", title = "Monads and algebras in the semantics of partial data types", journal = j-THEOR-COMP-SCI, volume = "99", number = "1", pages = "141--155", day = "01", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic structures; data structures; monads; partial data types; programming language semantics; programming theory; semantics", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Rajasekaran:1992:NAP, author = "S. Rajasekaran and J. H. Reif", title = "Nested annealing: a provable improvement to simulated annealing", journal = j-THEOR-COMP-SCI, volume = "99", number = "1", pages = "157--176", day = "01", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); 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 = "algorithm theory; computational complexity; multivariate global optimization; nested annealing; NP-complete problems; randomized algorithms; simulated annealing", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bozapalidis:1992:ATR, author = "S. Bozapalidis", title = "Alphabetic tree relations", journal = j-THEOR-COMP-SCI, volume = "99", number = "2", pages = "177--211", day = "08", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Math., Aristotle Univ. of Thessaloniki, Greece", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic forests; alphabetic homomorphisms; alphabetic tree relations; bimorphisms; classical tree-transformations; formal logic; intersection; tree transductions; trees (mathematics); union", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Nummenmaa:1992:CCR, author = "J. Nummenmaa", title = "Constructing compact rectilinear planar layouts using canonical representation of planar graphs", journal = j-THEOR-COMP-SCI, volume = "99", number = "2", pages = "213--230", day = "08", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B1130B (Computer-aided circuit analysis and design); B2570 (Semiconductor integrated circuits); C1160 (Combinatorial mathematics); C7410D (Electronic engineering)", corpsource = "Dept. of Comput. Sci., Tampere Univ., Finland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "canonical representation of planar graphs; circuit layout CAD; compact rectilinear planar layouts; graph theory; Horvert-representation; linear-time algorithm; lower-numbered vertices; visibility representation; VLSI; VLSI layout", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Neraud:1992:RSF, author = "J. Neraud", title = "On the rank of the subsets of a free monoid", journal = j-THEOR-COMP-SCI, volume = "99", number = "2", pages = "231--241", day = "08", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Inst. Blaise Pascal, Univ. de Rouen, Mont Saint Aignan, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "formal logic; free monoid; group theory; rank; subsets", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ibarra:1992:SBS, author = "O. H. Ibarra and N. Q. Tran", title = "On space-bounded synchronized alternating {Turing} machines", journal = j-THEOR-COMP-SCI, volume = "99", number = "2", pages = "243--264", day = "08", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Boolean operations; finite automata; nondeterminism; off-line capability; space-bounded synchronized alternating Turing machines; Turing machines", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Zhang:1992:EST, author = "S. Zhang", title = "Efficient simplicity testing of automata", journal = j-THEOR-COMP-SCI, volume = "99", number = "2", pages = "265--??", day = "08", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Fri Nov 21 19:16:33 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", } @Article{Balcazar:1992:LAC, author = "J. L. Balcazar and U. Schoning", title = "Logarithmic advice classes", journal = j-THEOR-COMP-SCI, volume = "99", number = "2", pages = "279--290", day = "08", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Software, Univ. Politecnica de Cataluna, Barcelona, Spain", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "arbitrary sparse oracle set; computational complexity; log-bounded advice; logarithmic advice classes; nonuniform complexity classes; NP; NP/log computation; polynomial-size advice; sparse oracle", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Varricchio:1992:DEP, author = "S. Varricchio", title = "On the decidability of the equivalence problem for partially commutative rational power series", journal = j-THEOR-COMP-SCI, volume = "99", number = "2", pages = "291--299", day = "08", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dipartimento di Matematica Pura e Applicata, L'Aquila Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "decidability; equivalence problem; partially commutative rational power series; series (mathematics); unambiguous rational sets", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ibarra:1992:CET, author = "O. H. Ibarra and Tao Jiang and Hui Wang", title = "A characterization of exponential-time languages by alternating context-free grammars", journal = j-THEOR-COMP-SCI, volume = "99", number = "2", pages = "301--315", day = "08", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "alternating context-free grammars; alternating pushdown automata; characterization; context-free grammars; exponential-time languages; finite automata; formal languages", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Fouks:1992:TFR, author = "J. D. Fouks", title = "{Tseitin}'s formulas revisited", journal = j-THEOR-COMP-SCI, volume = "99", number = "2", pages = "315--??", day = "08", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Fri Nov 21 19:16:33 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", } @Article{Mosse:1992:PMR, author = "B. Mosse", title = "Puissances de mots et reconnaissabilit{\'e} des points fixes d'une substitution. ({French}) [{Word} power and recognizability of substitutional fixed points]", journal = j-THEOR-COMP-SCI, volume = "99", number = "2", pages = "327--??", day = "08", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Fri Nov 21 19:16:33 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", language = "French", } @Article{Hoang:1992:PAM, author = "C. T. Hoang", title = "A parallel algorithm for minimum weighted colouring of triangulated graphs", journal = j-THEOR-COMP-SCI, volume = "99", number = "2", pages = "335--344", day = "08", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory)", corpsource = "Forschunginst. fur Diskrete Math., Bonn Univ., Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; CRCW PRAM model; graph colouring; minimum weighted colouring; parallel algorithm; parallel algorithms; triangulated graphs", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Trahan:1992:MDS, author = "J. L. Trahan and M. C. Loui and V. Ramachandran", title = "Multiplication, division, and shift instructions in parallel random access machines", journal = j-THEOR-COMP-SCI, volume = "100", number = "1", pages = "1--44", day = "22", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Electr. and Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; instruction sets; parallel algorithms; parallel random access machines; polynomial time; PRAM; PSPACE; random-access storage; shift instructions; Turing machine; Turing machines; unit-cost shifts", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Goerdt:1992:CCC, author = "A. Goerdt", title = "Characterizing complexity classes by higher type primitive recursive definitions", journal = j-THEOR-COMP-SCI, volume = "100", number = "1", pages = "45--66", day = "22", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Univ. GH-Duisburg, Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexity classes characterisation; computational complexity; finite structures; first-order functions; Godel's system T; higher type primitive recursive definitions; LOGSPACE; PTIME; rank-3 PSPACE; rank-4 EXPTIME; syntactic hierarchy", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{DeLuca:1992:NRC, author = "A. {De Luca} and S. Varricchio", title = "On noncounting regular classes", journal = j-THEOR-COMP-SCI, volume = "100", number = "1", pages = "67--104", day = "22", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dipartimento di Matematica, Rome Univ., Napoli, Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "formal languages; free monoid; noncounting regular classes; positive integer; quotient monoid; regular language; word problem", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Holte:1992:PST, author = "R. Holte and L. Rosier and I. Tulchinsky and D. Varvel", title = "Pinwheel scheduling with two distinct numbers", journal = j-THEOR-COMP-SCI, volume = "100", number = "1", pages = "105--135", day = "22", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B6250G (Satellite relay systems); C1290Z (Other applications of systems theory); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; infinite sequence; minimum cyclic schedule length; minimum-length cyclic schedule; online scheduler; pinwheel scheduling; positive integers; preventive maintenance; real-time scheduling problem; satellite ground stations; scheduling", pubcountry = "Netherlands", treatment = "A Application; P Practical", } @Article{Benninger:1992:ESD, author = "D. Benninger and J. Schmid", title = "Effective subdirect decomposition: a case study", journal = j-THEOR-COMP-SCI, volume = "100", number = "1", pages = "137--156", day = "22", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Sigmaplan, Bern, Switzerland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Boolean algebra; Boolean algebras; decomposition theorem; p-algebras; subdirect decomposition; universal algebra", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Board:1992:NOA, author = "R. Board and L. Pitt", title = "On the necessity of {Occam} algorithms", journal = j-THEOR-COMP-SCI, volume = "100", number = "1", pages = "157--184", day = "22", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1240 (Adaptive system theory); C4240P (Parallel programming and algorithm theory); C6140D (High level languages)", corpsource = "Div. of Res. and Stat., Federal Reserve Board, Washington, DC, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "closure under exception lists; concept learning from examples; data compression; distribution-independent model; learning systems; Occam; Occam algorithms; PAC-learnability; parallel algorithms; probability approximately correct learning; randomized polynomial-time algorithm; sufficient condition", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Santoro:1992:DSA, author = "N. Santoro and J. B. Sidney and S. J. Sidney", title = "A distributed selection algorithm and its expected communication complexity", journal = j-THEOR-COMP-SCI, volume = "100", number = "1", pages = "185--204", day = "22", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "communication activities; communication complexity; computational complexity; distributed K-selection problem; distributed selection; distributed selection algorithm; point-to-point model; upper bound; worst-case complexity", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Toda:1992:PTT, author = "S. Toda and O. Watanabe", title = "Polynomial time {$1$-Turing} reductions from \#{PH} to \#{P}", journal = j-THEOR-COMP-SCI, volume = "100", number = "1", pages = "205--221", day = "22", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Inf. Math., Univ. of Electro-commun., Tokyo, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; p-rankability; polynomial-time 1-Turing reductions; polynomial-time reducibility; relative complexity; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Erdos:1992:DLN, author = "P. Erdos and D. F. Hsu", title = "Distributed loop network with minimum transmission delay", journal = j-THEOR-COMP-SCI, volume = "100", number = "1", pages = "223--241", day = "22", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B6210 (Telecommunication applications); C5600 (Data communication equipment and techniques); C5620 (Computer networks and techniques)", corpsource = "Math. Inst., Hungarian Acad. of Sci., Budapest, Hungary", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computer networks; data alignments; delays; design; distributed loop network; doubly linked loop networks; implementation; local area networks; minimum transmission delay; multimode memory organizations; multiply linked loop networks; parallel memory systems; rerouting algorithms; ring structure; routing algorithms; supercomputer architecture; telecommunication networks; upper bound", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Prodinger:1992:HAA, author = "H. Prodinger", title = "Hypothetical analyses: approximate counting in the style of {Knuth}, path length in the style of {Flajolet}", journal = j-THEOR-COMP-SCI, volume = "100", number = "1", pages = "243--251", day = "22", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); B0290F (Interpolation and function approximation); C1160 (Combinatorial mathematics); C4130 (Interpolation and function approximation)", corpsource = "Dept. of Algebra and Discrete Math., Tech. Univ. of Vienna, Austria", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "approximate counting; approximation theory; average path length; digital search trees; Mellin integral transform; path length; search problems", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Beame:1992:CCS, author = "P. Beame and E. Brisson and R. Ladner", title = "The complexity of computing symmetric functions using threshold circuits", journal = j-THEOR-COMP-SCI, volume = "100", number = "1", pages = "253--265", day = "22", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Eng., Washington Univ., Seattle, WA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexity; computational complexity; computing symmetric functions; n-input parity function; n-input symmetric function; size-depth tradeoffs; threshold circuits; threshold logic", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Moss:1992:FAC, author = "L. S. Moss and J. Meseguer and J. A. Goguen", title = "Final algebras, cosemicomputable algebras and degrees of unsolvability", journal = j-THEOR-COMP-SCI, volume = "100", number = "2", pages = "267--302", day = "29", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory); C6120 (File organisation)", corpsource = "Dept. of Math., Indiana Univ., Bloomington, IN, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "abstract data types; computability; computability notions; congruences; cosemicomputable algebras; data structures; degrees of unsolvability; final algebras; finitely generated free algebras; formal logic; many-sorted algebras; minimal-state realizations; necessary and sufficient conditions; Turing degree; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Dezani-Ciancaglini:1992:ITC, author = "M. Dezani-Ciancaglini and J. R. Hindley", title = "Intersection types for combinatory logic", journal = j-THEOR-COMP-SCI, volume = "100", number = "2", pages = "303--324", day = "29", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dipartimento di Inf., Torino Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "axiom-schemes; combinatory logic; formal logic; intersection types; lambda-calculus; translations", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bartha:1992:FTS, author = "M. Bartha", title = "Foundations of a theory of synchronous systems", journal = j-THEOR-COMP-SCI, volume = "100", number = "2", pages = "325--346", day = "29", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Memorial Univ. of Newfoundland, St. John's, Nfld., Canada", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "arbitrary pointed algebraic theory; feedback theory; formal logic; functorial dagger condition; inverse limit; iteration; semantic algebra construction; stepwise behavior; synchronous systems", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Wang:1992:CBD, author = "Ke Wang", title = "On characterizing boundedness of database schemes with bounded dependencies", journal = j-THEOR-COMP-SCI, volume = "100", number = "2", pages = "347--364", day = "29", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory)", corpsource = "Dept. of Comput. Sci., Chongqing Univ., Sichuan, China", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bounded dependencies; bounded equality-generating dependencies; characterizing boundedness; database schemes; database theory; equality-generating dependencies; lossless database scheme; relational algebra; single join dependency", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Back:1992:CAD, author = "R. J. R. Back and J. {Von Wright}", title = "Combining angels, demons and miracles in program specifications", journal = j-THEOR-COMP-SCI, volume = "100", number = "2", pages = "365--383", day = "29", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110B (Software engineering techniques)", corpsource = "Dept. of Comput. Sci., Abo Akademi Univ., Turku, Finland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "angelic nondeterminism; angels; command language; complete lattice; demons; formal specification; miracles; monotonic predicate transformers; program specifications; programming theory; refinement; termination; total correctness; unbounded nondeterminism; weakest precondition semantics", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Meinke:1992:UAH, author = "K. Meinke", title = "Universal algebra in higher types", journal = j-THEOR-COMP-SCI, volume = "100", number = "2", pages = "385--417", day = "29", month = jun, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math. and Comput. Sci., Univ. Coll., Swansea, UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "characterisation theorems; elementary theory; equational calculus; equational classes; existence theorems; finite type theory; formal logic; higher types; higher-order universal algebra; Horn classes; nonstandard approach; type algebras", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Grandjean:1992:E, author = "E. Grandjean", title = "Editorial", journal = j-THEOR-COMP-SCI, volume = "101", number = "1", pages = "1--??", day = "13", month = jul, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Fri Nov 21 19:16:33 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", } @Article{Courcelle:1992:MSO, author = "B. Courcelle", title = "The monadic second-order logic of graphs {VII}: {Graphs} as relational structures", journal = j-THEOR-COMP-SCI, volume = "101", number = "1", pages = "3--33", day = "13", month = jul, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Lab. d'Inf., Bordeaux-1 Univ., Talence, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "context-free grammars; formal logic; graph theory; hypergraphs; relational structures; rewriting grammars; second-order logic", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Gradel:1992:CCC, author = "E. Gradel", title = "Capturing complexity classes by fragments of second-order logic", journal = j-THEOR-COMP-SCI, volume = "101", number = "1", pages = "35--57", day = "13", month = jul, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Math. Inst., Basel Univ., Switzerland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexity classes; computational complexity; expressive power; finite structures; formal logic; second-order Horn logic; second-order Krom logic; second-order logic", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Mazoyer:1992:LST, author = "J. Mazoyer and N. Reimen", title = "A linear speed-up theorem for cellular automata", journal = j-THEOR-COMP-SCI, volume = "101", number = "1", pages = "59--98", day = "13", month = jul, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "LIP, Ecole Normale Sup{\'e}rieure de Lyon, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "cellular automata; computational complexity; finite automata; linear speed-up theorem", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Michel:1992:SSC, author = "P. Michel", title = "A survey of space complexity", journal = j-THEOR-COMP-SCI, volume = "101", number = "1", pages = "99--132", day = "13", month = jul, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Paris 7 Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexity classes; computational complexity; deterministic; nondeterministic; nonuniform classes; space complexity classes; weakly space-bounded classes", pubcountry = "Netherlands", treatment = "B Bibliography; T Theoretical or Mathematical", } @Article{Peladeau:1992:FRL, author = "P. Peladeau", title = "Formulas, regular languages and {Boolean} circuits", journal = j-THEOR-COMP-SCI, volume = "101", number = "1", pages = "133--141", day = "13", month = jul, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240P (Parallel programming and algorithm theory)", corpsource = "LITP, Paris 6 Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Boolean circuits; Boolean functions; computational complexity; formal languages; numerical predicates; parallel complexity; regular languages", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{deRougemont:1992:FDI, author = "M. {de Rougemont}", title = "The functional dimension of inductive definitions", journal = j-THEOR-COMP-SCI, volume = "101", number = "1", pages = "143--158", day = "13", month = jul, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Ecole Nat. Sup{\'e}rieure de Techniques Avanc{\'e}es, Paris, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "decidability; expressive power; finite-valued graphs; formal languages; functional dimensions; inductive definitions; inductive query; iterated inductive definitions; stratified logic programs", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", xxtitle = "The functional dimensions of inductive definitions", } @Article{Kwiatkowska:1992:E, author = "M. Z. Kwiatkowska", title = "Editorial", journal = j-THEOR-COMP-SCI, volume = "101", number = "2", pages = "159--??", day = "20", month = jul, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Fri Nov 21 19:16:33 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", } @Article{Best:1992:TCH, author = "Eike Best and J{\"o}rg Desel and Javier Esparza", title = "Traps characterize home states in free choice systems", journal = j-THEOR-COMP-SCI, volume = "101", number = "2", pages = "161--176", day = "20", month = jul, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:16:35 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1992&volume=101&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1992&volume=101&issue=2&aid=1130", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", conflocation = "Leicester, UK; 23-25 July 1990", conftitle = "International BCS-FACS Workshop on Semanics for Concurrency", corpsource = "Inst. f{\"u}r Inf., Hildesheim Univ., Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bounded free choice system; concurrency; free choice systems; home state property; home states; live; nondeterministic choice; Petri nets; polynomial-time algorithm; theorem proving; traps", pubcountry = "Netherlands", sponsororg = "S.E.R.C", treatment = "T Theoretical or Mathematical", } @Article{Brookes:1992:TTP, author = "Stephen Brookes and Shai Geva", title = "Towards a theory of parallel algorithms on concrete data structures", journal = j-THEOR-COMP-SCI, volume = "101", number = "2", pages = "177--221", day = "20", month = jul, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:16:35 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1992&volume=101&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1992&volume=101&issue=2&aid=1131", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", conflocation = "Leicester, UK; 23-25 July 1990", conftitle = "International BCS-FACS Workshop on Semanics for Concurrency", corpsource = "Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "concrete data structures; currying operations; data structures; input-output function; intensional model; intensional strictness ordering; parallel algorithms; sequential functions", pubcountry = "Netherlands", sponsororg = "S.E.R.C", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Bloom:1992:EPE, author = "Bard Bloom and Albert R. Meyer", title = "Experimenting with process equivalence", journal = j-THEOR-COMP-SCI, volume = "101", number = "2", pages = "223--237", day = "20", month = jul, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:16:35 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1992&volume=101&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1992&volume=101&issue=2&aid=1132", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", conflocation = "Leicester, UK; 23-25 July 1990", conftitle = "International BCS-FACS Workshop on Semanics for Concurrency", corpsource = "Dept. of Math. and Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computation theory; computational experiments; concurrent processes; duplication of processes; formal languages; formal logic; Milner's bisimulation equivalence; observable outcomes; process equivalence; ready simulation resembling; trees (mathematics)", pubcountry = "Netherlands", sponsororg = "S.E.R.C", treatment = "T Theoretical or Mathematical; X Experimental", } @Article{deBoer:1992:FSC, author = "F. S. {de Boer} and J. N. Kok and C. Palamidessi and J. J. M. M. Rutten", title = "From failure to success: comparing a denotational and a declarative semantics for {Horn} clause logic", journal = j-THEOR-COMP-SCI, volume = "101", number = "2", pages = "239--263", day = "20", month = jul, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:16:35 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1992&volume=101&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1992&volume=101&issue=2&aid=1133", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", conflocation = "Leicester, UK; 23-25 July 1990", conftitle = "International BCS-FACS Workshop on Semanics for Concurrency", corpsource = "Dept. of Comput. Sci., Tech. Univ. Endhoven, Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "declarative semantics; denotational semantics; formal logic; Horn clause logic; interleaving; mathematical tool; maximal parallelism; metric spaces; operational", pubcountry = "Netherlands", sponsororg = "S.E.R.C", treatment = "T Theoretical or Mathematical", } @Article{Gunawardena:1992:CA, author = "Jeremy Gunawardena", title = "Causal automata", journal = j-THEOR-COMP-SCI, volume = "101", number = "2", pages = "265--288", day = "20", month = jul, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:16:35 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1992&volume=101&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1992&volume=101&issue=2&aid=1134", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", conflocation = "Leicester, UK; 23-25 July 1990", conftitle = "International BCS-FACS Workshop on Semanics for Concurrency", corpsource = "Hewlett--Packard Labs., Bristol, UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; causal automata; causality; CCS; formalism; Milner's notion of confluence; partial orders; syntactic approach", pubcountry = "Netherlands", sponsororg = "S.E.R.C", treatment = "T Theoretical or Mathematical", } @Article{Hooman:1992:CAS, author = "J. J. M. Hooman and S. Ramesh and W. P. {de Roever}", title = "A compositional axiomatization of {Statecharts}", journal = j-THEOR-COMP-SCI, volume = "101", number = "2", pages = "289--335", day = "20", month = jul, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:16:35 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1992&volume=101&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1992&volume=101&issue=2&aid=1135", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240P (Parallel programming and algorithm theory); C6140D (High level languages)", conflocation = "Leicester, UK; 23-25 July 1990", conftitle = "International BCS-FACS Workshop on Semanics for Concurrency", corpsource = "Dept. of Math. and Comput. Sci., Eindhoven Univ. of Technol., Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "behavioural specification language; broadcast communication; compositional axiomatization; compositional program verification; concurrency; event-driven systems; finite automata; finite state machines; graphical language; hierarchy; liveness; program verification; reactive systems; real-time systems; safety; specification languages; state-transition diagrams; Statecharts; time-out", pubcountry = "Netherlands", sponsororg = "S.E.R.C", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Katz:1992:DCI, author = "Shmuel Katz and Doron Peled", title = "Defining conditional independence using collapses", journal = j-THEOR-COMP-SCI, volume = "101", number = "2", pages = "337--359", day = "20", month = jul, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:16:35 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1992&volume=101&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1992&volume=101&issue=2&aid=1136", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240P (Parallel programming and algorithm theory)", conflocation = "Leicester, UK; 23-25 July 1990", conftitle = "International BCS-FACS Workshop on Semanics for Concurrency", 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 = "collapses; collapsing execution histories; conditional commutativity; conditional independence; conditional traces; predicates; program verification; theorem proving; trace semantics", pubcountry = "Netherlands", sponsororg = "S.E.R.C", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Grue:1992:MT, author = "Klaus Grue", title = "Map theory", journal = j-THEOR-COMP-SCI, volume = "102", number = "1", pages = "1--134", day = "03", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:16:37 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1992&volume=102&issue=1; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1992&volume=102&issue=1&aid=1169", acknowledgement = ack-nhfb, classification = "C4200 (Computer theory); C4240P (Parallel programming and algorithm theory)", corpsource = "DIKU, Copenhagen Univ., Denmark", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "category; computation theory; computer programming language; consistency proof; lambda-calculus; map theory; mathematics; mechanical procedures; natural subset; programming theory; set theory; truth; ZFC set theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", xxpages = "1--133", } @Article{VanBakel:1992:CRI, author = "S. {Van Bakel}", title = "Complete restrictions of the intersection type discipline", journal = j-THEOR-COMP-SCI, volume = "102", number = "1", pages = "135--163", day = "03", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110 (Systems analysis and programming)", corpsource = "Dept. of Inf., Fac. of Math. and Inf., Nijmegen Univ., Netherlands", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complete restrictions; filter lambda I-model; filter lambda model; functional programming; inference mechanisms; inference semantics; intersection type discipline; programming theory; strict type assignment system", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Devillers:1992:MPB, author = "R. Devillers", title = "Maximality preserving bisimulation", journal = j-THEOR-COMP-SCI, volume = "102", number = "1", pages = "165--183", day = "03", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240P (Parallel programming and algorithm theory); C6110B (Software engineering techniques)", corpsource = "Lab. d'Inf. Theorique, Univ. Libre de Bruxelles, Belgium", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "action refinements; concurrency control; concurrent systems; formal specification; invisible actions; labelled P/T nets; maximality preserving bisimulation; Petri nets; prime event structures; process graphs; program verification; specification", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Esparza:1992:PTA, author = "J. Esparza and M. Silva", title = "A polynomial-time algorithm to decide liveness of bounded free choice nets", journal = j-THEOR-COMP-SCI, volume = "102", number = "1", pages = "185--205", day = "03", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4240P (Parallel programming and algorithm theory)", corpsource = "Inst. fur Inf., Hildesheim Univ., Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "bounded free choice nets; concurrency control; deadlocks; linear algebraic calculation; linear programming; liveness; Petri nets; polynomial time algorithm; program verification; traps", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Dosen:1992:NCL, author = "K. Dosen", title = "Nonmodal classical linear predicate logic is a fragment of intuitionistic linear logic", journal = j-THEOR-COMP-SCI, volume = "102", number = "1", pages = "207--214", day = "03", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Matematicki Inst., Beograd, Yugoslavia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "additive disjunction; BCK logic; existential quantifier; formal logic; intuitionistic linear logic; multiplicative conjunction; negation; nonmodal classical linear first-order predicate logic; propositional constants", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bruschi:1992:SSP, author = "D. Bruschi", title = "Strong separations of the polynomial hierarchy with oracles: constructive separations by immune and simple sets", journal = j-THEOR-COMP-SCI, volume = "102", number = "2", pages = "215--252", day = "10", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Sci. dell'Inf., Milano Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; constant-depth circuits; constructive separations; immune sets; lower bounds; oracle separation; polynomial hierarchy; relativized polynomial-time hierarchy; set theory; simple sets", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Skubiszewski:1992:BPS, author = "M. Skubiszewski", title = "Binary periodic synchronizing sequences", journal = j-THEOR-COMP-SCI, volume = "102", number = "2", pages = "253--281", day = "10", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "B0260 (Optimisation techniques); B6120B (Codes); B6140 (Signal processing and detection); C1180 (Optimisation techniques); C1260 (Information theory)", corpsource = "Paris Res. Lab., Digital Equipment Corp., Rueil-Malmaison, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "binary periodic synchronizing sequences; circular permutations; codes; correlation theory; Hamming distances; images; maximal-period linear recurring sequences; reverse autodistance; simulated annealing; upper bound; words", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Dagum:1992:APG, author = "P. Dagum and M. Luby", title = "Approximating the permanent of graphs with large factors", journal = j-THEOR-COMP-SCI, volume = "102", number = "2", pages = "283--305", day = "10", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Med. Comput. Sci. Group, Stanford Univ., CA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "approximate counting; approximation algorithm; approximation theory; bipartite graph; complexity; computational complexity; edge disjoint perfect matchings; exact counting problem; factor size; graph theory; permanent; simple algorithm", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Mirwald:1992:MCQ, author = "R. Mirwald and C. P. Schnorr", title = "The multiplicative complexity of quadratic {Boolean} forms", journal = j-THEOR-COMP-SCI, volume = "102", number = "2", pages = "307--328", day = "10", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4140 (Linear algebra); C4210 (Formal logic); C4230 (Switching theory); C4240 (Programming and algorithm theory)", corpsource = "Fachbereich Math./Inf., Frankfurt Univ., Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "associated matrix; basis; Boolean function; Boolean functions; circuits; computational complexity; computational independence; gates; isomorphic; linear isomorphism; matrix algebra; minimal number; multiplicative complexity; quadratic Boolean forms; rank", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Halpenny:1992:CMS, author = "Liam Halpenny and Christopher J. Smyth", title = "A classification of minimal standard-path $2\times2$ switching networks", journal = j-THEOR-COMP-SCI, volume = "102", number = "2", pages = "329--354", day = "10", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:16:39 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1992&volume=102&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1992&volume=102&issue=2&aid=1227", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection)", corpsource = "Dept. of Math., Edinburgh Univ., UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "coin game; connection path; matches; minimal standard-path 2*2 switching networks; multiprocessor interconnection networks; solitaire game; spiral structure; staged networks; staged planar networks; standard path; switching theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Prasad:1992:AEN, author = "L. Prasad and S. S. Iyengar", title = "An asymptotic equality for the number of necklaces in a shuffle-exchange network", journal = j-THEOR-COMP-SCI, volume = "102", number = "2", pages = "355--365", day = "10", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4230M (Multiprocessor interconnection); C4240P (Parallel programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "asymptotic equality; bounds; computational complexity; multiprocessor interconnection networks; necklaces; parallel algorithms; shuffle-exchange network; VLSI problems", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Choffrut:1992:E, author = "C. Choffrut and Th Lengaur", title = "Editorial", journal = j-THEOR-COMP-SCI, volume = "103", number = "1", pages = "1--??", day = "24", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Fri Nov 21 19:16:33 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", } @Article{Beigel:1992:CCT, author = "R. Beigel and J. Gill", title = "Counting classes: thresholds, parity, mods, and fewness", journal = j-THEOR-COMP-SCI, volume = "103", number = "1", pages = "3--23", day = "24", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", conflocation = "Rouen, France; 22-24 Feb. 1990", conftitle = "STACS 90. 7th Annual Symposium on Theoretical Aspects of Computer Science", corpsource = "Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "accepting computations; closure properties; complexity theory; computational complexity; counting classes; fewness; mods; nondeterministic polynomial-time Turing machines; NP machine; parity; thresholds; Turing machines", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Cai:1992:GII, author = "Jin-Yi Cai and A. Condon and R. J. Lipton", title = "On games of incomplete information", journal = j-THEOR-COMP-SCI, volume = "103", number = "1", pages = "25--38", day = "24", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", conflocation = "Rouen, France; 22-24 Feb. 1990", conftitle = "STACS 90. 7th Annual Symposium on Theoretical Aspects of Computer Science", corpsource = "Dept. of Comput. Sci., Princeton Univ., NJ, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Boolean function; Boolean functions; free game; game theory; games of incomplete information; multiprover interactive proof systems; theorem proving; two-person games", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Clerbout:1992:SAL, author = "M. Clerbout and Y. Roos", title = "Semicommutations and algebraic languages", journal = j-THEOR-COMP-SCI, volume = "103", number = "1", pages = "39--49", day = "24", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", conflocation = "Rouen, France; 22-24 Feb. 1990", conftitle = "STACS 90. 7th Annual Symposium on Theoretical Aspects of Computer Science", corpsource = "LIFL Univ. de Lille 1, Villeneuve d'Ascq, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic languages; decidability; decidable necessary and sufficient condition; formal languages; rational language; semiconductors", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Corradini:1992:ASS, author = "A. Corradini and U. Montanari", title = "An algebraic semantics for structured transition systems and its applications to logic programs", journal = j-THEOR-COMP-SCI, volume = "103", number = "1", pages = "51--106", day = "24", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)C4210 (Formal logic); C6110L (Logic programming)", conflocation = "Rouen, France; 22-24 Feb. 1990", conftitle = "STACS 90. 7th Annual Symposium on Theoretical Aspects of Computer Science", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "algebraic semantics; arrows; concurrency; equivalence classes; formal logic; formalism; formalisms; free model; grammars; induced transition system; logic programming; logic programs; parallel refutations; Petri nets; phrase structure grammars; structured transition systems", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", xxtitle = "An algebraic semantics for structured transition systems and its application to logic programs", } @Article{Das:1992:MVH, author = "G. Das and D. Joseph", title = "Minimum vertex hulls for polyhedral domains", journal = j-THEOR-COMP-SCI, volume = "103", number = "1", pages = "107--135", day = "24", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C4260 (Computational geometry)", conflocation = "Rouen, France; 22-24 Feb. 1990", conftitle = "STACS 90. 7th Annual Symposium on Theoretical Aspects of Computer Science", corpsource = "Memphis State Univ., TN, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "approximations; computational complexity; computational geometry; exact algorithms; maximum vertex hulls; NP-hard; object approximations; pairwise disjoint polygons; polyhedral domains; vertices", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Lambert:1992:SSC, author = "J. L. Lambert", title = "Sorting the sums $(x_i+y_j)$ in {$O(n^2)$} comparisons", journal = j-THEOR-COMP-SCI, volume = "103", number = "1", pages = "137--141", day = "24", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C6130 (Data handling techniques)", conflocation = "Rouen, France; 22-24 Feb. 1990", conftitle = "STACS 90. 7th Annual Symposium on Theoretical Aspects of Computer Science", corpsource = "Dept. de Math. et Inf., Univ. de Paris-Nord, Villetaneuse, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "search problems; sequences of numbers; sorting; sums", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", xxnote = "Check title??", } @Article{Thomas:1992:ITA, author = "W. Thomas", title = "Infinite trees and automaton-definable relations over omega-words", journal = j-THEOR-COMP-SCI, volume = "103", number = "1", pages = "143--159", day = "24", month = aug, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4220 (Automata theory)", conflocation = "Rouen, France; 22-24 Feb. 1990", conftitle = "STACS 90. 7th Annual Symposium on Theoretical Aspects of Computer Science", corpsource = "Inst. f{\"u}r Inf. und Praktische Math., Kiel Univ., Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; automaton-definable relations; decidability; decidable; formal languages; infinite trees; k-ary tree; logical characterization; monadic second-order logic; omega-words; tree languages; trees (mathematics); weak chain logic", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bauderon:1992:IHI, author = "Michel Bauderon", title = "Infinite hypergraphs {II}. {Systems} of recursive equations", journal = j-THEOR-COMP-SCI, volume = "103", number = "2", pages = "165--190", day = "14", month = sep, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:16:41 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1992&volume=103&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1992&volume=103&issue=2&aid=1055", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Lab. Bordelais de Recherche en Inf., Bordeaux I Univ., Talence, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "context-free grammars; context-free graphs; equational hypergraphs; graph theory; hypergraphs; recursive equations", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hamaguchi:1992:RTL, author = "Kiyoharu Hamaguchi and Hiromi Hiraishi and Shuzo Yajima", title = "$\infty$-Regular temporal logic and its model checking problem", journal = j-THEOR-COMP-SCI, volume = "103", number = "2", pages = "191--204", day = "14", month = sep, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:16:41 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1992&volume=103&issue=2; http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1992&volume=103&issue=2&aid=1148", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory); C4240 (Programming and algorithm theory); C6110B (Software engineering techniques)", corpsource = "Dept. of Inf. Sci., Kyoto Univ., Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "complexity; computational complexity; design errors; fairness; finite automata; finite state machines; formal specification; formal verification; infinitary regular temporal logic; infinite sequences; infinity-regular temporal logic; logic design; logic design verification; logic testing; model checking problem; specification languages; temporal logic", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Palopoli:1992:TLP, author = "L. Palopoli", title = "Testing logic programs for local stratification", journal = j-THEOR-COMP-SCI, volume = "103", number = "2", pages = "205--234", day = "14", month = sep, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110L (Logic programming); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Dipartimento di Elettronica, Inf. e Sistemistica, Calabria Univ., Rende, Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "declarative semantics; fixpoint semantics; formal proof; local stratification; locally stratified programs; logic programming; logic programs testing; program testing; undecidability", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Felleisen:1992:RRS, author = "M. Felleisen and R. Hieb", title = "The revised report on the syntactic theories of sequential control and state", journal = j-THEOR-COMP-SCI, volume = "103", number = "2", pages = "235--271", day = "14", month = sep, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory); C6140 (Programming languages)", corpsource = "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "Church--Rosser; equational reasoning; equivalence relations; formal languages; formal logic; fully compatible equational theories; functional programs; higher-order languages; imperative programming; programming languages; programming theory; sequential control; standardization theorems; state; syntactic theories", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Kurihara:1992:MST, author = "M. Kurihara and A. Ohuchi", title = "Modularity of simple termination of term rewriting systems with shared constructors", journal = j-THEOR-COMP-SCI, volume = "103", number = "2", pages = "273--282", day = "14", month = sep, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Inf. Eng., Hokkaido Univ., Sapporo, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "modularity; rewriting systems; shared constructors; term rewriting systems; termination", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Kim:1992:NSM, author = "Byeong Man Kim and Jung Wan Cho", title = "A new subsumption method in the connection graph proof procedure", journal = j-THEOR-COMP-SCI, volume = "103", number = "2", pages = "283--309", day = "14", month = sep, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "