Results 21 to 30 of about 12,303 (297)
The size of subsequence automaton [PDF]
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zdeněk Troníček +2 more
openaire +3 more sources
Advances in Group Theory and Applications, 2020 28 pages, 12 ...
Cavaleri M. +3 more
openaire +3 more sources
Smarandache Semi-Automaton And Automaton [PDF]
Smarandache Notions Journal archive, 2004 In this paper we study the Smarandache Semi-Automaton and Automaton using Smarandache free groupoids.
openaire +1 more source
Determinisability of register and timed automata [PDF]
Logical Methods in Computer Science, 2022 The deterministic membership problem for timed automata asks whether the timed language given by a nondeterministic timed automaton can be recognised by a deterministic timed automaton.
Lorenzo Clemente +2 more
doaj +1 more source
Fort Formation by an Automaton [PDF]
2021 International Conference on COMmunication Systems & NETworkS (COMSNETS), 2021 Building structures by low capability robots is a very recent research development. A robot (or a mobile agent) is designed as a deterministic finite automaton. The objective is to make a structure from a given distribution of materials (\textit{bricks}) in an infinite grid $Z\times Z$. The grid cells may contain a brick (\textit{full cells}) or it may
Debasish Pattanayak +2 more
openaire +3 more sources
An enactivist-inspired mathematical model of cognition
Frontiers in Neurorobotics, 2022 In this paper we start from the philosophical position in cognitive science known as enactivism. We formulate five basic enactivist tenets that we have carefully identified in the relevant literature as the main underlying principles of that philosophy ...
Vadim Weinstein +2 more
doaj +1 more source
Languages of single-valued neutrosophic general automata [PDF]
Journal of Mahani Mathematical Research, 2023 In this paper, we define the concepts of single-valued neutrosophic general automaton, complete and deterministic single-valued neutrosophic general automaton.
Marzieh Shamsizadeh +2 more
doaj +1 more source
On the complexity of the word problem for automaton semigroups and automaton groups [PDF]
Advances in Applied Mathematics, 2017 In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups, which are generated by partial, yet invertible automata. We show that there is an automaton-inverse semigroup and,
Daniele D'Angeli +2 more
openaire +4 more sources
Wishing for the Watch Face in Jonathan Swift’s “The Progress of Beauty”
ABO : Interactive Journal for Women in the Arts 1640-1830, 2018 This article illuminates the technological underpinnings of Jonathan Swift’s satire, “The Progress of Beauty” (1719), by exploring how eighteenth-century poetics of beauty and scientific progress pit human against automaton.
Jantina Ellens
doaj +1 more source
Ambiguity Hierarchy of Regular Infinite Tree Languages [PDF]
Logical Methods in Computer Science, 2021 An automaton is unambiguous if for every input it has at most one accepting computation. An automaton is k-ambiguous (for k > 0) if for every input it has at most k accepting computations. An automaton is boundedly ambiguous if it is k-ambiguous for some
Alexander Rabinovich, Doron Tiferet
doaj +1 more source