Subdirectly irreducible fibered automata

• Autorzy: Mućka A.
• Języki publikacji: EN

Abstrakty

EN

A permutational automaton is a fibered automaton with one-element event set or an empty state space. This paper characterizes all subdirectly irreducible permutational automata.

Słowa kluczowe

EN

fibered automata; automata; many-sorted algebras; subdirect product; subdirectly irreducible

• Wydawca: De Gruyter
• Czasopismo: Demonstratio Mathematica
• Rocznik: 2010
• Tom: Vol. 43, nr 4
• Strony: 739--753
• Opis fizyczny: Bibliogr. 6 poz., rys.

Twórcy

autor

Mućka A.

• Faculty of Mathematics And Information Science Warsaw University of Technology Pl. Politechniki 1 00-661 Warsaw, Poland,

Bibliografia

• [1] G. Birkhoff, J. D. Lipson, Heterogenous algebras, J. Combin. Theory 8 (1970), 115–133.
• [2] J. Climent Vidal, J. Soliveres Tur, On the directly and subdirectly irreducible manysorted algebras, 2004, www.uv.es/jkliment/.
• [3] H. Lugowski, Grundzüge der Universallen Algebra, Teubner, Leipzig, 1976.
• [4] A. Mućka, The lattice of the varieties of fibered automata, Discuss. Math. General Algebra and Applications 27 (2007), 87–107.
• [5] A. Mućka, The graphs of fibered automata, Demonstratio Math. 41 (2008), 23–32.
• [6] J. D. H. Smith, Continued fractions, fibered automata, and a theorem of Rosenberg, Multi. Val. Logic 8 (2002), 503–515.