Results 41 to 50 of about 1,535,797 (279)
Anomaly Detection in Cyclic Communication in OT Protocols
Energies, 2022 This paper demonstrates the effectiveness of using anomaly detection in cyclic communication as a method aimed at protecting industrial installations from steganographic communication and a wide range of cyberattacks.
Milosz Smolarczyk +3 more
doaj +1 more source
A Novel Multi-step Finite-State Automaton for Arbitrarily Deterministic Tsetlin Machine Learning [PDF]
, 2020 Due to the high energy consumption and scalability challenges of deep learning, there is a critical need to shift research focus towards dealing with energy consumption constraints. Tsetlin Machines (TMs) are a recent approach to machine learning that has demonstrated significantly reduced energy usage compared to neural networks alike, while ...
Kuruge Darshana Abeyrathna +6 more
openaire +4 more sources
The \v Cerný conjecture for aperiodic automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 A word w is called a synchronizing (recurrent, reset, directable) word of a deterministic finite automaton (DFA) if w brings all states of the automaton to some specific state; a DFA that has a synchronizing word is said to be synchronizable.
A. N. Trahtman
doaj +1 more source
Visualizing a Nondeterministic to Deterministic Finite-State Machine Transformation [PDF]
, 2023 The transformation of a nondeterministic finite-state automaton into a deterministic finite-state automaton is an integral part of any course on formal languages and automata theory.
Minic, Tijana, Morazán, Marco T.
core +1 more source
Computing the Width of Non-deterministic Automata [PDF]
Logical Methods in Computer Science, 2019 We introduce a measure called width, quantifying the amount of nondeterminism in automata. Width generalises the notion of good-for-games (GFG) automata, that correspond to NFAs of width 1, and where an accepting run can be built on-the-fly on any ...
Denis Kuperberg, Anirban Majumdar
doaj +1 more source
Minimizing finite automata is computationally hard [PDF]
, 2002 It is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e., a DFA M can be converted to an equivalent DFA M' which has a minimal number of states. The minimization can be done efficiently [6].
Malcher, Andreas
core
Advanced Engineering Materials, EarlyView.Digitalizing electroplating requires both domain knowledge and interoperability. This work introduces PlatOn, a domain ontology for trivalent chromium plating and coating characterization, and a hybrid pipeline that aligns it to a mid‐level reference ontology by combining eight similarity metrics with language model reasoning. Expert‐validated mappings
Janik Harter +10 more
wiley +1 more source
Prikladnaya diskretnaya matematika, 2010 Summary: The article considers constructing minimal deterministic finite automaton recognizing a prefix-code of a given cardinality over the alphabet \(\{0,1\}\). The considered problem is proved to be equivalent to the problem of finding the shortest addition-chain ending with a given number.
Akishev, I. R., Dvorkin, M. È.
openaire +3 more sources
Advanced Engineering Materials, EarlyView.The OntOMat ontology establishes a structured framework for polymer matrix fiber reinforced composite materials, integrating manufacturing processes, characterization methods, and multiscale design through the VDI/VDE 3682 formalized process description standard.
Nicolas Christ +19 more
wiley +1 more source
Transductions Computed by One-Dimensional Cellular Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Cellular automata are investigated towards their ability to compute transductions, that is, to transform inputs into outputs. The families of transductions computed are classified with regard to the time allowed to process the input and to compute the ...
Martin Kutrib, Andreas Malcher
doaj +1 more source