Results 1 to 10 of about 553 (162)
Logic Meets Algebra: the Case of Regular Languages [PDF]
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e.
Pascal Tesson, Denis Therien
doaj +1 more source
Regular Cost Functions, Part I: Logic and Algebra over Words [PDF]
The theory of regular cost functions is a quantitative extension to the classical notion of regularity. A cost function associates to each input a non-negative integer value (or infinity), as opposed to languages which only associate to each input the ...
Thomas Colcombet
doaj +1 more source
On Intuitionistic Fuzzy Context-Free Languages
Taking intuitionistic fuzzy sets as the structures of truth values, we propose the notions of intuitionistic fuzzy context-free grammars (IFCFGs, for short) and pushdown automata with final states (IFPDAs).
Jianhua Jin, Qingguo Li, Chunquan Li
doaj +1 more source
Finite automata over algebraic structures: models and some methods of analysis [PDF]
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
THE TRANSPOSITION AXIOM IN HYPERCOMPOSITIONAL STRUCTURES
The hypergroup (as defined by F. Marty), being a very general algebraic structure, was subsequently quickly enriched with additional axioms. One of these is the transposition axiom, the utilization of which led to the creation of join spaces (join ...
Ch.G. Massouros, G.G. Massouros
doaj
Generalized rough and fuzzy rough automata for semantic computing. [PDF]
Yadav S, Tiwari SP, Kumari M, Yadav VK.
europepmc +1 more source
Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]
Couceiro M, Duffus D.
europepmc +1 more source
Resilient Supervisory Multi-Agent Systems. [PDF]
Baxevani K, Zehfroosh A, Tanner HG.
europepmc +1 more source
In this paper we consider a finite automaton based stream cipher given by P. Dömösi and G. Horváth and we show its immunity in side-channel timing attack.
openaire +1 more source

