You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Monadic Second Order Definability as a Common Characterization of Finite Automata, Certain Classes of Programs and Logics

Article type: Research Article

Authors: Wasilewska, Anita

Affiliations: Lafayette College of Easton

Abstract: We introduce the notion of monadic second order definability (m.s.o definability) of automata, programs and logics and point out some classes of automata (theorem 7), programs (theorem 8) and logics (theorem 9) which are m.s.o definable.

Keywords: m.s.o definability, finite automaton, FC-algorithm, theorem proving system

DOI: 10.3233/FI-1985-83-404

Journal: Fundamenta Informaticae, vol. 8, no. 3-4, pp. 309-320, 1985

Received April 1984
|
Published: 1 July 1985
Price: EUR 27.50
Show more