J.E. Hopcroft and J.D. Ullman, "Introduction to Automata Theory, Languages and Computation", Addison-Wesley, 1979.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....output. X is valid for D , hD (X ) is valid for hD (D) In other words, the XGrind compressed document is valid with respect to its associated compressed DTD. The proof for this follows from the closure of regular languages and context free languages under homomorphisms and inverse homomorphisms [7]. 3.3. System Architecture The architecture of the XGrind compressor, along with the information flows, is shown in Figure 1. The XGrind Kernel is the heart of the compressor. It starts off by invoking the DTD Parser, which parses the DTD of the XML document, initializes frequency tables for ....

J. Hopcroft and J. Ullman, "Introduction to Automata Theory, Languages, and Computation", AddisonWesley, 1979.

....CCFLs which do (perhaps barely) separate. For example, let ff be a very slow growing, linear time computable inverse of Ackermann s function as from [CLRS01, x21.4] let C 1 be DTIME(n Delta (log n) Delta ff(n) and let C 0 be DTIME(n) These classes have long been known to separate [HS65,HU79]. Furthermore, it is straightforward that some learning device (synonymously, inductive inference machine or IIM) M 0 , fed the values of any element f of this C 0 , outputs nothing but linear time programs and eventually converges to a fixed linear time program which correctly computes f . This ....

....delayed diagonalization (or slowed simulation) Lad75,RC94] with cancellation [Blu67] or zero injury) complexitybounded self reference [RC94] and careful subrecursive programming [RC94] Fix k 1. Let C 1 = DTIME(n Delta (log n) Delta ff(n) and C 0 = DTIME(n ) These classes separate [HS65,HU79], and it is straightforward that some learning device EX learns this C 0 outputting only conjectures that run in k degree polytime. However, again from Theorems 19 and 20, for any slightly more general learning device M which EX learns this C 1 , there will be an easy f , an f 2 Z , so that, on ....

[Article contains additional citation context not shown here]

J. Hopcroft and J. Ullman, Introduction to automata theory languages and computation, Addison-Wesley Publishing Company, 1979.

....expressions have previously been established for instance, reasoning by using a sound and complete axiomatization [5,15] or by minimization of automata representing the Email: hubes cs.cornell.edu Email: riccardo cs.cornell.edu c #2003 Published by Elsevier Science B. V. expressions [3]. However, the coinduction proof technique can give relatively short proofs, and is fairly simple to apply. Recently, Kozen [6] introduced Kleene Algebra with Tests (KAT) an extension of KA designed for the particular purpose of reasoning about programs and their properties. The regular ....

Hopcroft, J. E. and J. D. Ullman, "Introduction to Automata Theory, Languages, and Computation," Addison Wesley, 1979.

....robot assembly task typically does not depend on clock time, but on events that occur as the assembly task proceeds. If a plan is represented as a state graph or state table, conditions for transition from one subtask activity to the next can be specified in terms of either time or events, or both [20]. Df: process plan a plan, typically without a specified schedule, that defines the sequence of tasks required to manufacture a single part, or part type. In manufacturing, process plans for specific parts most often are generated by humans that are experienced in process planning. ....

Hopcroft, J. and Ullman, S. (1979) Introduction to Automata Theory: Languages and Computation, Addison-Wesley, Reading, MA

....system under analysis , and Is S 1 , a concurrent system, the same as another concurrent system S 2 In the transition based models the behavior of a system is generally modeled as a sequence of configurations of an automaton. Examples of the transition based models are finite state machines [Hopcroft 79] S R Model [Aggarwal 87] UCLA graphs [Cerf 72] and Petri nets [Reisig 85] Examples of modeling and analysis tools based on these models are Spanner [Aggarwal 87] Affirm [Gerhart 80] and PROTEAN [Billington 88] Algebraic systems promote hierarchical description and verification, whereas ....

....of action followed by another sequence. The Kleene closure of a set A is defined as A where A = A:A: i times This operator is useful for modeling the situations in which some sequence can be repeated any number of times. For details of these operators, the reader is referred to [Hopcroft 79] 2.2 Interleaving To define concurrent operations, it is especially useful to be able to specify the interleaving of two sequences. Consider for example the behavior of two independent vending machines VM1 and VM2. The behavior of VM1 may be defined as (coin:choc) and the behavior of VM2 as ....

[Article contains additional citation context not shown here]

J.Hopcroft and J.Ullman, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley Pub. Co., Reading.

....requests define the protocols of the components. Protocols are not explicit in most industrial component models. Work proposed to integrate protocols in academic component models [5,16,19,12,20] has produced interesting results. In [5] we defined protocols using finite state machines (FSM) [8]. We developed a set of operators to manage FSM based protocols. This set of operators is interesting because it verifies a property of substituability. The property of substituability ensures that compositions of components still verify the protocols of the composed components. We aim at ....

Hopcroft, J. E., R. Motwani and J. D. Ullman, "Introduction to Automata Theory, Languages, and Computation," Addison-Wesley, 2001, 521 pp.

....next. Languages are sets of sentences and a sentence is a finite object# the set of all possible sentences can be coded into N the set of natural numbers. Hence, languages may be construed as subsets of N . A grammar for a language is a set of rules that accepts (or equivalently, generates [14]) the language. Essentially,any computer program may be viewed as a grammar. Languages for which a grammar exists are called recursively enumerable. A text for a language L is any infinite sequence that lists all and only the elements of L# repetitions are permitted. A learning machine is an ....

....computable function computed byprogrami in the system. The letter, p, in some contexts, with or without decorations, ranges over programs# in other contexts p ranges over total functions with its range being construed as programs. By Phi we denote an arbitrary fixed Blum complexity measure [3, 14] for the system. By W i we denote domain( i ) W i is, then, the r.e. set language ( N) accepted (or equivalently, generated) bythe program i. Symbol E will denote the set of all r.e. languages. Symbol L, with or without decorations, ranges over E. Symbol L, with or without decorations, ....

J. Hopcroft and J. Ullman. Introduction to Automata Theory Languages and Computation. Addison-Wesley Publishing Company,1979. 23

....computable function computed by program i in the system. The letter, p, in some contexts, with or without decorations, ranges over programs# in other contexts p ranges over total functions with its range being construed as programs. By Phi we denote an arbitraryfiffiit Blum complexity measure [3, 10] for the system. By W i we denote domain( i ) W i is, then, the r.e. set language ( N) accepted (or equivalently, generated) by the program i.Wealsosaythati is a grammar for W i .Symbol E will denote the set of all r.e. languages. Symbol L, with or without decorations, ranges over E.Symbol ....

J. Hopcroft and J. Ullman. Introduction to Automata Theory Languages and Computation. Addison-Wesley Publishing Company,1979.

....that Artificial Intelligence can be framed by an elegant mathematical theory. Some progress has also been made towards an elegant computational theory of intelligence. Annotated Bibliography Introductory textbooks. The book of Hopcroft and Ullman, and in the new revision, co authored by Motwani [HMU01] is a very readable elementary introduction to automata theory, formal languages, and computation theory. The Artificial Intelligence book [RN95] by Russell and Norvig gives a comprehensive overview over AI approaches in general. For an excellent introduction to Algorithmic Information Theory, ....

J. E. Hopcroft, R. Motwani, and J. D. Ullman. "Introduction to Automata Theory, Language, and Computation". Addison--Wesley, 2nd edition edition, 2001.

....which the final overlap formula can be inferred easily. However, this method is not suitable for our application since in the last step, the size of the regular expression can blow up (i.e. O( nm) nm ) and the output regular expression is typically very long and complicated (Chapter 4. 3 [HMU01]) Therefore, instead, we propose a simple rewriting based algorithm to compose the overlap formula. The meta characteristic of the overlap formula of two relaxed twigs is that the formula would take whatever tighter condition of two twigs. Consider two extension compatible twigs R = V R , ....

..... n , b 1 ) a n , b 2 ) a n , b n ) Algorithm 1: migrateChoice 104 as convertChoice( Now consider a general case where a content model can in turn contain further nested content models in it and all use operators in a complex manner. From a basic regular expression algebraic law ([HMU01], page 118) the following equality holds: a b) a , b ) Using the law, the shown Algorithm migrateChoice( determines an equivalent regular expression of the form (r 1 . n ) where no r i (1 n) contains operator (i.e. remove in inner groups except ones in the ....

J. E. Hopcroft, R. Motwani, and J. D. Ullman. "Introduction to Automata Theory, Language, and Computation". Addison--Wesley, 2nd edition, 2001.

....queries in monadic datalog over unranked trees. Analogously to query automata for ranked trees, we define the class of strong query automata over unranked trees as a tool for proving the above theorem. Let two way deterministic finite (string) automata (2DFA) be defined in the normal way (e.g. [17]) Definition 4.5. 25] A strong unranked query automaton (SQA ) is a tuple #, F, s, ## , ## , # , #root , # leaf , ##, where Q, F , s, U , D, # leaf , #root and # are as in Definition 4.1. Let Uup and Ustay be two disjoint regular subsets of U # . The transition function for up ....

J. E. Hopcroft and J. D. Ullman. "Introduction to Automata Theory, Languages, and Computation". Addison-Wesley Publishing Company, Reading, MA USA, 1979.

No context found.

J.E. Hopcroft and J.D. Ullman, "Introduction to Automata Theory, Languages and Computation", Addison-Wesley, 1979.

No context found.

J.E. Hopcroft and J.D. Ullman, "Introduction to Automata Theory, Languages and Computation" (Addison--Wesley, Reading, MA, 1979).

No context found.

J. E. Hopcroft and J. D. Ullman, "Introduction to Automata Theory, Languages and Computation ". Addison-Wesley, 1979.

No context found.

J. E. Hopcroft, J. D. Ullman, "Introduction to Automata Theory, Languages, and Computation", Addison-wesley Publishing Company, Inc., Chapter 13, 1979.

No context found.

J. Hopcroft, J. Ullman, "Introduction to Automata Theory, Languages and Computation", Addison-Wesley, 1979.

No context found.

J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory; Languages; and Computation, Addison-Wesley, 1979.

No context found.

J. Hopcroft and J. Ullman, "Introduction to Automata Theory, Languages, and Computation", AddisonWesley, 1979.

No context found.

J. E. Hopcroft, J. D. Ullman, "Introduction to Automata Theory, Languages, and Computation", Addison-wesley Publishing Company, Inc., Chapter 13, 1979.

No context found.

J. Hopcroft, J. Ullman, "Introduction to automata theory, languages, and computation ", Addison-Wesley, Reading, MA, 1979.

No context found.

Hopcroft, J. and J. Ullman, "Introduction to Automata Theory, Languages, and Computation," Addison-Wesley, N. Reading, MA, 1980.

No context found.

John E. Hopcroft and Jeffrey D. Ullman, "Introduction to Automata Theory, Languages and Computation," AddisonWesley, 1979.

No context found.

J.E. Hopcroft, J.D. Ullman, "Introduction to Automata Theory, Languages and Computations", Addison-Wesley, Reading, 1979.

No context found.

Hopcroft, J.E. and Ullman, J.D. "Introduction to Automata Theory, Languages, and Computation" Addison-Wesley Publishing Company, Inc. 1979.

No context found.

Hopcroft, J.E., Ullman, J., "Introduction to automata theory, languages and computation", Addison-Wesley, New York, 1979.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC