Results 31 to 40 of about 118,707 (380)

Prediction of Land Use and Land Cover Changes for North Sumatra, Indonesia, Using an Artificial-Neural-Network-Based Cellular Automaton

open access: yesSustainability, 2019
Land use and land cover (LULC) form a baseline thematic map for monitoring, resource management, and planning activities and facilitate the development of strategies to balance conservation, conflicting uses, and development pressures.
M. H. Saputra, Han Soo Lee
semanticscholar   +1 more source

Truly On-The-Fly LTL Model Checking [PDF]

open access: yes, 2005
We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized B\"{u}chi automaton for the negation of the formula and the emptiness check.
Hammer, Moritz   +2 more
core   +6 more sources

Languages of single-valued neutrosophic general automata [PDF]

open access: yesJournal 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 structure theory of partial automaton semigroups [PDF]

open access: yesSemigroup Forum, 2018
We study automaton structures, i.e., groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer.
D. D’Angeli   +2 more
semanticscholar   +1 more source

Ambiguity Hierarchy of Regular Infinite Tree Languages [PDF]

open access: yesLogical 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

Fort Formation by an Automaton [PDF]

open access: yes2021 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

Human and Machine: Gender Inversion and the Problem of Artificial Body in the Short Story by Anna Barkova “The Steel Husband” (1926) [PDF]

open access: yesЛитературный факт
The article considers the short story by Anna Barkova, “The Steel Husband,” in many ways: as a point of intersection of several different influences (“pornographic prose” from the heyday of the “women’s question”; the poetry of the Proletcultists, in ...
Veronika B. Zuseva-Özkan
doaj   +1 more source

Algorithms for Converting Finite Automata Corresponding to Infinite Iterative Trees

open access: yesСовременные информационные технологии и IT-образование, 2021
In this paper, we work with some different variants of finite automata, each of which corresponds to an infinite iterative tree constructed for some given morphism.
Mikhail Abramyan, Boris Melnikov
doaj   +1 more source

Wishing for the Watch Face in Jonathan Swift’s “The Progress of Beauty”

open access: yesABO : 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

On the complexity of the word problem for automaton semigroups and automaton groups [PDF]

open access: yesAdvances 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

Home - About - Disclaimer - Privacy