Maximal Finite Orders of Linear Automata over an Arbitrary Field

If input and output alphabets of a Mealy automaton coincide, then one can study the order problem with respect to the superposition operation. The present paper provides exact upper bounds on orders of linear automata over any field.

Authors

Nikita Muravev (ORCID: https://orcid.org/0000-0002-2828-8283)

Institutions

Lomonosov Moscow State University (RU)

Publication Details

Journal: Moscow University Mathematics Bulletin
Published: 2024-10-01
DOI: https://doi.org/10.3103/s0027132224700335
Primary Topic: semigroups and automata theory
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Maximal Finite Orders of Linear Automata over an Arbitrary Field

Nikita Muravev

Oct 1, 2024

Moscow University Mathematics Bulletin

semigroups and automata theory

article

Maximal Finite Orders of Linear Automata over an Arbitrary Field

Nikita Muravev

October 1, 2024article en

Abstract

Moscow University Mathematics BulletinVol. 79(5)

Lomonosov Moscow State University (RU)

Openalex Percentile: Top 71%

semigroups and automata theory

DOI Source OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Maximal Finite Orders of Linear Automata over an Arbitrary Field — Nikita Muravev · Moscow University Mathematics Bulletin (2024) | TGRS Research Map | TGRS