Results 51 to 60 of about 45,230 (224)
Automatic functions, linear time and learning [PDF]
Logical Methods in Computer Science, 2013 The present work determines the exact nature of {\em linear time computable} notions which characterise automatic functions (those whose graphs are recognised by a finite automaton). The paper also determines which type of linear time notions permit full
John Case +3 more
doaj +1 more source
Formal Languages in Dynamical Systems [PDF]
, 1993 We treat here the interrelation between formal languages and those dynamical systems that can be described by cellular automata (CA). There is a well-known injective map which identifies any CA-invariant subshift with a central formal language.
Troll, G.
core +1 more source
Cognitive Behavioral Therapy for Youth With Childhood‐Onset Lupus: A Randomized Clinical Trial
Arthritis Care &Research, EarlyView.Objective Our objective was to determine the feasibility and acceptability of the Treatment and Education Approach for Childhood‐Onset Lupus (TEACH), a six‐session cognitive behavioral intervention addressing depressive, fatigue, and pain symptoms, delivered remotely to individual youth with lupus by a trained interventionist.
Natoshia R. Cunningham +29 more
wiley +1 more source
Teaching push-down automata and Turing machines [PDF]
, 2014 In this paper we present the new version of a tool to assist in teaching formal languages and automata theory. In the previous version the tool provided algorithms for regular expressions, finite automata and context free grammars. The new version can
García-Osorio, César +3 more
core
Arthritis Care &Research, EarlyView.Objective We developed a novel electronic health record sidecar application to visualize key rheumatoid arthritis (RA) outcomes, including disease activity, physical function, and pain, via a patient‐facing graphical interface designed for use during outpatient visits (“RA PRO dashboard”).
Gabriela Schmajuk +16 more
wiley +1 more source
Highly Undecidable Problems For Infinite Computations [PDF]
, 2009 We show that many classical decision problems about 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are $\Pi_2^1$-complete, hence located at the second level of the analytical hierarchy, and "highly undecidable".
Finkel, Olivier
core +6 more sources
Advanced Engineering Materials, EarlyView.The documentation of component manufacture has become an essential part of today's production processes, especially for the analysis and optimization of production or component design with regard to structural performance, economic efficiency, and sustainability.
Björn Denker +4 more
wiley +1 more source
Adaptive Intelligent Tutoring System for learning Computer Theory [PDF]
, 2017 In this paper, we present an intelligent tutoring system developed to help students in learning Computer Theory. The Intelligent tutoring system was built using ITSB authoring tool.
Abu Naser, Samy S. +1 more
core
Representing Hybrid Automata by Action Language Modulo Theories
, 2017 Both hybrid automata and action languages are formalisms for describing the evolution of dynamic systems. This paper establishes a formal relationship between them.
Lee, Joohyung +2 more
core +1 more source
Advanced Engineering Materials, EarlyView.This article presents the NFDI‐MatWerk Ontology (MWO), a Basic Formal Ontology‐based framework for interoperable research data management in materials science and engineering (MSE). Covering consortium structures, research data management resources, services, and instruments, MWO enables semantic integration, Findable, Accessible, Interoperable, and ...
Hossein Beygi Nasrabadi +4 more
wiley +1 more source