• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 6,286
Next 10 →

Table 6. Type checking of processes

in Goal-oriented Composition of Services
by Sebastian Nanz, Terkel K. Tolstrup
"... In PAGE 10: ...1), s is the state in which the conformance check starts, and A is the smallest interface automaton that con- forms to the process P. The typing rules for processes are given in Table6 and for actions in Table 7. The rules match the intuition behind the abstractions we have introduced informally in Section 3.... ..."

Table 3. The BUFFER automaton.

in Correctness of Vehicle Control Systems - A Case Study
by H.B. Weinberg, Nancy Lynch 1996
"... In PAGE 7: ... The BUFFER automaton. The BUFFER automaton appears in Table3 . The variable request stores a command while it is being buffered.... ..."
Cited by 12

Table 1: The states of the automaton.

in On a new family of automata
by Alexander Okhotin
Cited by 3

Table 7. Order Automaton

in Representation of Some Cellular Automata by Means of Equivalent L
by Manuel Alfonseca, Alfonso Ortega
Cited by 2

Table 1. Comparison of the average number of states of Aho-Corasick automaton, automaton Spi of section 3 and minimized automaton

in A unifying framework for seed sensitivity and its application to subset seeds (extended abstract)
by Gregory Kucherov, Laurent NoƩ, Mikhail A. Roytberg 2005
"... In PAGE 10: ...Table 1. Comparison of the average number of states of Aho-Corasick automaton, automaton Spi of section 3 and minimized automaton Corasick automaton not only on non-binary alphabets (which was expected), but also on the binary alphabet (cf Table1 (a)). Note that for a given seed, one can define a surjective mapping from the states of the Aho-Corasick automaton onto the states of our automaton.... ..."
Cited by 11

Table 2: Dynamical Automaton 1.

in Sentence Processing and Linguistic Structure
by Whitney Tabor
"... In PAGE 21: ... (Implemented in Dynamical Automaton 1). We de ne a DA (called DA 1) that recognizes the language of Grammar 2 by the Input Map shown in Table2 . The essence of the DA is a two-element vector, z, corresponding to a position on the Sierpinski triangle.... In PAGE 21: ... Given a compartment and a legal input for that compartment, the change in z that results from reading the input is shown in the \State Change quot; column. If we specify that the DA must start with z = (1/2, 1/2), make state changes according to the rules in Table2 as symbols are read from an input string, and return to z = (1/2, 1/2) (the Final Region) when the last symbol is read, then the computer functions as a recognizer for the language of Grammar 2. To see this intuitively, note that any subsequence of the form \a b c d quot; invokes the identity map on z.... ..."

Table 1: Automaton States 4

in A Symmetric Nine-State Automaton for the Generalized Firing Synchronization Problem
by Amber Settle 1997
Cited by 1

Table 2. Transition function of the automaton

in unknown title
by unknown authors 2001
Cited by 1

TABLE 1: Description of the Control Automaton

in Implementation Of On-Chip Programmable Digital Cellular Neural Network With Optoelectronic Interface
by M. Winiewski, A. Wielgus, W. Pleskacz, S. Jankowski

Table 2. Transition function of the automaton

in unknown title
by unknown authors
Next 10 →
Results 1 - 10 of 6,286
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2016 The Pennsylvania State University