The algorithm for checking transitivity of mappings associated with the finite state machines from the groups AS_p

DOI10.18500/1816-9791-2017-17-1-85-95MaRDI QIDQ5363340zbMATH OpenOpenAlexFDO

Authors Maksim V. Karandashov

Publication date 5 October 2017

Published in Izvestiya of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.18500/1816-9791-2017-17-1-85-95

zbMATH Keywords

\(AS_p\) groupsautomata mappingfinite state machinetransitivity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40)

Recommendations

• An algorithm for recognizing the spherical transitivity of an initial binary automaton
• scientific article; zbMATH DE number 1537527
• scientific article; zbMATH DE number 1166283
• On the membership problem for finite automata over symmetric groups
• scientific article; zbMATH DE number 3984580

Cited in

(2)

• An algorithm for recognizing the spherical transitivity of an initial binary automaton
• An algorithm for the formation of a hierarchical system of invariants of isomorphisms of mappings of finite sets

This page was built for publication: The algorithm for checking transitivity of mappings associated with the finite state machines from the groups \(AS_p\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363340)