English
Related papers

Related papers: Normal Forms for Elements of ${}^*$-Continuous Kle…

200 papers

We define and study basic properties of *-continuous Kleene $\omega$-algebras that involve a *-continuous Kleene algebra with a *-continuous action on a semimodule and an infinite product operation that is also *-continuous. We show that…

Formal Languages and Automata Theory · Computer Science 2015-01-07 Zoltán Ésik , Uli Fahrenberg , Axel Legay

We give the quantum subset construction of orthomodular lattice-valued finite automata, then we show the equivalence between orthomodular lattice-valued finite automata, orthomodular lattice-valued deterministic finite automata and…

Logic in Computer Science · Computer Science 2007-12-31 Yongming Li

We first propose algorithms for checking language equivalence of finite automata over a large alphabet. We use symbolic automata, where the transition function is compactly represented using a (multi-terminal) binary decision diagrams…

Formal Languages and Automata Theory · Computer Science 2014-07-14 Damien Pous

Kleene algebra (KA) is an important tool for reasoning about general program equivalences, with a decidable and complete equational theory. However, KA cannot always prove equivalences between specific programs. For this purpose, one adds…

Programming Languages · Computer Science 2026-01-21 Liam Chung , Tobias Kappé

We will study some modifications to the notion of an exact C*-algebra by replacing the minimal tensor product with the reduced free product. First we will demonstrate how the reduced free product of a short exact sequence of C*-algebras…

Operator Algebras · Mathematics 2015-06-05 Paul Skoufranis

We give a formal treatment of simple type theories, such as the simply-typed $\lambda$-calculus, using the framework of abstract clones. Abstract clones traditionally describe first-order structures, but by equipping them with additional…

Logic in Computer Science · Computer Science 2024-04-03 Nathanael Arkor , Dylan McDermott

Let $X$ be a Cantor set, and let $A$ be a unital separable simple amenable $C$*-algebra with tracial rank zero which satisfies the Universal Coefficient Theorem, we use $C(X,A)$ to denote the set of all continuous functions from $X$ to $A$,…

Operator Algebras · Mathematics 2010-06-08 Jiajie Hua

In this paper, we introduce a $C^{\ast}$-algebra associated with a proper primitive substitution. We show that the $C^{\ast}$-algebra is simple and purely infinite and contains the associated Cuntz-Krieger algebra and the crossed product…

Operator Algebras · Mathematics 2008-06-26 Masaru Fujino

Kleene Algebra with Tests (KAT) provides an elegant algebraic framework for describing non-deterministic finite-state computations. Using a small finite set of non-deterministic programming constructs (sequencing, non-deterministic choice,…

Programming Languages · Computer Science 2025-01-17 Balder ten Cate , Tobias Kappé

A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed by a subset of the authors of this paper. Examples of the systems…

Logic in Computer Science · Computer Science 2013-03-12 Marcello Bonsangue , Georgiana Caltais , Eugen-Ioan Goriac , Dorel Lucanu , Jan Rutten , Alexandra Silva

The aim of the paper is to build a connection between two approaches towards categorical language theory: the coalgebraic and algebraic language theory for monads. For a pair of monads modelling the branching and the linear type we defined…

Logic in Computer Science · Computer Science 2019-06-14 Tomasz Brengos , Marco Peressotti

We investigate the C*-algebra inclusions $B \subset A \rtimes_{\rm r} \Gamma$ arising from inclusions $B \subset A$ of $\Gamma$-C*-algebras. The main result shows that, when $B \subset A$ is C*-irreducible in the sense of R{\o}rdam, and is…

Operator Algebras · Mathematics 2026-02-17 Yuhei Suzuki

We present a reflexive tactic for deciding the equational theory of Kleene algebras in the Coq proof assistant. This tactic relies on a careful implementation of efficient finite automata algorithms, so that it solves casual equations…

Logic in Computer Science · Computer Science 2015-07-01 Thomas Braibant , Damien Pous

In this paper we continue the analysis undertaken in a series of previous papers on structures arising as completions of C*-algebras under topologies coarser that their norm and we focus our attention on the so-called {\em locally convex…

Mathematical Physics · Physics 2015-10-27 Camillo Trapani , Salvatore Triolo

We associate a non-commutative $C^*$-algebra with any locally finite simplicial complex. We determine the $K$-theory of these algebras and show that they can be used to obtain a conceptual explanation for the Baum-Connes conjecture.

Operator Algebras · Mathematics 2007-05-23 Joachim Cuntz

We consider a construction of C*-algebras from continuous piecewise monotone maps on the circle which generalizes the crossed product construction for homeomorphisms and more generally the construction of Renault, Deaconu and…

Operator Algebras · Mathematics 2019-02-20 Thomas L. Schmidt , Klaus Thomsen

We study C*-algebras generated by left regular representations of right LCM one-relator monoids and Artin-Tits monoids of finite type. We obtain structural results concerning nuclearity, ideal structure and pure infiniteness. Moreover, we…

Operator Algebras · Mathematics 2020-07-07 Xin Li , Tron Omland , Jack Spielberg

It is shown that the algebra of continuous functions on the quantum $2n+1$-dimensional lens space $C(L^{2n+1}_q(N; m_0,\ldots, m_n))$ is a graph $C^*$-algebra, for arbitrary positive weights $ m_0,\ldots, m_n$. The form of the corresponding…

Operator Algebras · Mathematics 2016-03-16 Tomasz Brzeziński , Wojciech Szymański

The class of all $\ast$-continuous Kleene algebras, whose description includes an infinitary condition on the iteration operator, plays an important role in computer science. The complexity of reasoning in such algebras - ranging from the…

Logic · Mathematics 2025-02-18 Stepan L. Kuznetsov , Tikhon Pshenitsyn , Stanislav O. Speranski

We introduce a normal form for context-free grammars, called Dyck normal form. This is a syntactical restriction of the Chomsky normal form, in which the two nonterminals occurring on the right-hand side of a rule are paired nonterminals.…

Formal Languages and Automata Theory · Computer Science 2024-01-26 Liliana Cojocaru