Entry Seidl:1992:SVT from tcs1990.bib

Last update: Wed Sep 26 02:11:46 MDT 2018                Valid HTML 4.0!

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{Seidl:1992:SVT,
  author =       "H. Seidl",
  title =        "Single-valuedness of tree transducers is decidable in
                 polynomial time",
  journal =      j-THEOR-COMP-SCI,
  volume =       "106",
  number =       "1",
  pages =        "135--181",
  day =          "30",
  month =        nov,
  year =         "1992",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:15:15 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 =   "Fachbereich Inf., Univ. des Saarlandes, Saarbrucken,
                 Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "bottom-up finite-state tree transducer; decidability;
                 decidable; finite automata; finite-valuedness; input
                 tree; normalizing transformations; polynomial time;
                 single-valued; submonoid of trees; tree transducers;
                 trees (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries