Results 21 to 30 of about 4,904 (291)
On structure of isomorphisms of universal graphic automata [PDF]
Известия Саратовского университета. Новая серия. Серия Математика. Механика. ИнформатикаAutomata theory is one of the branches of mathematical cybernetics, that studies information transducers that arise in many applied problems. The major objective of automata theory is to develop methods by which one can describe and analyze the dynamic ...
Molchanov, Vladimir Aleksandrovich +1 more
doaj +1 more source
Coalgebraic Automata Theory: Basic Results [PDF]
Logical Methods in Computer Science, 2008 We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves weak pullbacks.
C. Kupke, Y. Venema
doaj +1 more source
Evolutionary Information Theory
Information, 2013 Evolutionary information theory is a constructive approach that studies information in the context of evolutionary processes, which are ubiquitous in nature and society.
Mark Burgin
doaj +1 more source
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
Representing Complex Evolving Spatial Networks: Geographic Network Automata
ISPRS International Journal of Geo-Information, 2020 Many real-world spatial systems can be conceptualized as networks. In these conceptualizations, nodes and links represent system components and their interactions, respectively. Traditional network analysis applies graph theory measures to static network
Taylor Anderson, Suzana Dragićević
doaj +1 more source
Finite automata over algebraic structures: models and some methods of analysis [PDF]
Computer Science Journal of Moldova, 2015 In this paper some results of research in two new trends of finite automata theory are presented. For understanding the value and the aim of these researches some short retrospective analysis of development of finite automata theory is given.
Volodymyr V. Skobelev +1 more
doaj
Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 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 +1 more source
Effective theories for circuits and automata [PDF]
Chaos: An Interdisciplinary Journal of Nonlinear Science, 2011 Abstracting an effective theory from a complicated process is central to the study of complexity. Even when the underlying mechanisms are understood, or at least measurable, the presence of dissipation and irreversibility in biological, computational, and social systems makes the problem harder.
openaire +4 more sources
Classical Automata on Promise Problems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Promise problems were mainly studied in quantum automata theory. Here we focus on state complexity of classical automata for promise problems. First, it was known that there is a family of unary promise problems solvable by quantum automata by using a ...
Viliam Geffert, Abuzer Yakaryilmaz
doaj +1 more source
Computation Theory of Cellular Automata [PDF]
Communications in Mathematical Physics, 1984 Self-organizing behaviour in cellular automata is discussed as a computational process. Formal language theory is used to extend dynamical systems theory descriptions of cellular automata. The sets of configurations generated after a finite number of time steps of cellular automaton evolution are shown to form regular languages. Many examples are given.
openaire +4 more sources