نتایج جستجو برای: mcnaughton function

تعداد نتایج: 1213156  

Journal: :J. Field Robotics 2008
Chris Urmson Joshua Anhalt J. Andrew Bagnell Christopher R. Baker Robert Bittner M. N. Clark John M. Dolan David Duggins Tugrul Galatali Christopher Geyer Michele Gittleman Sam Harbaugh Martial Hebert Thomas M. Howard Sascha Kolski Alonzo Kelly Maxim Likhachev Matthew McNaughton Nick Miller Kevin M. Peterson Brian Pilnick Ragunathan Rajkumar Paul E. Rybski Bryan Salesky Young-Woo Seo Sanjiv Singh Jarrod M. Snider Anthony Stentz William Whittaker Ziv Wolkowicki Jason Ziglar Hong Bae Thomas Brown Daniel Demitrish Bakhtiar Litkouhi Jim Nickolaou Varsha Sadekar Wende Zhang Joshua Struble Michael Taylor Michael Darms Dave Ferguson

Chris Urmson, Joshua Anhalt, Drew Bagnell, Christopher Baker, Robert Bittner, M. N. Clark, John Dolan, Dave Duggins, Tugrul Galatali, Chris Geyer, Michele Gittleman, Sam Harbaugh, Martial Hebert, Thomas M. Howard, Sascha Kolski, Alonzo Kelly, Maxim Likhachev, Matt McNaughton, Nick Miller, Kevin Peterson, Brian Pilnick, Raj Rajkumar, Paul Rybski, Bryan Salesky, Young-Woo Seo, Sanjiv Singh, Jarro...

Journal: :Journal of the American Chemical Society 2007
Brian R McNaughton Peter C Gareiss Benjamin L Miller

Frameshift-Inducing Stem-Loop RNA from an 11,325 Member Resin Bound Dynamic Combinatorial Library Brian R. McNaughton,†,§ Peter C. Gareiss,¶,§ and Benjamin L. Miller*,‡,¶,§ Departments of Dermatology, Biochemistry and Biophysics, and Chemistry, and the Center for Future Health, UniVersity of Rochester, Rochester, New York 14642 Received March 26, 2007; E-mail: [email protected]...

Journal: :CoRR 2010
Andrea Asperti Claudio Sacerdoti Coen Enrico Tassi

We introduce a new technique for constructing a finite state deterministic automaton from a regular expression, based on the idea of marking a suitable set of positions inside the expression, intuitively representing the possible points reached after the processing of an initial prefix of the input string. Pointed regular expressions join the elegance and the symbolic appealingness of Brzozowsk...

2015
JASVINDER A. SINGH KENNETH G. SAAG ELIE A. AKL RAVEENDHARA R. BANNURU MATTHEW C. SULLIVAN ELIZAVETA VAYSBROT CHRISTINE MCNAUGHTON MIKALA OSANI ROBERT H. SHMERLING JEFFREY R. CURTIS DANIEL E. FURST DEBORAH PARKS ARTHUR KAVANAUGH JAMES O’DELL CHARLES KING AMYE LEONG ERIC L. MATTESON JOHN T. SCHOUSBOE BARBARA DREVLOW SETH GINSBERG JAMES GROBER E. WILLIAM ST.CLAIR ELIZABETH TINDALL AMY S. MILLER TIMOTHY MCALINDON Matthew C. Sullivan

JASVINDER A. SINGH, KENNETH G. SAAG, S. LOUIS BRIDGES JR., ELIE A. AKL, RAVEENDHARA R. BANNURU, MATTHEW C. SULLIVAN, ELIZAVETA VAYSBROT, CHRISTINE MCNAUGHTON, MIKALA OSANI, ROBERT H. SHMERLING, JEFFREY R. CURTIS, DANIEL E. FURST, DEBORAH PARKS, ARTHUR KAVANAUGH, JAMES O’DELL, CHARLES KING, AMYE LEONG, ERIC L. MATTESON, JOHN T. SCHOUSBOE, BARBARA DREVLOW, SETH GINSBERG, JAMES GROBER, E. WILLIAM ...

2007
ALLAN BEVERIDGE

mentally ill with the creation of purpose-built asylums throughout the country. The Victorians were ambivalent in their reaction to the mentally dis turbed. Whilst they sought to segregate the insane from the rest of the population, they were also terri fied by the prospect of the wrongful confinement of sane people.2 The trial of Daniel McNaughton in 1843for the assassination of Sir Robert Pee...

Journal: :Theor. Comput. Sci. 1998
Marie-Pierre Béal Jean Senellart

The synchronization delay of an N-state local automaton is known to be O(N 2). It has been conjectured by S. Kim, R. McNaughton and R. McCloskey that, for deterministic local automata, it is O(N 1:5) on a two-letter alphabet and no less than O(N 2) in the general case. We prove that this conjecture is false and that the synchronization delay is (N 2) in all cases.

2011
Thomas Colcombet

The objective of this survey is to present the ideal theory of monoids, the so-called Green’s relations, and to illustrate the usefulness of this tool for solving automata related questions. We use Green’s relations for proving four classical results related to automata theory: The result of Schützenberger characterizing star-free languages, the theorem of factorization forests of Simon, the ch...

Journal: :Arch. Math. Log. 2008
J. Patricio Díaz Varela

Lukasiewicz implication algebras are the {→, 1}-subreducts of MV algebras. They are the algebraic counterpart of SuperLukasiewicz Implicational Logics. We give a description of free Lukasiewicz implication algebras in the context of McNaughton functions. More precisely, we show that the |X|-free Lukasiewicz implication algebra is isomorphic to ⋃ x∈X [xθ) for a certain congruence θ over the |X|-...

2008
Peter J. Rogers Katherine M. Appleton David Kessler Tim J. Peters David Gunnell Robert C. Hayward Susan V. Heatherley Leonie M. Christian Sarah A. McNaughton Andy R. Ness

Peter J. Rogers*, Katherine M. Appleton, David Kessler, Tim J. Peters, David Gunnell, Robert C. Hayward, Susan V. Heatherley, Leonie M. Christian, Sarah A. McNaughton and Andy R. Ness Department of Experimental Psychology, University of Bristol, UK Academic Unit of Primary Health Care, Department of Community Based Medicine, University of Bristol, UK Department of Social Medicine, University of...

Journal: :Theor. Comput. Sci. 2000
Alexander Moshe Rabinovich

An interpretation of star free expressions over the reals is provided. The expressive power of star free expressions is compared to the expressive power of monadic rst-order logic of order over the reals. It is proved that these formalisms have the same expressive power. This result provides a generalization of the classical McNaughton Papert theorem 3] from the nite orders to the order of the ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید