Results 141 to 150 of about 8,860,193 (293)

Faster Algorithm for Bisimulation Equivalence

open access: yes, 2008
. The fastest known algorithm for checking bisimulation equivalence of normed context-free processes worked in O(n13) time. We give an alternative algorithm working in O(n8polylog n) time, As a side effect we improve the best known upper bound for ...
Of Normed Context-free Processes
core  

Program equivalence and context-free grammars

open access: yes13th Annual Symposium on Switching and Automata Theory (swat 1972), 1972
Tree equivalence is a relation among polyadic recursion schemes. This relation is broad enough to be interesting: equivalent schemes may not be obviously equivalent and may still differ in computationally important ways. We show that this relation is also narrow enough to imply input-output equivalence.Is tree equivalence decidable?
openaire   +4 more sources

Stochastic Locomotion Emerging From Body–Environment Interactions in a Mexican Jumping Bean–Inspired Robot

open access: yesAdvanced Intelligent Systems, EarlyView.
Inspired by the Mexican jumping bean, this study presents a centimeter‐scale, electronics‐free robot that merges principles from both the animal and plant kingdoms. A thermo‐responsive actuator mimicking larval motion, enclosed within a uniquely shaped plant‐seed‐inspired shell, generates jumping, rolling, flipping, sliding, and climbing through ...
Ragesh Chellattoan   +3 more
wiley   +1 more source

A Task-driven Grammar Refactoring Algorithm

open access: yesActa Polytechnica, 2012
This paper presents our proposal and the implementation of an algorithm for automated refactoring of context-free grammars. Rather than operating under some domain-specific task, in our approach refactoring is perfomed on the basis of a refactoring task ...
Ivan Halupka   +2 more
doaj  

Défis pour l’enseignement des langues des signes en Europe : le projet BAG-Sign

open access: yesGlottopol
The BAG-Sign project, launched in 2023 for three years, aims to create pedagogical resources for teaching the grammar of five European sign languages (DGS, DSGS, ÖGS, LIS and LSF).
Marie-Anne Sallandre   +4 more
doaj   +1 more source

Redistributive land reforms, agricultural productivity, and structural change: New cross‐national evidence

open access: yesAmerican Journal of Agricultural Economics, EarlyView.
Abstract Large‐scale land reforms constitute a substantial redistribution of wealth and reallocation of agricultural land, which is a major form of asset and production input in developing countries. While land redistribution (from the rich to the poor) remains a highly controversial issue, extensive evidence on its effect is limited.
Devashish Mitra   +3 more
wiley   +1 more source

1‐Azabicyclo[1.1.0]butanes (ABBs) on the Map: Mechanistic Pathways for Catalytic Ring Opening and Functionalizations

open access: yesAngewandte Chemie, EarlyView.
Catalytic strain‐release ring opening and functionalizations of 1‐azabicyclo[1.1.0]butanes (ABBs) represent a promising strategy for accessing diverse azetidine products. These transformations proceed via polar pathways, radical pathways, and hybrid mechanisms that combine both.
James Shao‐Jiun Yang   +1 more
wiley   +2 more sources

A synchronous context free grammar for time normalization. [PDF]

open access: yesProc Conf Empir Methods Nat Lang Process, 2013
Bethard S.
europepmc   +1 more source

The Insistence of Blackness and the Persistence of Antiblackness in Ireland

open access: yesAustralian Journal of Social Issues, EarlyView.
ABSTRACT This paper positions Ireland as a critical site for examining the insistence of blackness and an antiblackness created and sustained through Irish ethnonationalist imaginaries and exclusionary processes. Drawing on connected sociologies and Irish Black Studies, this enquiry argues that antiblackness in Ireland operates as a generational force,
Philomena Mullen
wiley   +1 more source

Parsing for Semidirectional Lambek Grammar is NP-Complete

open access: yes, 1996
We study the computational complexity of the parsing problem of a variant of Lambek Categorial Grammar that we call semidirectional. In semidirectional Lambek calculus SDL there is an additional nondirectional abstraction rule allowing the formula ...
Jochen Dörre   +2 more
core  

Home - About - Disclaimer - Privacy