The graphs of fibered automata

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

Abstrakty

EN

Fibered automata can be described by their transition diagrams, certain edge-labelled digraphs. We describe digraphs that are unlabelled transition diagrams of fibered automata.

Słowa kluczowe

EN

automata; fibered automata; digraphs; transition diagrams

PL

automata; grafy skierowane; diagramy przejściowe

• Wydawca: De Gruyter
• Czasopismo: Demonstratio Mathematica
• Rocznik: 2008
• Tom: Vol. 41, nr 1
• Strony: 23--32
• Opis fizyczny: Bibliogr. 7 poz., rys.

Twórcy

autor

Mućka A.

• Faculty of Mathematics and Information Science Warsaw University of Technology, 00-661 Warsaw, Poland,

Bibliografia

• [1] G. Birkhoff, J. D. Lipson, Heterogenous algebras, J. Comb. Th. S (1970), 115-133.
• [2] B. Bollobas, Modern Graph Theory, Springer, 1998.
• [3] P. J. Higgins, Algebras with a scheme of operatora, Math. Nachr. 27(1963), 116-132.
• [4] H. Lugowski, Grundzüge der Universalten Algebra, Teuber, Leipzig, 1976.
• [5] A. Mućka, The lattice of the varieties of fibered automata, Discussiones Mathematicae General Algebra and Applications 27 (2007), 87-107.
• [6] I. Rosenberg, A classification of universal algebran by infinitary relations. Algebra Universalis 1 (1972), 350-353.
• [7] J. D. H. Smith, Continued fractions, fibered automata, and a theorem of Rosenberg, Multiple-Valued Logic 8 (2002), 503-515.