Conclusion

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

A chapter in Finite Automata, Their Algebras and Grammars, 1989, pp 292-292 from Springer

Abstract: Abstract This chapter has not been fully worked out. Many details the reader will be able to add, by extending step by step the ideas we have presented in the unary case. He is advised to look in Birkhoff (1948) for a nice presentation of universal algebra. Birkhoff and Tarski laid the foundations of this theory, in the 1930s. Tarski’s (1968) equational theories are precisely a continuation of Thue’s ideas of 1910. As text we also mention Grätzer (1968).

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_8

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

DOI: 10.1007/978-1-4613-8853-1_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 ().