Results 81 to 90 of about 1,221 (189)

Three variations of observation equivalence preserving synthesis abstraction

, 2011
In a previous paper we introduced the notion of synthesis abstraction, which allows efficient compositional synthesis of maximally permissive supervisors for large-scale systems of composed finite-state automata.
Mohajerani, Sahar, Malik, Robi, Ware, Simon, Fabian, Martin   +3 more
core  

Twisted ambidexterity in equivariant homotopy theory

Journal of Topology, Volume 19, Issue 2, June 2026.
Abstract We develop the concept of twisted ambidexterity in a parametrized presentably symmetric monoidal ∞$\infty$‐category, which generalizes the notion of ambidexterity by Hopkins and Lurie and the Wirthmüller isomorphisms in equivariant stable homotopy theory, and is closely related to Costenoble–Waner duality.
Bastiaan Cnossen
wiley   +1 more source

An Entropy Metric for Regular Grammar Classification and Learning with Recurrent Neural Networks. [PDF]

Entropy (Basel), 2021
Zhang K, Wang Q, Giles CL.
europepmc   +1 more source

The syntactic concept lattice: Another algebraic theory of the context-free languages?

Journal of Logic and Computation, 2015
Alexander Clark
semanticscholar   +1 more source

Characterizing Communication Channel Deadlocks in Sequence Diagrams

, 2008
UML sequence diagrams (SDs) are a mainstay of requirements specifications for communication protocols. Mauw and Reniers' algebraic (MRA) semantics formally specifies a behaviour for these SDs that guarantees deadlock free processes.
Mitchell, Bill, B. Mitchell
core   +1 more source

Modal Logics are Coalgebraic

, 2008
Applications of modal logics are abundant in computer science, and a large number of structurally different modal logics have been successfully employed in a diverse spectrum of application contexts.
Yde Venema, Schröder, Lutz, Dirk Pattinson, Cirstea, Corina, Lutz Werner Schröder, Kurz, Alexander, Venema, Y., Corina Cirstea, Pattinson, D., Pattinson, Dirk, Kurz, A., Schröder, L., Venema, Yde, Cirstea, C., Alexander Kurz   +14 more
core   +1 more source

Quantum automata and quantum grammars

, 2000
To study quantum computation, it might be helpful to generalize structures from language and automata theory to the quantum case. To that end, we propose quantum versions of finite-state and push-down automata, and regular and context-free grammars.
Moore, Cristopher, James P. Crutchfield, Crutchfield, James P., Cristopher Moore   +3 more
core   +1 more source

Temporal Analysis and Classification of Sensor Signals. [PDF]

Sensors (Basel), 2023
Kosiuczenko P.
europepmc   +1 more source

A side-channel attack against an automata theory based stream cipher (Logic, Language, Algebraic system and Related Areas in Computer Science)

A side-channel attack against an automata theory based stream cipher (Logic, Language, Algebraic system and Related Areas in Computer Science)
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