IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites

Cart (Loading....) | Create Account | Sign In

Author Search^beta | Advanced Search | Preferences | | More Search Options

Browse Conference Publications > Switching and Automata Theory, ...

Switching and Automata Theory, 1972., IEEE Conference Record of 13th Annual Symposium on

| Create Account

IEEE Account

Change Username/Password
Update Address

Purchase Details

Payment Options
Order History
Access Purchased Documents

Profile Information

Communications Preferences
Profession and Education
Technical Interests

Need Help?

US & Canada: +1 800 678 4333
Worldwide: +1 732 981 0060
Contact & Support

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.

Please enter a valid username or password.

For Institutional Users:

More Search Options

Switching and Automata Theory, 1972., IEEE Conference Record of 13th Annual Symposium on

Date 25-27 Oct. 1972

Quick Links

Filter Results

You have selected:

Title History

[Front cover]

Table of contents

Foreword

Program equivalence and context-free grammars

Effective computability in algebraic structures

Representing program schemes in logic

SGML results in computational topology

On homomorphisms, simulations, correctness and subroutines for programs and program schemes

Honest bounds for complexity classes of recursive functions

Renamings in program schemas

Consistency of synchronization nets using P and V operations

On the decomposition of asynchronous systems

Fast modular transforms via division

The efficient calculation of powers of polynomials

On the number of multiplications for the evaluation of a polynomial and all its derivatives

On the relation of graph grammars and graph automata

The emptiness problem for automata on infinite trees

The equivalence problem for regular expressions with squaring requires exponential space

Some related problems from network flows, game theory and integer programming

Some results on the effect of arithmetics on comparison problems

Fast allocation algorithms

Optimal scheduling on multi-processor computing systems

A fast algorithm for the elimination of common subexpressions

Universal test sets for logic networks

Multiple faults in Reed-Muller canonic networks

IEEE Account

Purchase Details

Profile Information

Need Help?