Results 1 to 10 of about 106,533 (228)
ioco theory for probabilistic automata [PDF]
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 +8 more sources
Generalized Results on Monoids as Memory [PDF]
We show that some results from the theory of group automata and monoid automata still hold for more general classes of monoids and models. Extending previous work for finite automata over commutative groups, we demonstrate a context-free language that ...
Özlem Salehi+2 more
doaj +3 more sources
Cryptography using Automata Theory [PDF]
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 +2 more sources
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases [PDF]
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set representations
Bernard Boigelot+2 more
doaj +9 more sources
Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract) [PDF]
The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity.
Jos C. M. Baeten+3 more
doaj +10 more sources
Automata theory in nominal sets [PDF]
We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an automorphism group ...
Mikołaj Bojańczyk+2 more
doaj +4 more sources
Can Nondeterminism Help Complementation? [PDF]
Complementation and determinization are two fundamental notions in automata theory. The close relationship between the two has been well observed in the literature.
Yang Cai, Ting Zhang
doaj +4 more sources
Automata Minimization: a Functorial Approach [PDF]
In this paper we regard languages and their acceptors - such as deterministic or weighted automata, transducers, or monoids - as functors from input categories that specify the type of the languages and of the machines to categories that specify the type
Thomas Colcombet, Daniela Petrişan
doaj +3 more sources
A Fibrational Approach to Automata Theory [PDF]
For predual categories C and D we establish isomorphisms between opfibrations representing local varieties of languages in C, local pseudovarieties of D-monoids, and finitely generated profinite D-monoids.
Chen, Liang-Ting, Urbat, Henning
core +7 more sources
Automata theory on sliding windows [PDF]
In a recent paper we analyzed the space complexity of streaming algorithms whose goal is to decide membership of a sliding window to a fixed language. For the class of regular languages we proved a space trichotomy theorem: for every regular language the optimal space bound is either constant, logarithmic or linear.
Moses Ganardi+4 more
openalex +6 more sources