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
Efficient Implementation for Deterministic Finite Tree Automata Minimization
Journal of Computing and Information Technology, 2016 We address the problem of deterministic finite tree automata (DFTA) minimization. We describe a new alternative to implement both standard and incremental tree automata minimization using a well-defined graph representing the automaton to be minimized ...
Younes Guellouma, Hadda Cherroun
doaj +1 more source
Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity.
Jos C. M. Baeten +3 more
doaj +1 more source
Sequences of Groups, Hypergroups and Automata of Linear Ordinary Differential Operators
Mathematics, 2021 The main objective of our paper is to focus on the study of sequences (finite or countable) of groups and hypergroups of linear differential operators of decreasing orders.
Jan Chvalina +3 more
doaj +1 more source
Solomon Marcus Contributions to Theoretical Computer Science and Applications
Axioms, 2021 Solomon Marcus (1925–2016) was one of the founders of the Romanian theoretical computer science. His pioneering contributions to automata and formal language theories, mathematical linguistics and natural computing have been widely recognised ...
Cristian S. Calude, Gheorghe Păun
doaj +1 more source
Neural architecture search for resource constrained hardware devices: A survey
IET Cyber-Physical Systems, 2023 With the emergence of powerful and low‐energy Internet of Things devices, deep learning computing is increasingly applied to resource‐constrained edge devices.
Yongjia Yang +4 more
doaj +1 more source
Algebraic Methods for Finite Linear Cellular Automata [PDF]
, 1996 PhDCellular automata are a simple class of extended dynamical systems which have been much studied in recent years. Linear cellular automata are the class of cellular automata most amenable to algebraic analytic treatments, algebraic techniques are ...
Dow, R. A.
core +2 more sources
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
On path hypercompositions in graphs and automata
MATEC Web of Conferences, 2016 The paths in graphs define hypercompositions in the set of their vertices and therefore it is feasible to associate hypercompositional structures to each graph.
Massouros Christos G.
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