Entry Fachini:1991:NCC 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{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",
}

Related entries