Generalized Pair Algebra With Applications to Automata Theory
- 1 April 1968
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 15 (2) , 304-316
- https://doi.org/10.1145/321450.321462
Abstract
The concept of a pair algebra is extended so that it can be defined between similar relational systems. It is shown that when the relational systems under consideration are lattices a generalized pair algebra specializes to a pair algebra. Closure properties of generalized pair algebra are investigated and their applications to automata theory are considered.Keywords
This publication has 3 references indexed in Scilit:
- Products of automata and the problem of coveringTransactions of the American Mathematical Society, 1965
- Extended Topology: The Continuity ConceptMathematics Magazine, 1963
- Minimizing the Number of States in Incompletely Specified Sequential Switching FunctionsIEEE Transactions on Electronic Computers, 1959