A Bialgebraic Approach to Automata and Formal Language Theory

DOI10.1007/978-3-540-92687-0_31zbMath1211.68261OpenAlexW2152368840MaRDI QIDQ3605547

James Worthington

Publication date: 24 February 2009

Published in: Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.247.2110

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

Tropical Time Series, Iterated-Sums Signatures, and Quasisymmetric Functions, Algebra-coalgebra duality in brzozowski's minimization algorithm, Product Rules and Distributive Laws

Cites Work

• A completeness theorem for Kleene algebras and the algebra of regular events
• Quantum automata and quantum grammars
• 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