Results 1 to 10 of about 212,073 (195)

Separation for dot-depth two [PDF]

open access: yesLogical Methods in Computer Science, 2021
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

open access: yesAnthropology & Aging, 2022
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

Separating regular languages with two quantifier alternations [PDF]

open access: yesLogical Methods in Computer Science, 2018
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

Razlike v plačah in zaposlovanju med spoloma v dejavnostih javne uprave

open access: yesCentral European Public Administration Review, 2003
Glavni namen analize v tem članku je bil ugotoviti, ali (in kako) se kažejo razlike pri obravnavanju moških in žensk v javni upravi oz. ali lahko ugotovimo manjšo diskriminacijo zaposlenih žensk v javni upravi kot v celotnem gospodarstvu.
Janko Seljak
doaj   +1 more source

Minimum wage [PDF]

open access: yes, 2013
Namen prispevka je prikazati pomen in cilje minimalne plače in umestiti slovensko ureditev minimalne plače v kontekst Evropske unije. Minimalna plača je v eni od oblik prisotna v vseh državah članicah EU, v večini držav, tudi v Sloveniji, pa je urejena ...
Laporšek, Suzana
core   +2 more sources

A decidable characterization of locally testable tree languages [PDF]

open access: yesLogical Methods in Computer Science, 2011
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

Deciding definability in FO2( [PDF]

open access: yesLogical Methods in Computer Science, 2015
We provide a decidable characterization of regular forest languages definable in FO2(
Thomas Place, Luc Segoufin
doaj   +1 more source

The funeral laments (pohrebné plače) of the Slovak community in Serbia [PDF]

open access: yesMuzikologija
This study discusses the funeral laments (pohrebné plače or pohrebné nariekanie in Slovak) of the Slovak ethnic minority in Srem, Vojvodina, Repub­lic of Serbia.
Lomen Kristina
doaj   +1 more source

Separating Regular Languages with First-Order Logic [PDF]

open access: yesLogical Methods in Computer Science, 2016
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

Literature Searching for Evidence-Based Veterinary Medicine: Coping with Zero Hits

open access: yesVeterinary Evidence, 2016
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

Home - About - Disclaimer - Privacy