2000 character limit reached
Essential Inputs and Minimal Tree Automata
Published 23 Feb 2007 in cs.CC and cs.DM | (0702136v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.