Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Selmi:1996:TL, author = "Carla Selmi", title = "Over testable languages", journal = j-THEOR-COMP-SCI, volume = "161", number = "1--2", pages = "157--190", day = "15", month = jul, year = "1996", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:20:03 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=161&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=1996&volume=161&issue=1-2&aid=2041", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210L (Formal languages and computational linguistics); C4220 (Automata theory)", corpsource = "LITP, Paris VII Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "combinatorial description; commutative semigroup; finite automata; formal languages; generator family; grammars; group theory; locally idempotent semigroups; locally testable semigroups; over testable languages; piecewise testable; strongly locally testable", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }