Essential Inputs and Minimal Tree Automata

Details Essential Inputs and Minimal Tree Automata Essential Inputs and Minimal Tree Automata

2007-02-23

arxiv.org/abs/cs/0702136v1

Proc. of ICDMA, 31.08-02.09.2001, Bansko, v.6, 77-85 p

Computer Science

Computational Complexity

7 pages, 1 figure, Sixth International Conference on Discrete Mathematics and Applications, 31.08-02.09.2001, Bansko

Scientific paper

We continue studying essential inputs of trees and automata. Strongly
essential inputs of trees are introduced and studied. Various examples for
application in Computer Science are shown.

Affiliated with

Also associated with

No associations

Rating

Essential Inputs and Minimal Tree 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 Essential Inputs and Minimal Tree Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Essential Inputs and Minimal Tree Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-691915