Results 11 to 20 of about 6,929,915 (302)
Separation for dot-depth two [PDF]
The dot-depth hierarchy of Brzozowski and Cohen classifies the star-free languages of finite words. By a theorem of McNaughton and Papert, these are also the first-order definable languages.
Thomas Place, Marc Zeitoun
doaj +1 more source
Fiestas, Saints and Spirituality: Collective Rituals as Community Eldercare in Andalusia
In this paper, I explore how spirituality and collective rituals influence eldercare in a small town in Andalusia, Spain. I describe how older people’s interactions with the town’s Virgin Mary statues generate personhood, situating the Virgin saints as ...
Chloë Place
doaj +1 more source
Place and time in the Criminology of Place [PDF]
This article evaluates developments in the ecological analysis of crime, which have found their most recent expression in a Criminology of Place. We argue that theoretical and methodological deficiencies are evident in the Criminology of Place and associated literatures with respect to their underlying treatment of place, time and causation.
Bannister, J, O'Sullivan, A, Bates, E
openaire +4 more sources
Separating regular languages with two quantifier alternations [PDF]
We investigate a famous decision problem in automata theory: separation. Given a class of language C, the separation problem for C takes as input two regular languages and asks whether there exists a third one which belongs to C, includes the first one ...
Thomas Place
doaj +1 more source
Stories, places: storied place and placed story
Stories, places: storied place and placed story . . . the universe is not simply a place but a story –a story in which we are immersed, to which we belong, and out of which we arose. –Brian Swimme & Mary Evelyn Tucker ABSTRACT For a while now I have been ‘wondering’ about, pondering the link between story and place, inhabitant and
openaire +2 more sources
A decidable characterization of locally testable tree languages [PDF]
A regular tree language L is locally testable if membership of a tree in L depends only on the presence or absence of some fix set of neighborhoods in the tree.
Thomas Place, Luc Segoufin
doaj +1 more source
An important endeavor in computer science is to understand the expressive power of logical formalisms over discrete structures, such as words. Naturally, "understanding" is not a mathematical notion.
Thomas Place, Marc Zeitoun
doaj +1 more source
Literature Searching for Evidence-Based Veterinary Medicine: Coping with Zero Hits
Emma Place gives a talk on how it can be common to get zero or low numbers of hits for a veterinary PICO search in bibliographic databases, particularly if results are screened for clinical trials...This is a podcast of Emma Place's talk at the ...
Emma Place
doaj +1 more source
Separating Regular Languages with First-Order Logic [PDF]
Given two languages, a separator is a third language that contains the first one and is disjoint from the second one. We investigate the following decision problem: given two regular input languages of finite words, decide whether there exists a first ...
Thomas Place, Marc Zeitoun
doaj +1 more source
Deciding definability in FO2(
We provide a decidable characterization of regular forest languages definable in FO2(
Thomas Place, Luc Segoufin
doaj +1 more source

