CS Structure

About CS Structure | Search | Help  

 

  • distributed system; shared memory; operating system; real-time system ( Subthemes )
  •          linear logic; garbage collection; mobile agent; term rewriting ( Subthemes )
  •                  linear logic; proof planning; type theory; proof nets ( Subthemes )
  •                          linear logic; proof nets; categorial grammar; lambek calculus ( Subthemes )
  • INTRODUCTION TO AUTOMATA THEORY - HOPCROFT, ULLMAN  
    By
    Date 
    Refs | Theme tree | Cited by 1518 This paper is cited in the following contexts

    Citation List: key=1002824
     

    Citation List:

    Citation Tree

    1) STATECHARTS: A VISUAL FORMALISM FOR COMPLEX SYSTEMS  
    By Communicated A. Pnueli    David Harel
    Date  November 2002
    Refs | Theme tree | Cited by 955 |  CiteSeer   (Hub Citation)

    2) BISIMULATION EQUIVALENCE IS DECIDABLE FOR ALL CONTEXT-FREE PROCESSES  
    By Colin Stirling    Hans Huttel
    Date  August 1996
    Refs | Theme tree | Cited by 88 |  CiteSeer  

    3) ON CONTROLLABILITY AND NORMALITY OF DISCRETE EVENT DYNAMICAL SYSTEMS  
    By Ratnesh Kumar    Steven I. Marcus    Vijay Garg
    Date  July 1998
    Refs | Theme tree | Cited by 31 |  CiteSeer  

    4) CONSTRUCTING DETERMINISTIC FINITE-STATE AUTOMATA IN RECURRENT NEURAL NETWORKS  
    By C. Lee Giles    Christian W. Omlin
    Date  August 1998
    Refs | Theme tree | Cited by 41 |  CiteSeer   (Authority Citation)

    5) FORMULAS FOR CALCULATING SUPREMAL CONTROLLABLE AND NORMAL SUBLANGUAGES  
    By F. Lin    R. D. Brandt    R. Kumar    S. I. Marcus    V. Garg
    Date  December 1996
    Refs | Theme tree | Cited by 27 |  CiteSeer  

    6) ON THE COMPUTATIONAL POWER OF NEURAL NETS  
    By Eduardo D. Sontag    Hava T. Siegelmann
    Date  November 1993
    Refs | Theme tree | Cited by 94 |  CiteSeer  

    7) ACTIONS SPEAK LOUDER THAN WORDS: PROVING BISIMILARITY FOR CONTEXT-FREE PROCESSES  
    By Colin Stirling    Hans Huttel
    Date  November 1996
    Refs | Theme tree | Cited by 41 |  CiteSeer  

    8) BOUNDS ON THE COMPLEXITY OF RECURRENT NEURAL NETWORK IMPLEMENTATIONS OF FINITE STATE MACHINES  
    By Bill G. Horne    Don R. Hush
    Date  March 1996
    Refs | Theme tree | Cited by 34 |  CiteSeer  

    9) EXTRACTING AND LEARNING AN UNKNOWN GRAMMAR WITH RECURRENT NEURAL NETWORKS  
    By D. Chen    G. Z. Sun    H. H. Chen    Y. C. Lee
    Date  February 1992
    Refs | Theme tree | Cited by 31 |  CiteSeer  

    10) SUPERVISORY CONTROL OF NONDETERMINISTIC SYSTEMS WITH DRIVEN EVENTS VIA PRIORITIZED SYNCHRONIZATION AND TRAJECTORY MODELS  
    By Mark A. Shayman    Ratnesh Kumar
    Date  January 1970
    Refs | Theme tree | Cited by 28 |  CiteSeer  

    11) REGULAR PATH QUERIES WITH CONSTRAINTS  
    By Le Chesnay Cedex    Serge Abiteboul    Victor Vianu
    Date  February 2000
    Refs | Theme tree | Cited by 86 |  CiteSeer  

    12) IMPLEMENTING REGULAR TREE EXPRESSIONS  
    By Alexander Aiken    Brian R. Murphy
    Date  June 1998
    Refs | Theme tree | Cited by 45 |  CiteSeer  

    13) SUPERVISORY CONTROL OF A RAPID THERMAL MULTIPROCESSOR  
    By Silvano Balemi
    Date  March 1997
    Refs | Theme tree | Cited by 40 |  CiteSeer  

    14) FINDING REGULAR SIMPLE PATHS IN GRAPH DATABASES  
    By Alberto O. Mendelzony    Peter T. Woodz
    Date  March 1995
    Refs | Theme tree | Cited by 47 |  CiteSeer   (Authority Citation)

    15) DYNAMICAL RECOGNIZERS: REAL-TIME LANGUAGE RECOGNITION BY ANALOG COMPUTERS  
    By Cristopher Moore    Dynamical Recognizers
    Date  May 1996
    Refs | Theme tree | Cited by 27 |  CiteSeer  

    16) A POLYNOMIAL ALGORITHM FOR DECIDING BISIMILARITY OF NORMED CONTEXT-FREE PROCESSES  
    By Faron Moller    Mark Jerrum    Yoram Hirshfeld
    Date  March 2001
    Refs | Theme tree | Cited by 29 |  CiteSeer  

    17) STRING VARIABLE GRAMMAR: A LOGIC GRAMMAR FORMALISM FOR THE BIOLOGICAL LANGUAGE OF DNA  
    By
    Date  September 1994
    Refs | Theme tree | Cited by 26 |  CiteSeer  

    18) A REALLY TEMPORAL LOGIC  
    By Rajeev Alur    Thomas A. Henzinger
    Date  June 1997
    Refs | Theme tree | Cited by 145 |  CiteSeer  

    19) GAP-DEFINABLE COUNTING CLASSES  
    By Lance J. Fortnow    Stephen A. Fenner    Stephen Fenner    Stuart A. Kurtz
    Date  April 1994
    Refs | Theme tree | Cited by 76 |  CiteSeer  

    20) PREDICATES AND PREDICATE TRANSFORMERS FOR SUPERVISORY CONTROL OF DISCRETE EVENT DYNAMICAL SYSTEMS  
    By Ratnesh Kumar    Steven I. Marcus    Vijay Garg
    Date  July 1998
    Refs | Theme tree | Cited by 16 |  CiteSeer  

    21) INJECTING NONDETERMINISTIC FINITE STATE AUTOMATA INTO RECURRENT NEURAL NETWORKS  
    By Giovanni Soda    Marco Gori    Paolo Frasconi
    Date  August 1992
    Refs | Theme tree | Cited by 10 |  CiteSeer  

    22) RULE REVISION WITH RECURRENT NEURAL NETWORKS  
    By And C. L. Giles    Christian W. Omlin
    Date  March 1996
    Refs | Theme tree | Cited by 19 |  CiteSeer  

    23) A NOTE ON DECIDING THE CONTROLLABILITY OF A LANGUAGE K WITH RESPECT TO A LANGUAGE L  
    By Pierce Hall Gh    Ramavarapu S. Sreenivas
    Date  August 1994
    Refs | Theme tree | Cited by 14 |  CiteSeer  

    24) LANGUAGE STABILITY AND STABILIZABILITY OF DISCRETE EVENT DYNAMICAL SYSTEMS  
    By Ratnesh Kumar    Steven I. Marcus    Vijay Garg
    Date  December 1996
    Refs | Theme tree | Cited by 11 |  CiteSeer  

    25) COMPLEXITY RESULTS FOR TWO-WAY AND MULTI-PEBBLE AUTOMATA AND THEIR LOGICS  
    By And David Harel    Noa Globerman
    Date  February 1997
    Refs | Theme tree | Cited by 17 |  CiteSeer   (Authority Citation)

  • Next 25 articles...