Results 11 to 20 of about 3,225 (296)
Deriving Synchronizing and Homing Sequences for Input/Output Automata
Моделирование и анализ информационных систем, 2017 In this paper, we study the problem of existence check and derivation of synchronizing and homing sequences for finite input/output automata. Corresponding sequences can be effectively used for the current state identification of a system under test ...
Natalia G. Kushik +3 more
doaj +2 more sources
Concurrency and automata on infinite sequences [PDF]
, 2005 The paper is concerned with ways in which fair concurrency can be modelled using notations for omega-regular languages — languages containing infinite sequences, whose recognizers are modified forms of Buchi or Muller-McNaughton automata. There are characterization of these languages in terms of recursion equation sets which involve both minimal and ...
Park, David
openaire +2 more sources
Programming gel automata shapes using DNA instructions [PDF]
Nature CommunicationsThe ability to transform matter between numerous physical states or shapes without wires or external devices is a major challenge for robotics and materials design. Organisms can transform their shapes using biomolecules carrying specific information and
Ruohong Shi +9 more
doaj +2 more sources
Learning Automata on Protein Sequences
, 2006 Pattern discovery is limited to position-specific characterizations like Prosite's patterns or profile-HMMs which are unable to handle, for instance, dependencies between amino acids distant in the sequence of a protein, but close in its three-dimensional structure. To overcome these limitations, we propose to learn automata on proteins.
Coste, François, Kerbellec, Goulven
openaire +3 more sources
To some structural properties of ∞ - languages
Ratio Mathematica, 2022 Properties of catenation of sequences of finite (words) and infinite ( lengths are largely studied in formal language theory. These operations are derived from the mechanism how they are accepted or generated by the corresponding devices.
Ivan Mezník
doaj +1 more source
Asynchronous wreath product and cascade decompositions for concurrent behaviours [PDF]
Logical Methods in Computer Science, 2022 We develop new algebraic tools to reason about concurrent behaviours modelled as languages of Mazurkiewicz traces and asynchronous automata. These tools reflect the distributed nature of traces and the underlying causality and concurrency between events,
Bharat Adsul +3 more
doaj +1 more source
Subset Synchronization of Transitive Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We consider the following generalized notion of synchronization: A word is called a reset word of a subset of states of a deterministic finite automaton if it maps all states of the set to a unique state. It is known that the minimum length of such words
Vojtěch Vorel
doaj +1 more source
Pattern Matching in Link Streams: Timed-Automata with Finite Memory [PDF]
Scientific Annals of Computer Science, 2018 Link streams model the dynamics of interactions in complex distributed systems as sequences of links (interactions) occurring at a given time. Detecting patterns in such sequences is crucial for many applications but it raises several challenges.
C. Bertrand +3 more
doaj +1 more source
Language Inclusion Checking of Timed Automata Based on Property Patterns
Applied Sciences, 2022 The language inclusion checking of timed automata is described as the following: given two timed automata M and N, where M is a system model and N is a specification model (which represents the properties that the system needs to satisfy), check whether ...
Ting Wang +5 more
doaj +1 more source
Automata, algebraicity and distribution of sequences of powers [PDF]
Annales de l'Institut Fourier, 2001 Let K be a finite field of characteristic p . Let K (
Allouche, Jean-Paul +3 more
openaire +1 more source