Results 11 to 20 of about 553 (162)
A general theory of action languages [PDF]
, 1998 We present a general theory of action-based languages as a paradigm, for the description, of those computational systems which include elements of concurrency and networking, and extend this approach to describe dist.ributed systems and also t,o ...
Letichevsky, AA, Gilbert, D
core +6 more sources
Single-Use Automata and Transducers for Infinite Alphabets [PDF]
, 2020 Our starting point are register automata for data words, in the style of Kaminski and Francez. We study the effects of the single-use restriction, which says that a register is emptied immediately after being used.
Bojańczyk, Mikołaj, Stefański, Rafał
core +1 more source
Automatic presentations for semigroups [PDF]
, 2009 Special Issue: 2nd International Conference on Language and Automata Theory and Applications (LATA 2008)This paper applies the concept of FA-presentable structures to semigroups.
Oliver, Graham +4 more
core +2 more sources
A (co)algebraic theory of succinct automata [PDF]
, 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 ...
Sammartino, M +3 more
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
A mathematical theory of synchronous concurrent algorithms [PDF]
, 1987 A synchronous concurrent algorithm is an algorithm that is described as a network of intercommunicating processes or modules whose concurrent actions are synchronised with respect to a global clock.
Thompson, Benjamin Criveli
core +7 more sources
Algebraic Language Theory with Effects [PDF]
Regular languages - the languages accepted by deterministic finite automata - are known to be precisely the languages recognized by finite monoids. This characterization is the origin of algebraic language theory.
Lenke, Fabian +3 more
core +1 more source
A Perspective on Interactive Theorem Provers in Physics
Advanced Science, EarlyView.Into an interactive theorem provers (ITPs), one can write mathematical definitions, theorems and proofs, and the correctness of those results is automatically checked. This perspective goes over the best usage of ITPs within physics and motivates the open‐source community run project PhysLean, the aim of which is to be a library for digitalized physics
Joseph Tooby‐Smith
wiley +1 more source
RESEARCH ON NUMBER THEORY AND SMARANDACHE NOTIONS [PDF]
, 2010 This Book is devoted to the proceedings of the Sixth International Conference on Number Theory and Smarandache Notions held in Tianshui during April 24-25, 2010.
Wenpeng, Zhang
core +1 more source
Cyclic System for an Algebraic Theory of Alternating Parity Automata [PDF]
ω-regular languages are a natural extension of the regular languages to the setting of infinite words. Likewise, they are recognised by a host of automata models, one of the most important being Alternating Parity Automata (APAs), a generalisation of ...
Das, Anupam; id_orcid, De, Abhishek
core +3 more sources