A bialgebraic approach to automata and formal language theory

DOI10.1016/j.apal.2011.09.019zbMath1241.18004arXiv0807.4553OpenAlexW2083840254MaRDI QIDQ408529

James Worthington

Publication date: 10 April 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0807.4553

zbMATH Keywords

automatanondeterminismsemimodulebialgebra\(K\)-linear automata

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Algebraic theory of languages and automata (68Q70) Categories of machines, automata (18B20)

Related Items (4)

A CATEGORICAL APPROACH TO ALGEBRAS AND COALGEBRAS ⋮ Language acceptability of finite automata based on theory of semi‐tensor product of matrices ⋮ Semicorings and Semicomodules ⋮ Hopf Semialgebras

Cites Work

• A completeness theorem for Kleene algebras and the algebra of regular events
• Tensor products of idempotent semimodules. An algebraic approach
• Universal coalgebra: A theory of systems
• Bisimulation relations for weighted automata
• Automatic Proof Generation in Kleene Algebra
• The realization of input-output maps using bialgebras
• Direct and dual laws for automata with multiplicities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A bialgebraic approach to automata and formal language theory