Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata"

Details Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata" Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata"

2009-05-26

arxiv.org/abs/0905.4193v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

This paper gives answers to questions formulated as open in the paper "On State Observability in Deterministic Finite Automata" by A. Mateescu and Gh. Paun. Specifically, it demonstrates that for all k >= 2, the families of regular languages acceptable by deterministic finite automata with no more than k semi-observable states, denoted by Tk, are anti-AFL's, and that the family T1 differs in the closure property under Kleene +.

Affiliated with

Also associated with

No associations

Rating

Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata" does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata", we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata" will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-647189