General Linear Automata

A. A. Muchnik

A chapter in Systems Theory Research, 1973, pp 179-217 from Springer

Abstract: Abstract Many problems in the theory of control systems reduce to the objects considered in the present paper -general linear automata. The necessity of studying them is manifested most clearly in the problem of reducing finite probabilistic automata [12, 13, 15, 19] which are an important particular case of general linear automata. On the other hand, many properties which apply to finite deterministic automata can be generalized successfully for the case of general linear automata, their proof turning out to be sometimes simpler than well-known proofs of analogous theorems for finite automata.

Date: 1973
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4757-0079-4_8

Ordering information: This item can be ordered from
http://www.springer.com/9781475700794

DOI: 10.1007/978-1-4757-0079-4_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().