Transition Systems and Regular Events

J. Richard Büchi and Dirk Siefkes
Additional contact information
J. Richard Büchi: Purdue University, Computer Science Department
Dirk Siefkes: Technische Universität Berlin, Fachbereich Informatik

Chapter Chapter 4 in Finite Automata, Their Algebras and Grammars, 1989, pp 133-179 from Springer

Abstract: Abstract We will continue here the study of finite automata behavior, or periodic events, with a presentation of Kleene’s (1956) characterization of these events. In chapter 3 we have already seen a proof of one half of this result, namely, the class P k of periodic events contains all finite subsets of N k , is closed under the Boolean operators, and is closed under the “regular” operators dot and star. Transition systems, also called nondeterministic automata, were introduced by Myhill (1957) to give another, and very elegant, proof of this fact. He noticed that the closure under ∪, · , * is quite obvious for behaviors of finite transition systems, and he used the subset construction to show that these behaviors are no more general than those of finite automata. This matter is contained in sections 4.1, 4.2, and 4.3.

Keywords: Transition System; Periodic Event; Regular Expression; Finite Index; Finite Automaton (search for similar items in EconPapers)
Date: 1989
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-4613-8853-1_4

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

DOI: 10.1007/978-1-4613-8853-1_4

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