Results 1 to 10 of about 5,611,476 (304)
ioco theory for probabilistic automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Model-based testing (MBT) is a well-known technology, which allows for automatic test case generation, execution and evaluation. To test non-functional properties, a number of test MBT frameworks have been developed to test systems with real-time ...
Marcus Gerhold, Mariëlle Stoelinga
doaj +6 more sources
Elementary definability of the class of universal hypergraphic automata in the class of semigroups [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2022 Hypergraphic automata are automata, state sets and output symbol sets of which are hypergraphs, being invariant under actions of transition and output functions. Universally attracting objects in the category of hypergraphic automata are called universal
Molchanov, Vladimir Aleksandrovich +1 more
doaj +1 more source
Residuality and Learning for Nondeterministic Nominal Automata [PDF]
Logical Methods in Computer Science, 2022 We are motivated by the following question: which data languages admit an active learning algorithm? This question was left open in previous work by the authors, and is particularly challenging for languages recognised by nondeterministic automata.
Joshua Moerman, Matteo Sammartino
doaj +1 more source
Cryptography using Automata Theory [PDF]
ITM Web of Conferences, 2022 Encryption and decryption are the two most crucial components of cryptography. Data protection is the main objective of both systems. We utilised encryption to transform plain text into ciphertext.
Vayadande Kuldeep +4 more
doaj +1 more source
Composite Neutrosophic Finite Automata [PDF]
Neutrosophic Sets and Systems, 2020 The idea behind the neutrosophic set is we can connect the concept by dynamics of opposite interacts and its neutral that are uncertain and get common parts.
J. Kavikumar +4 more
doaj +1 more source
On the Theory of Stochastic Automata
CoRR, 2021 The theory of discrete stochastic systems has been initiated by the work of Shannon and von Neumann. While Shannon has considered memory-less communication channels and their generalization by introducing states, von Neumann has studied the synthesis of reliable systems from unreliable components.
Merve Nur Cakir +2 more
openaire +3 more sources
Four-valued expansions of Dunn-Belnap's logic (I): Basic characterizations
Bulletin of the Section of Logic, 2020 Basic results of the paper are that any four-valued expansion L4 of Dunn-Belnap's logic DB4 is de_ned by a unique (up to isomorphism) conjunctive matrix ℳ4 with exactly two distinguished values over an expansion 𝔄4 of a De Morgan non-Boolean four-valued ...
Alexej P. Pynko
doaj +1 more source
Mobile Learning Application for Language and Automata Theory using Android-based
JOIN: Jurnal Online Informatika, 2020 The language and automata theory are which required course must implemented by college student in informatic engineering study program. In this course, there are finite state automata (FSA) and deterministic finite automata (DFA) which are important ...
Maulana Muhamad Sulaiman +2 more
doaj +1 more source
Nominal Cellular Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 The emerging field of Nominal Computation Theory is concerned with the theory of Nominal Sets and its applications to Computer Science. We investigate here the impact of nominal sets on the definition of Cellular Automata and on their computational ...
Tommaso Bolognesi, Vincenzo Ciancia
doaj +1 more source
Topological theories and automata
CoRR, 2022 The paper explains the connection between topological theories for one-manifolds with defects and values in the Boolean semiring and automata and their generalizations. Finite state automata are closely related to regular languages. To each pair of a regular language and a circular regular language we associate a topological theory for one-dimensional ...
Mee Seong Im, Mikhail Khovanov
openaire +3 more sources