Results on homomorphic realization of automata by &agr;0-products

Authors:
Zoltán Ésik
Affiliations:
Technische Univ., Munich, Germany
Venue:
Theoretical Computer Science
Year:
1991

Citing 0
Cited 3

The parallel complexity of deterministic and probabilistic automata

Journal of Automata, Languages and Combinatorics
Temporal logic with cyclic counting and the degree of aperiodicity of finite automata

Acta Cybernetica
Actions, wreath products of C-varieties and concatenation product

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday

Quantified Score

Hi-index	5.24

Visualization

Abstract