Results 1 to 10 of about 20,355 (135)
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 +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 +4 more sources
Regular tree languages, cardinality predicates, and addition-invariant FO [PDF]
, 2011 This paper considers the logic FOcard, i.e., first-order logic with cardinality predicates that can specify the size of a structure modulo some number.
Harwath, Frederik, Schweikardt, Nicole
core +3 more sources
An Introduction to Predictive Processing Models of Perception and Decision‐Making
Topics in Cognitive Science, EarlyView., 2023 Abstract The predictive processing framework includes a broad set of ideas, which might be articulated and developed in a variety of ways, concerning how the brain may leverage predictive models when implementing perception, cognition, decision‐making, and motor control.
Mark Sprevak, Ryan Smith
wiley +1 more source
Weighted Logics for Nested Words and Algebraic Formal Power Series [PDF]
, 2010 Nested words, a model for recursive programs proposed by Alur and Madhusudan, have recently gained much interest. In this paper we introduce quantitative extensions and study nested word series which assign to nested words elements of a semiring. We show
Mathissen, Christian
core +1 more source
Modal Ω-Logic: Automata, Neo-Logicism, and Set-Theoretic Realism [PDF]
, 2019 This essay examines the philosophical significance of $\Omega$-logic in Zermelo-Fraenkel set theory with choice (ZFC). The duality between coalgebra and algebra permits Boolean-valued algebraic models of ZFC to be interpreted as coalgebras.
A Baltag +45 more
core +9 more sources
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
On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract)
, 2014 Eilenberg correspondence, based on the concept of syntactic monoids, relates varieties of regular languages with pseudovarieties of finite monoids.
Klíma, Ondřej
core +4 more sources
Quantum finite automata and linear context-free languages: a decidable problem [PDF]
, 2013 We consider the so-called measure once finite quantum automata model introduced by Moore and Crutchfield in 2000. We show that given a language recognized by such a device and a linear context-free language, it is recursively decidable whether or not ...
A. Paz +6 more
core +1 more source
A Fibrational Approach to Automata Theory [PDF]
, 2015 For predual categories C and D we establish isomorphisms between opfibrations representing local varieties of languages in C, local pseudovarieties of D-monoids, and finitely generated profinite D-monoids.
Chen, Liang-Ting, Urbat, Henning
core +2 more sources