Distinguishability of Infinite Automata

Ch. Faisi

A chapter in Systems Theory Research, 1973, pp 219-222 from Springer

Abstract: Abstract Let 𝔄 = {(Q, X, Y, φ𝔄, ψ𝔄} be a strongly connected synchronous automaton (i.e., the length of an output word is equal to the length of an input word), where Q is the set of states of the automaton, X the input alphabet, Y the output alphabet, φ𝔄 the transition function, and ψ𝔄 the output function. The automaton 𝔄 is either finite or infinite.

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_9

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

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

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 ().