Automata, Languages, and Machines

Home
/
Papers
/
Automata, Languages, and Machines

Book•

Automata, Languages, and Machines

01 Mar 1974-

TL;DR: This book attempts to provide a comprehensive textbook for undergraduate and postgraduate mathematicians with an interest in formal languages and automata, written by Professor Ian Chiswell.

read less

Abstract: The 80 revised papers presented together with two keynote contributions and four invited papers were carefully reviewed and sele... The study of formal languages and automata has proved to be a source of much interest and discussion amongst mathematicians in recent times. This book, written by Professor Ian Chiswell, attempts to provide a comprehensive textbook for undergraduate and postgraduate mathematicians with an interest i...

...read moreread less

Citations

PDF

Open Access

More filters

Journal Article•DOI•

Supervisory control of a class of discrete event processes

[...]

Peter J. Ramadge¹, W. M. Wonham¹•Institutions (1)

University of Toronto¹

01 Jan 1987-Siam Journal on Control and Optimization

TL;DR: In this paper, the control of a class of discrete event processes, i.e., processes that are discrete, asynchronous and possibly non-deterministic, is studied. And the existence problem for a supervisor is reduced to finding the largest controllable language contained in a given legal language, where the control process is described as the generator of a formal language, while the supervisor is constructed from the grammar of a specified target language that incorporates the desired closed-loop system behavior.

...read moreread less

Abstract: This paper studies the control of a class of discrete event processes, i.e. processes that are discrete, asynchronous and possibly nondeter-ministic. The controlled process is described as the generator of a formal language, while the controller, or supervisor, is constructed from the grammar of a specified target language that incorporates the desired closed-loop system behavior. The existence problem for a supervisor is reduced to finding the largest controllable language contained in a given legal language. Two examples are provided.

...read moreread less

3,432 citations

Journal Article•DOI•

Enforceable security policies

[...]

Fred B. Schneider¹•Institutions (1)

Cornell University¹

01 Feb 2000-ACM Transactions on Information and System Security

TL;DR: A precise characterization is given for the class of security policies enforceable with mechanisms that work by monitoring system execution, and automata are introduced for specifying exactly that class ofSecurity policies.

...read moreread less

Abstract: A precise characterization is given for the class of security policies enforceable with mechanisms that work by monitoring system execution, and automata are introduced for specifying exactly that class of security policies. Techniques to enforce security policies specified by such automata are also discussed.

...read moreread less

1,292 citations

Cites background from "Automata, Languages, and Machines"

...A class of Büchi automata [6] that accept safety properties was introduced (although not named) in [2]....
[...]
...As it happens, a rich set of analytical tools does exist for security automata, because security automata are a class of Büchi automata [6] which are widely used in computer-aided program verification tools....
[...]
...A class of Büchi automata [Eilenberg 1974] that accept safety properties was introduced (although not named) in Alpern and Schneider [1987]....
[...]

Journal Article•DOI•

On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines

[...]

Lenore Blum, Michael Shub, Steve Smale

01 Jul 1989-Bulletin of the American Mathematical Society

1,131 citations

Book•

Category Theory For Computing Science

[...]

Michael Barr¹, Charles Wells²•Institutions (2)

McGill University¹, Case Western Reserve University²

01 Oct 1995

TL;DR: Sketches for Endofunctors: Catesian Closed Categories, Diagrams, and Toposes.

...read moreread less

Abstract: Preliminaries. Categories. Functors. Diagrams. Naturality and Sketches. Products and Sums. Catesian Closed Categories. Finite Discrete Sketches. Limits and Colimits. More About Sketches. Fibrations. Adjoints. Algebras for Endofunctors. Toposes.

...read moreread less

1,006 citations

Book•

Semigroups and combinatorial applications

[...]

Gerard Lallement

01 Jan 1979

833 citations

Cites background from "Automata, Languages, and Machines"

...Eilenberg's volumes [2] deal with both semigroups and languages in a profound and original way which will clearly have a decisive influence on the subject, but it is not (and was not intended to be) a survey of what was known....
[...]