Entry Culik:1983:FLR from tcs1980.bib

Last update: Thu Sep 27 02:46:46 MDT 2018                Valid HTML 4.0!

Index sections

Top | 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{Culik:1983:FLR,
  author =       "K. Culik and J. Gruska and A. Salomaa",
  title =        "On a family of {L} languages resulting for systolic
                 tree automata",
  journal =      j-THEOR-COMP-SCI,
  volume =       "23",
  number =       "3",
  pages =        "231--242",
  month =        may,
  year =         "1983",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:36:07 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4220 (Automata theory)",
  corpsource =   "Dept. of Computer Sci., Univ. of Waterloo, Waterloo,
                 Ont., Canada",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "automata theory; Boolean operations; closure;
                 computability and decidability; context-free languages;
                 decidable equivalence problem; equivalence classes;
                 iZ-rational power series; L languages; natural
                 subfamily; open problems; systolic EOL languages;
                 systolic tree automata; trees (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries