Results 1 to 10 of about 1,221 (189)
A (co)algebraic theory of succinct automata [PDF]
J. Log. Algebraic Methods Program., 2019 The classical subset construction for non-deterministic automata can be generalized to other side-effects captured by a monad. The key insight is that both the state space of the determinized automaton and its semantics—languages over an alphabet—have a ...
Gerco van Heerdt +3 more
semanticscholar +3 more sources
Greibach Normal Form for ω-Algebraic Systems and Weighted Simple ω-Pushdown Automata [PDF]
Information and Computation, 2020 In weighted automata theory, many classical results on formal languages have been extended into a quantitative setting. Here, we investigate weighted context-free languages of infinite words, a generalization of $\omega$-context-free languages (Cohen ...
M. Droste, S. Dziadek, W. Kuich
semanticscholar +3 more sources
Logic Meets Algebra: the Case of Regular Languages [PDF]
Logical Methods in Computer Science, 2007 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 +2 more sources
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 +1 more source
Regular Cost Functions, Part I: Logic and Algebra over Words [PDF]
Logical Methods in Computer Science, 2013 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
Journal of Applied Mathematics, 2013 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
Varieties of Languages in a Category [PDF]
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015 Eilenberg's variety theorem, a centerpiece of algebraic automata theory, establishes a bijective correspondence between varieties of languages and pseudovarieties of monoids.
J. Adámek +3 more
semanticscholar +1 more source
THE TRANSPOSITION AXIOM IN HYPERCOMPOSITIONAL STRUCTURES
Ratio Mathematica, 2011 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]
Int J Mach Learn Cybern, 2022 Yadav S, Tiwari SP, Kumari M, Yadav VK.
europepmc +1 more source