Results 21 to 30 of about 109,516 (325)
On Learning Nominal Automata with Binders [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We investigate a learning algorithm in the context of nominal automata, an extension of classical automata to alphabets featuring names. This class of automata captures nominal regular languages; analogously to the classical language theory, nominal ...
Yi Xiao, Emilio Tuosto
doaj +1 more source
Minimization via duality [PDF]
, 2012 We show how to use duality theory to construct minimized versions of a wide class of automata. We work out three cases in detail: (a variant of) ordinary automata, weighted automata and probabilistic automata.
A. Beimel +9 more
core +2 more sources
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
Learning a Partially-Known Discrete Event System
IEEE Access, 2020 There are many cases in which our understanding of a system may be limited due to its complexity or lack of access into the entire system, leaving us with only partial system knowledge.
Ira Wendell Bates +2 more
doaj +1 more source
Automata theory in nominal sets [PDF]
Logical Methods in Computer Science, 2014 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 +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
On the Problem of Computing the Probability of Regular Sets of Trees [PDF]
, 2015 We consider the problem of computing the probability of regular languages of infinite trees with respect to the natural coin-flipping measure. We propose an algorithm which computes the probability of languages recognizable by \emph{game automata}.
Michalewski, Henryk, Mio, Matteo
core +4 more sources