Results 81 to 90 of about 43,033 (311)
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
Streamability of nested word transductions [PDF]
Logical Methods in Computer Science, 2019 We consider the problem of evaluating in streaming (i.e., in a single left-to-right pass) a nested word transduction with a limited amount of memory. A transduction T is said to be height bounded memory (HBM) if it can be evaluated with a memory that ...
Emmanuel Filiot +3 more
doaj +1 more source
Computational Modeling of Reticular Materials: The Past, the Present, and the Future
Advanced Materials, EarlyView.Reticular materials are advanced materials with applications in emerging technologies. A thorough understanding of material properties at operating conditions is critical to accelerate the deployment at an industrial scale. Herein, the status of computational modeling of reticular materials is reviewed, supplemented with topical examples highlighting ...
Wim Temmerman +3 more
wiley +1 more source
Compositions of nondeterministic automata(Semigroups, Formal Languages and Computer Systems) [PDF]
, 1996 Balázs Imreh
openalex +2 more sources
Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages [PDF]
Logical Methods in Computer ScienceA characteristic sample for a language $L$ and a learning algorithm $\textbf{L}$ is a finite sample of words $T_L$ labeled by their membership in $L$ such that for any sample $T \supseteq T_L$ consistent with $L$, on input $T$ the learning algorithm ...
Dana Angluin, Dana Fisman
doaj +1 more source
Regular Separability of One Counter Automata [PDF]
Logical Methods in Computer Science, 2019 The regular separability problem asks, for two given languages, if there exists a regular language including one of them but disjoint from the other.
Wojciech Czerwiński, Sławomir Lasota
doaj +1 more source
Advanced Optical Materials, EarlyView.Theoretical lessons are key for molecules presenting an inverted singlet‐triplet excited state (e.g. S1 and T1) energy difference. This perspective provides a snapshot of the role played by calculations in last years, not only to anticipate experimental findings but also for driving high‐throughput virtual screenings, as well as the main challenge to ...
Ángel José Pérez‐Jiménez +2 more
wiley +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
Reachability in Higher-Order-Counters
, 2013 Higher-order counter automata (\HOCS) can be either seen as a restriction of higher-order pushdown automata (\HOPS) to a unary stack alphabet, or as an extension of counter automata to higher levels.
A. Bouajjani +11 more
core +1 more source
Deciding the value 1 problem for probabilistic leaktight automata [PDF]
Logical Methods in Computer Science, 2015 The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close to 1?
Nathanaël Fijalkow +3 more
doaj +1 more source