The cartesian composition of automata

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1977 English Publisher:Springer Science and Business Media LLCJournal:Mathematical Systems Theory, volume 11, pages 239-257 (issn: 0025-5661, eissn: 1433-0490,

Copyright policy )

Authors: Willibald Dörfler;

doi: 10.1007/bf01768479

The cartesian composition of automata

- Summary
- Subjects
- Metrics

Abstract

There are several known ways to define a product automaton on the cartesian product of the state sets of two given automata. This paper introduces a new product called the cartesian composition and discusses how various properties of the product automaton depend on the corresponding properties of the factors. A main result is that any finite connected automaton has a unique representation as a cartesian composition of prime automata.

Keywords

Algebraic theory of languages and automata

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	21
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average