Green’s Relations in Deterministic Finite Automata
Sign Up to like & getrecommendations! Published in 2018 at "Theory of Computing Systems"
DOI: 10.1007/s00224-018-9847-4
Abstract: Green’s relations are a fundamental tool in the structure theory of semigroups. They can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes of Green’s relations then correspond to the strongly connected… read more here.
Keywords: green relations; finite automata; relations deterministic; deterministic finite ... See more keywords
On deterministic sensing $$5'\rightarrow 3'$$5′→3′ Watson–Crick finite automata: a full hierarchy in 2detLIN
Sign Up to like & getrecommendations! Published in 2021 at "Acta Informatica"
DOI: 10.1007/s00236-019-00362-6
Abstract: Watson–Crick (abbreviated as WK) finite automata are working on double stranded DNA molecule that is also called Watson–Crick tape. Subsequently, these automata have two reading heads, one for each strand. While in traditional WK automata… read more here.
Keywords: sensing rightarrow; watson crick; finite automata; watson ... See more keywords
Weighted finite automata with output
Sign Up to like & getrecommendations! Published in 2018 at "Soft Computing"
DOI: 10.1007/s00500-017-2493-y
Abstract: In this paper, we prove the equivalence of sequential, Mealy-type and Moore-type weighted finite automata with output, with respect to various semantics which are defined here. read more here.
Keywords: automata output; finite automata; weighted finite;
Quantum ω-Automata over Infinite Words and Their Relationships
Sign Up to like & getrecommendations! Published in 2019 at "International Journal of Theoretical Physics"
DOI: 10.1007/s10773-018-3983-0
Abstract: Inspired by the results of finite automata working on infinite words, we studied the quantum ω-automata with Büchi, Muller, Rabin and Streett acceptance condition. Quantum finite automata play a pivotal part in quantum information and… read more here.
Keywords: infinite words; quantum automata; quantum finite; automata infinite ... See more keywords
The verification of conversion algorithms between finite automata
Sign Up to like & getrecommendations! Published in 2017 at "Science China Information Sciences"
DOI: 10.1007/s11432-017-9155-x
Abstract: The conversion algorithms between finite automata are frequently used in language recognition. In recent years, there is a tendency to formalize and verify the correctness of conversion algorithms in interactive theorem provers. In 1997, Filliâtre… read more here.
Keywords: finite automata; algorithms finite; conversion; verification ... See more keywords
A novel matrix approach to observability analysis of finite automata
Sign Up to like & getrecommendations! Published in 2017 at "International Journal of Systems Science"
DOI: 10.1080/00207721.2017.1384964
Abstract: ABSTRACT In this paper, the observability of finite automata (acronym is FA) that contain both deterministic finite automata and non-deterministic finite automata is investigated under the framework of the semi-tensor product of matrices. For both… read more here.
Keywords: state; finite automata; observability; initial state ... See more keywords
Porosity of the porous carbonate rocks in the Jingfengqiao–Baidiao area based on finite automata
Sign Up to like & getrecommendations! Published in 2022 at "Royal Society Open Science"
DOI: 10.1098/rsos.211844
Abstract: This study is based on the processing of computed microtomography images of rock samples. In this study, a finite automation is constructed using the grey value, red-green-blue (RGB) value and Euler number of polarized images… read more here.
Keywords: finite automata; baidiao area; jingfengqiao baidiao; carbonate rocks ... See more keywords
Robust Stealthy Attacks Based on Uncertain Costs and Labeled Finite Automata With Inputs
Sign Up to like & getrecommendations! Published in 2023 at "IEEE Robotics and Automation Letters"
DOI: 10.1109/lra.2023.3250007
Abstract: This letter deals with the vulnerability analysis of cyber-physical systems subject to malicious actions. For this purpose, the considered system is assumed to be abstracted as a discrete event system. Labeled finite automata with inputs… read more here.
Keywords: stealthy attacks; system; finite automata; labeled finite ... See more keywords
Approximating Probabilistic Models as Weighted Finite Automata
Sign Up to like & getrecommendations! Published in 2021 at "Computational Linguistics"
DOI: 10.1162/coli_a_00401
Abstract: Abstract Weighted finite automata (WFAs) are often used to represent probabilistic models, such as n-gram language models, because among other things, they are efficient for recognition tasks in time and space. The probabilistic source to… read more here.
Keywords: finite automata; source; probabilistic models; models weighted ... See more keywords
Quantum Conditional Strategies and Automata for Prisoners’ Dilemmata under the EWL Scheme
Sign Up to like & getrecommendations! Published in 2019 at "Applied Sciences"
DOI: 10.3390/app9132635
Abstract: Classical game theory is an important field with a long tradition of useful results. Recently, the quantum versions of classical games, such as the prisoner’s dilemma (PD), have attracted a lot of attention. This game… read more here.
Keywords: conditional strategies; quantum conditional; scheme; finite automata ... See more keywords