Calculating with Automata

Authors:
Jos C. Baeten
Affiliations:
Division of Computer Science, Technische Universiteit Eindhoven,
Venue:
Concurrency, Graphs and Models
Year:
2008

Citing 7
Cited 0

Communicating sequential processes

Communicating sequential processes
On the consistency of Koomen's fair abstraction rule

Theoretical Computer Science
Process algebra

Process algebra
Derivatives of Regular Expressions

Journal of the ACM (JACM)
An Introduction to Formal Languages and Automata

An Introduction to Formal Languages and Automata
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
A characterization of regular expressions under bisimulation

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Some elements are presented of a forthcoming textbook on automata theory and formal languages, that puts more emphasis on equational reasoning. Some advantages of such an approach are discussed. This paper is dedicated to Ugo Montanari, who has contributed such a lot to concurrency theory and the theory of computational models.