Results 51 to 60 of about 1,641 (261)

Finite Automata with Generalized Acceptance Criteria [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2001
We examine the power of nondeterministic finite automata with acceptance of an input word defined by a leaf language, i.e., a condition on the sequence of leaves in the automaton's computation tree.
Timo Peichl, Heribert Vollmer
doaj   +3 more sources

Bimorphisms and synchronous grammars

open access: yesJournal of Language Modelling, 2014
We tend to think of the study of language as proceeding by characterizing the strings and structures of a language, and we think of natural language processing as using those structures to build systems of utility in manipulating the language.
Stuart M. Shieber
doaj   +1 more source

Bottom-up automata on data trees and vertical XPath [PDF]

open access: yesLogical Methods in Computer Science, 2017
A data tree is a finite tree whose every node carries a label from a finite alphabet and a datum from some infinite domain. We introduce a new model of automata over unranked data trees with a decidable emptiness problem.
Diego Figueira, Luc Segoufin
doaj   +1 more source

Investigation of Resonance Characteristics of More Than 10 000 Metal‐Coated Silicon MEMS Cantilevers Using Machine Learning

open access: yesAdvanced Engineering Materials, EarlyView.
More than 10 000 metal‐coated silicon MEMS cantilevers are fabricated and characterized to build a large‐scale experimental dataset spanning multiple vibrational modes. Machine learning algorithms are benchmarked to predict resonance frequency and quality factor, with ensemble based models achieving accuracy approaching experimental uncertainty.
Sina Zare Pakzad   +8 more
wiley   +1 more source

Wearable Smart Patches on Sustainable Chitosan With Reversible Microbial Growth‐Inhibitory Properties

open access: yesAdvanced Functional Materials, EarlyView.
ABSTRACT Chitosan, a polysaccharide upcycled from biowaste, has long promised sustainable, biocompatible, and antimicrobial films and devices, an appeal reinforced by its recent regulatory recognition, with several chitosan‐based antibacterial dressings gaining clearance through the Food and Drug Administration's 510(k) pathway.
Jacopo Nicoletti   +16 more
wiley   +1 more source

Optoelectronic Synaptic Devices Using Molecular Telluride Phase‐Change Inks for Three‐Factor Learning

open access: yesAdvanced Functional Materials, EarlyView.
Optoelectronic synaptic devices based on solution‐processed molecular telluride GST‐225 phase‐change inks are demonstrated for three‐factor learning. A global optical signal broadcast through a silicon waveguide induces non‐volatile conductance updates exclusively in locally electrically flagged memristors.
Kevin Portner   +14 more
wiley   +1 more source

Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective [PDF]

open access: yesLogical Methods in Computer Science, 2017
Notions of simulation, among other uses, provide a computationally tractable and sound (but not necessarily complete) proof method for language inclusion.
Natsuki Urabe, Ichiro Hasuo
doaj   +1 more source

Intracrystalline Void‐Mediated Toughening of Brittle Crystals in Quail Eggshells

open access: yesAdvanced Functional Materials, EarlyView.
In quail eggshells, the high density and disordered arrangement of intracrystalline voids inhibit lattice cleavage, suppress long‐range crack propagation, and promote deformation twinning and quasi‐plasticity, serving as an essential toughening motif. We show that these voids remain within a narrow subcritical size range and therefore predominantly do ...
Jingxiao Zhong   +16 more
wiley   +1 more source

Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories [PDF]

open access: yesLogical Methods in Computer Science, 2013
We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequality constraints (TAGED) of Filiot et al. (2007).
Luis Barguñó   +4 more
doaj   +1 more source

FINITE TREE AUTOMATA ON INFINITE TREES [PDF]

open access: yesBulletin of informatics and cybernetics, 1985
For finite automata on infinite words or trees there are several natural ways to define acceptance. Compared to the cases of finite words or trees the situation is further complicated by the fact that nondeterminism properly increases the recognition power of automata. The authors have set out to clarify the relationships between six modes of accepting
Hayashi, Takeshi, Miyano, Satoru
openaire   +2 more sources

Home - About - Disclaimer - Privacy