Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Birget:1989:CIT,
author = "Jean-Camille Birget",
title = "Concatenation of inputs in a two-way automaton",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "2",
pages = "141--156",
month = feb,
year = "1989",
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 = "Univ of Nebraska",
affiliationaddress = "Lincoln, NE, USA",
classification = "721; C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Nebraska Univ., Lincoln, NE,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; concatenation; Concatenation of
Inputs; crossing sequence; Finite Automata; finite
automata; Input Strings; partial functions; quadruple;
Two Way Finite Automata; two-way automaton",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}