\(n\)-ary Cartesian composition of automata

DOI10.1007/s00500-019-04015-1zbMath1436.68184OpenAlexW2940886928MaRDI QIDQ780317

David Staněk, Štěpán Křehlík, Michal Novák

Publication date: 15 July 2020

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-019-04015-1

zbMATH Keywords

hypergroup\(EL\)-semihypergroupCartesian composition of automatacomplete hypergrouptheory of automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Hypergroups (20N20)

Uses Software

• BinaryTest

Cites Work

• On \(EL\)-semihypergroups.
• Enumeration of Varlet and Comer hypergroups.
• Pseudo-median graphs are join spaces
• Some basic properties of EL-hyperstructures
• Join space graphs
• \(EL\)-hyperstructures revisited
• On bipartite graphs whose interval space is a closed join space
• Semi-group, group quotient and homogeneous automata
• Methods of centre manifold and multiple scales in the theory of weakly nonlinear stability for fluid motions
• The cartesian composition of automata
• Cartesian composition and the problem of generalizing the MAC condition to quasi-multiautomata
• Generalized Cascade Decompositions of Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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: \(n\)-ary Cartesian composition of automata