Acceptance Probablity Of Classess In The Lower Chomsky Hierarchy

Citation

Michael , Hartwig (2010) Acceptance Probablity Of Classess In The Lower Chomsky Hierarchy. PhD thesis, University of Multimedia.

Full text not available from this repository.

Abstract

The study of the density of regular and context-free languages has attracted some attention culminating in the fact that those languages are either sparse, when the density can be bounded by a polynomial, dense otherwise. This work shows that for all regular and nonambiguous context-free languages the number of accepted words of given length.

Item Type: Thesis (PhD)
Subjects: Q Science > QC Physics
Divisions: Faculty of Computing and Informatics (FCI)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 27 Mar 2012 03:17
Last Modified: 27 Mar 2012 03:17
URII: http://shdl.mmu.edu.my/id/eprint/3400

Downloads

Downloads per month over past year

View ItemEdit (login required)