Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Pecuchet:1988:ESP,
author = "Jean-Pierre Pecuchet",
title = "Etude syntaxique des parties reconnaissables de mots
infinis. ({French}) [{Syntactic} study of rational
omega-languages of infinite words]",
journal = j-THEOR-COMP-SCI,
volume = "58",
number = "1-3",
pages = "231--248",
month = jun,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "CNRS",
affiliationaddress = "Mont-St.-Aignan, Fr",
classification = "721; C4210 (Formal logic); C4220 (Automata theory)",
conference = "Thirteenth International Colloquium on Automata,
Languages and Programming",
conflocation = "Rennes, France; 15-19 July 1986",
conftitle = "Thirteenth International Colloquium on Automata,
Languages and Programming",
corpsource = "CNRS LITP, Lab. d'Inf. de Rouen, Mont-Saint-Aignan,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "automata; automata theory; Automata Theory;
Decidability; formal languages; Formal Languages;
infinite words; locally testable languages; Locally
Testable Languages; piecewise testable languages;
Piecewise Testable Languages; Rational Omega Languages;
rational omega-languages; semigroups; Semigroups;
Syntax",
language = "French",
meetingaddress = "Rennes, Fr",
meetingdate = "Jul 1986",
meetingdate2 = "07/86",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "T Theoretical or Mathematical",
}