Entry Gruska:1997:SDS from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Gruska:1997:SDS,
  author =       "Jozef Gruska and Angelo Monti and Margherita Napoli
                 and Domenico Parente",
  title =        "Succinctness of descriptions of {SBTA}-languages",
  journal =      j-THEOR-COMP-SCI,
  volume =       "179",
  number =       "1--2",
  pages =        "251--271",
  day =          "01",
  month =        jun,
  year =         "1997",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:57 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=179&issue=1-2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=179&issue=1-2&aid=2336",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C1180
                 (Optimisation techniques); C4210L (Formal languages and
                 computational linguistics); C4220 (Automata theory);
                 C4240C (Computational complexity); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Inst. of Math., Slovak Acad. of Sci., Bratislava,
                 Slovakia",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "binary tree networks; Boolean functions; Boolean
                 operations; complement; computational complexity; dense
                 hierarchies; description succinctness; deterministic
                 automata; deterministic finite automata; finite
                 automata; formal languages; graph grammars;
                 intersection; lower bounds; memoryless processors;
                 minimisation; minimization; one-way parallel
                 computations; parallel algorithms; regular languages;
                 SBTA languages; state complexity; systolic arrays;
                 systolic binary tree automata; trees (mathematics);
                 union",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries