NDLI: On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type

Content Provider	IEEE Xplore Digital Library
Author	Manada, A. Kashyap, N.
Copyright Year	2006
Description	Author affiliation: Dept. Math. & Stat., Queen's Univ., Kingston, Ont. (Manada, A.; Kashyap, N.)
Abstract	A construction of Crocheniore, Mignosi and Restivo in the automata theory literature gives a presentation of a finite-type constrained system (FTCS) that is deterministic and has a relatively small number of states. This construction is thus a good starting point for determining the minimal deterministic presentation, known as the Shannon cover, of an FTCS. We analyze in detail the Crochemore-Mignosi-Restivo (CMR) construction in the case when the list of forbidden words defining the FTCS is of size at most two. We show that if the FTCS is irreducible, then an irreducible presentation for the system can be easily obtained from the CMR presentation. By studying the follower sets of the states in this irreducible presentation, we are able to explicitly determine the Shannon cover in some cases. In particular, our results show that the CMR construction directly yields the Shannon cover in the case of an irreducible FTCS with exactly one forbidden word, but this is not in general the case for FTCS's with two forbidden words
Starting Page	1477
Ending Page	1481
File Size	216890
Page Count	5
File Format	PDF
ISBN	142440505X
DOI	10.1109/ISIT.2006.262113
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-07-09
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Constraint theory Automata Merging Mathematics Statistics Information theory Formal languages Computer science Terminology Labeling
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type

Irreducible compositions of degree two polynomials over finite fields have regular structure

Periodic-Finite-Type Shift Spaces

The Moore and the Myhill Property For Strongly Irreducible Subshifts Of Finite Type Over Group Sets

A Physically Universal Turing Machine

On the representation of formal languages using automata on networks

On the rank of the communication matrix for deterministic two-way finite automata

Ideal Separation and General Theorems for Constrained Synchronization and their Application to Small Constraint Automata

Constructions with Countable Subshifts of Finite Type

On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type

Similar Documents

On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type

Irreducible compositions of degree two polynomials over finite fields have regular structure

Periodic-Finite-Type Shift Spaces

The Moore and the Myhill Property For Strongly Irreducible Subshifts Of Finite Type Over Group Sets

A Physically Universal Turing Machine

On the representation of formal languages using automata on networks

On the rank of the communication matrix for deterministic two-way finite automata

Ideal Separation and General Theorems for Constrained Synchronization and their Application to Small Constraint Automata

Constructions with Countable Subshifts of Finite Type

On the Shannon Covers of Certain Irreducible Constrained Systems of Finite Type