IEEE - Institute of Electrical and Electronics Engineers, Inc. - Checking automata and one-way stack languages

9th Annual Symposium on Switching and Automata Theory (swat 1968)

Author(s): Greibach, Sheila
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 October 1968
Conference Location: Schenedtady, NY, USA, USA
Conference Date: 15 October 1968
Page(s): 287 - 291
ISSN (Paper): 0272-4847
DOI: 10.1109/SWAT.1968.6
Regular:

A checking automaton is equivalent to a one-way nonerasing stack automaton which, once it enters its stack, never again writes on its stack. The checking automaton languages (cal) form a full AFL... View More

Advertisement