Results 81 to 90 of about 23,120 (273)

Nondeterministic Automata and JSL-dfas

open access: yesCoRR, 2020
We introduce the category of dependency automata. A dependency automaton consists of two nondeterministic finite automata, with a relation between their states satisfying conditions. This category is equivalent to deterministic finite automata interpreted in join-semilattices i.e. JSL-dfas.
openaire   +2 more sources

Dynamic Financial Analysis - Understanding Risk and Value Creation in Insurance [PDF]

open access: yes
The changing business environment in non-life insurance and reinsurance has raised the need for new quantitative methods to analyze the impact of various types of strategic decisions on a company’s bottom line.
Michel Dacorogna, Peter Blum
core  

Prior anterior cruciate ligament reconstruction: Comparable outcomes but reduced knee flexion after robotic functionally aligned total knee arthroplasty

open access: yesKnee Surgery, Sports Traumatology, Arthroscopy, EarlyView.
Abstract Purpose Total knee arthroplasty (TKA) after anterior cruciate ligament reconstruction (ACLR) is technically demanding and has been associated with higher complication rates. This study aimed to evaluate whether patients with prior ACLR undergoing image‐based robotic‐assisted TKA performed under functional alignment (FA) principles achieve ...
Christos Koutserimpas   +6 more
wiley   +1 more source

The state complexity of random DFAs

open access: yesTheoretical Computer Science, 2016
The state complexity of a Deterministic Finite-state automaton (DFA) is the number of states in its minimal equivalent DFA. We study the state complexity of random $n$-state DFAs over a $k$-symbol alphabet, drawn uniformly from the set $[n]^{[n]\times[k]}\times2^{[n]}$ of all such automata. We show that, with high probability, the latter is $α_k n + O(\
Daniel Berend, Aryeh Kontorovich
openaire   +3 more sources

DFA design

open access: yes, 2004
Verkefnið er lokaðWe have studied course Virtual Machine Languages on last semester. And one of the main topics of this course was deterministic finite automata (DFA).
Egorova, Elena Revolievna
core  

Legal Issues in the Regulation of Accounting for Digital Financial Assets in Russia

open access: yesЦифровое право
The relevance of this study stems from the rapid development of the digital financial assets market in the Russian Federation against the backdrop of insufficiently developed accounting principles, which generates legal risks for market participants and ...
D. A. Nigmatzyanova
doaj   +1 more source

Respostas pós-colheita de abacaxi 'Pérola' no tratamento com calor e armazenagem refrigerada

open access: yesRevista Brasileira de Fruticultura, 2014
Este trabalho teve como objetivo avaliar o efeito de diferentes temperaturas de armazenamento e do tratamento inicial a 40 ºC, por 24 horas, na preservação de abacaxis 'Pérola'.
Rosilene Ferreira Souto   +4 more
doaj   +1 more source

High‐Temporal‐Resolution Monitoring of Creatine and Phosphocreatine Dynamics in Skeletal Muscle Using Ultrafast Z‐Spectroscopy (UFZ) CEST MRI at 3T

open access: yesMagnetic Resonance in Medicine, EarlyView.
ABSTRACT Purpose To evaluate the feasibility of High‐Temporal‐Resolution (HTR) Ultrafast Z‐spectrum (UFZ) CEST MRI for monitoring the dynamic fluctuations of phosphocreatine (PCr) and creatine (Cr) in human skeletal muscle (SM) at 3 T during and after exercise.
Licheng Ju   +6 more
wiley   +1 more source

Narrazione, affettività e riflessività nella formazione dei docenti: Un laboratorio per la gestione educativa degli allievi sfidanti

open access: yesFormazione & Insegnamento
Il contributo presenta un’esperienza laboratoriale sviluppata nell’ambito del corso opzionale Relazione e condotte affettive: dalla teoria alla pratica, rivolto a futuri docenti della scuola dell’infanzia e primaria presso il Dipartimento Formazione ...
Paolo Arru, Veronica Simona Benhamza
doaj   +1 more source

Prefix Sorting DFAs: a Recursive Algorithm

open access: yesCoRR, 2023
In the past thirty years, numerous algorithms for building the suffix array of a string have been proposed. In 2021, the notion of suffix array was extended from strings to DFAs, and it was shown that the resulting data structure can be built in $ O(m^2 + n^{5/2}) $ time, where $ n $ is the number of states and $ m $ is the number of edges [SODA 2021].
openaire   +4 more sources

Home - About - Disclaimer - Privacy