Results 11 to 20 of about 3,110 (267)
Undecidability and Finite Automata [PDF]
, 2017 Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to prove the undecidability of a related problem about k-automatic sets of rational numbers.
Jörg Endrullis +2 more
openaire +4 more sources
Simplifying Nondeterministic Finite Cover Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA '98, as a more compact representation than Deterministic Finite Automata (DFA) for finite languages.
Cezar Câmpeanu
doaj +1 more source
Algebra of Finite Automata as a Mathematical Model of the Digital Twin of Smart Production
Современные информационные технологии и IT-образование, 2022 The article is devoted to the development of the finite automata algebra of a special type DTA (Digital Twin Algebra), designed for mathematical modeling of production digital twins.
Dmitry Gapanovich, Vladimir Sukhomlin
doaj +1 more source
Two Extensions of Cover Automata
Axioms, 2021 Deterministic Finite Cover Automata (DFCA) are compact representations of finite languages. Deterministic Finite Automata with “do not care” symbols and Multiple Entry Deterministic Finite Automata are both compact representations of regular languages ...
Cezar Câmpeanu
doaj +1 more source
More Structural Characterizations of Some Subregular Language Families by Biautomata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We study structural restrictions on biautomata such as, e.g., acyclicity, permutation-freeness, strongly permutation-freeness, and orderability, to mention a few.
Markus Holzer, Sebastian Jakobi
doaj +1 more source
A coalgebraic take on regular and $\omega$-regular behaviours [PDF]
Logical Methods in Computer Science, 2021 We present a general coalgebraic setting in which we define finite and infinite behaviour with B\"uchi acceptance condition for systems whose type is a monad.
Tomasz Brengos
doaj +1 more source
Analyzing Timed Systems Using Tree Automata [PDF]
Logical Methods in Computer Science, 2018 Timed systems, such as timed automata, are usually analyzed using their operational semantics on timed words. The classical region abstraction for timed automata reduces them to (untimed) finite state automata with the same time-abstract properties, such
S. Akshay +2 more
doaj +1 more source
Multi-Head Finite Automata: Characterizations, Concepts and Open Problems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Multi-head finite automata were introduced in (Rabin, 1964) and (Rosenberg, 1966). Since that time, a vast literature on computational and descriptional complexity issues on multi-head finite automata documenting the importance of these devices has been ...
Andreas Malcher +2 more
doaj +1 more source
A Formal Model for Semantic Computing Based on Generalized Probabilistic Automata
Entropy, 2019 In most previous research, “semantic computing” refers to computational implementations of semantic reasoning. It lacks support from the formal theory of computation.
Guangjian Huang +3 more
doaj +1 more source
Composite Neutrosophic Finite Automata [PDF]
Neutrosophic Sets and Systems, 2020 The idea behind the neutrosophic set is we can connect the concept by dynamics of opposite interacts and its neutral that are uncertain and get common parts.
J. Kavikumar +4 more
doaj +1 more source