Vai al contenuto principale della pagina

Finite automata, their algebras and grammars : towards a theory of formal expressions / J. Richard Büchi ; editor Dirk Siefkes



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Autore: Büchi, J. Richard
Titolo: Finite automata, their algebras and grammars : towards a theory of formal expressions / J. Richard Büchi ; editor Dirk Siefkes Visualizza cluster
Pubblicazione: New York, : Springer, 1989
Titolo uniforme: Finite automata, their algebras and grammars  
Descrizione fisica: xxii, 316 p. : ill. ; 24 cm
Soggetto topico: 68-XX - Computer science [MSC 2020]
68Q42 - Grammars and rewriting systems [MSC 2020]
68Q70 - Algebraic theory of languages and automata [MSC 2020]
Soggetto non controllato: Alphabet
Automata
Automata Theory
Combinatorics
Grammars
Lattices
Logic
Mathematical logic
Persona (resp. second.): Siefkes, Dirk
Nota di contenuto: The author, who died in 1984, is well-known both as a person and through his research in mathematical logic and theoretical computer science. In the first part of the book he presents the new classical theory of finite automata as unary algebras which he himself invented about 30 years ago. Many results, like his work on structure lattices or his characterization of regular sets by generalized regular rules, are unknown to a wider audience. In the second part of the book he extends the theory to general (non-unary, many-sorted) algebras, term rewriting systems, tree automata, and pushdown automata. Essentially Büchi worked independent of other rersearch, following a novel and stimulating approach. He aimed for a mathematical theory of terms, but could not finish the book. Many of the results are known by now, but to work further along this line presents a challenging research program on the borderline between universal algebra, term rewriting systems, and automata theory. For the whole book and again within each chapter the author starts at an elementary level, giving careful explanations and numerous examples and exercises, and then leads up to the research level. In this way he covers the basic theory as well as many nonstandard subjects. Thus the book serves as a textbook for both the beginner and the advances student, and also as a rich source for the expert.
Titolo autorizzato: Finite automata, their algebras and grammars  Visualizza cluster
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: VAN00269192
Lo trovi qui: Univ. Vanvitelli
Localizzazioni e accesso elettronico https://doi.org/10.1007/978-1-4613-8853-1
Opac: Controlla la disponibilità qui