IEEE - Institute of Electrical and Electronics Engineers, Inc. - On proving languages non-regular

2010 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)

Author(s): Chedid, F.B.
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 May 2010
Conference Location: Hammamet, Tunisia, Tunisia
Conference Date: 16 May 2010
Page(s): 1 - 3
ISBN (CD): 978-1-4244-7715-9
ISBN (Electronic): 978-1-4244-7717-3
ISBN (Paper): 978-1-4244-7716-6
DOI: 10.1109/AICCSA.2010.5586960
Regular:

A well known characterization of regular languages is provided by Nerode's Theorem. However, the pumping lemma is often a more useful tool in demonstrating properties of regular languages. In this... View More

Advertisement