Semisimple Synchronizing Automata and the Wedderburn-Artin Theory

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-09698-8_5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Computing the Shortest Reset Words of Synchronizing Automata

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2013English

A Linear Algebra Approach to Synchronizing Automata

English

Synchronizing Automata Preserving a Chain of Partial Orders

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2009English

Constructively Formalizing Automata Theory

2000English

The Wedderburn Meteorite Revisited

Proceedings of the Royal Society of Victoria
EcologyGeology
2019English

Introduction to the Theory of Finite Automata

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1967English

Combinatorial Group Theory, Inverse Monoids, Automata, and Global Semigroup Theory

International Journal of Algebra and Computation
Mathematics
2002English

FI-SEMISIMPLE, FI-t-SEMISIMPLE AND STRONGLY FI-t-SEMISIMPLE MODULES

International Journal of Pure and Applied Mathematics
MathematicsApplied Mathematics
2017English

A Half-Century of Automata Theory

2001English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy