On Weak Growing Context-Sensitive Grammars

We introduce the weak growing context-sensitive grammars (WGCSG): grammars that are growing with respect to a valuation of the positions inside a rule as well as the symbols. We evaluate a string by summing up every product of a symbol value with its position value. For every position valuation which does not agree with the beginning of any exponential function, the corresponding class of WGCSGs characterizes CSL. Such a valuation function is called unsteady. On the other hand all WGCSG related to steady position valuations are linearly inclusion-ordered and characterize the hierarchy of exponential time bounded languages in CSL. This hierarchy collapses iff. any class defined by an unsteady position valuation has a normal form of order 2 (e. g. Cremers' or Kuroda's normal form) any class defined by a steady position valuation is closed under inverse homomorphisms.

[1]  Krzysztof Lorys,et al.  The Variable Membership Problem: Succinctness Versus Complexity , 1994, STACS.

[2]  Sajal K. Das,et al.  Folded Petersen cube networks: new competitors for the hypercubes , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

[3]  Ulrich Hertrampf.  Complexity classes defined via k-valued functions , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[4]  Klaus W. Wagner,et al.  Bounded Query Classes , 1990, SIAM J. Comput..

[5]  S.-Y. Kuroda,et al.  Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..

[6]  Manfred Mittler,et al.  Moment Approximation in Product Form Queueing Networks , 1995 .

[7]  F Hh,et al.  Output Process Analysis of the Peak Cell Rate Monitor Algorithm , 1994 .

[8]  Heribert Vollmer.  On Different Reducibility Notions for Function Classes , 1994, STACS.

[9]  Knut Verbarg,et al.  Approximate Center Points in Dense Point Sets , 1997, Inf. Process. Lett..

[10]  N Gerlich,et al.  Reducing the Variance of Sojourn times in Queueing Networks with Overtaking , 1993 .

[11]  Ulrich Hertrampf,et al.  Relations Among Mod-Classes , 1990, Theor. Comput. Sci..

[12]  Krzysztof Lorys,et al.  On Growing Context-Sensitive Languages , 1992, ICALP.

[13]  M. R. Fratery,et al.  Cell Loss Analysis of Broadband Switching Systems Carrying Vbr Video Traac , 1995 .

[14]  M. R. Fraterz,et al.  Delivery of Mpeg Video Services over Atm , 1994 .

[15]  Christoph Meinel,et al.  Structure and Importance of Logspace-MOD-Classes , 1991, STACS.

[16]  Hermann Gold,et al.  Performance Analysis of a Batch Service System , 1994 .

[17]  Conny Friedewald,et al.  WUMPS, Würzburger Message Passing System , 1990, Transputer-Anwender-Treffen.

[18]  Miroslaw Kowaluk,et al.  Vector Language: Simple Description of Hard Instances (Extended Abstract) , 1990, MFCS.

[19]  M. Ritter.  Analysis of the Generic Cell Rate Algorithm Monitoring ON/OFF-Traffic , 1994 .

[20]  Phuoc Tran-Gia,et al.  Structure and Performance of Neural Nets in Broadband System Admission Control , 1994 .

[21]  Kurt Tutschku,et al.  Recurrent Multilayer Perceptrons for Identification and Control: The Road to Applications , 1995 .

[22]  F. H. Ubner.  Analysis of a nite capacity asynchronous multiplexer with periodic sources , 1990 .

[23]  F. H. Ubner,et al.  Autocorrelation and Power Density Spectrum of Atm Multiplexer Output Processes , 1992 .

[24]  Alexander K. Schömig,et al.  A Note on the Application of Marie’s Method for Queueing Networks with Batch Servers , 1996 .

[25]  A. Turing,et al.  On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction , 1938 .

[26]  Manfred Mittler,et al.  Reducing The Variance Of Cycle Times In Semiconductor Manufacturing Systems , 1995 .

[27]  Gerhard Buntrock,et al.  Weakly Growing Context-Sensitive Grammars , 1996, Chic. J. Theor. Comput. Sci..

[28]  Sajal K. Das,et al.  Incomplete Hypercubes: embeddings of Tree-Related Networks , 1995, J. Parallel Distributed Comput..

[29]  Oliver Rose.  Approximate Analysis of an ATM Multiplexer with MPEG Video Input , 1994 .

[30]  Tanja Dabs,et al.  A Graphical User Interface For Genetic Algorithms , 1995 .

[31]  Manfred K. Warmuth,et al.  Membership for Growing Context-Sensitive Grammars is Polynomial , 1986, J. Comput. Syst. Sci..

[32]  Matthias Kahnt,et al.  Universitt at W Urzburg Institut F Ur Informatik Research Report Series Performance Modelling of Pull Manufacturing Systems with Batch Servers and Assembly{like Structure , 1995 .

[33]  P. Tran-Gia,et al.  A discrete time analysis of the DQDB access protocol with general input traffic , 1990, SBT/IEEE International Symposium on Telecommunications.

[34]  Manfred Mittler,et al.  Autocorrelation of cycle times in semiconductor manufacturing systems , 1995, WSC '95.

[35]  K. Wagner,et al.  On the Power of Bio-Computers , 1995 .

[36]  Nicholas Pippenger,et al.  On simultaneous resource bounds , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[37]  Frank Puppe,et al.  COKE: efficient solving of complex assignment problems with the propose-and-exchange method , 1992, Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92.

[38]  O. Rose Und M. Ritter,et al.  A New Approach for the Dimensioning of Policing Functions for MPEG-Video Sources in ATM-Systems , 1995 .

[39]  Phuoc Tran-Gia,et al.  Performance of a neural net scheduler used in packet switching interconnection networks , 1993, IEEE International Conference on Neural Networks.

[40]  Lane A. Hemaspaandra,et al.  Using Inductive Counting to Simulate Nondeterministic Computation , 1990, MFCS.

[41]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[42]  Jack H. Lutz,et al.  On Complexity Classes and Algorithmically Random Languages (Extended Abstract) , 1992, STACS.

[43]  Eric Allender,et al.  A note on the power of threshold circuits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[44]  Reiner Kolla,et al.  Optimal technology mapping for single output cells , 1995, Proceedings. Fifth Great Lakes Symposium on VLSI.

[45]  M. Mittler.  Sojourn Time Distribution of the Asymmetric M/M/1//N-System with LCFS-PR Service , 1994 .

[46]  Phuoc Tran-Gia,et al.  Approximate Performance Analysis of the DQDB Acess Protocol , 1990, Comput. Networks ISDN Syst..

[47]  Sajal K. Das,et al.  Mapping Dynamic Data and Algorithm Structures into Product Networks , 1993, ISAAC.

[48]  M. Ritter,et al.  Blocking in Multi-service Broadband Systems with Cbr and Vbr Input Traac , 1992 .

[49]  Ronald V. Book.  On Random Oracle Separations , 1991, Inf. Process. Lett..

[50]  U Rothaugy,et al.  Artiicial Neural Networks Used for Way Optimization in Multi-head Systems in Application to Electrical Flying Probe Testers , 1994 .

[51]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[52]  Ulrich Hertrampf.  Locally Definable Acceptance Types - The Three-Valued Case , 1992, LATIN.

[53]  Heribert Vollmer,et al.  Recursion Theoretic Characterizations of Complexity Classes of Counting Functions , 1996, Theor. Comput. Sci..

[54]  Noam Chomsky,et al.  On Certain Formal Properties of Grammars , 1959, Inf. Control..

[55]  Heribert Vollmer,et al.  On the power of number-theoretic operations with respect to counting , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[56]  Ivan Hal Sudborough,et al.  On the Tape Complexity of Deterministic Context-Free Languages , 1978, JACM.

[57]  Phuoc Tran-Gia.  Analysis of polling systems with general input process and finite capacity , 1992, IEEE Trans. Commun..

[58]  Heribert Vollmer,et al.  Classes of Counting Functions and Complexity Theoretic Operators , 1996 .

[59]  Phuoc Tran-Gia,et al.  Performance analysis of a batch service queue arising out of manufacturing system modelling , 1993, Queueing Syst. Theory Appl..

[60]  O. Rose.  Simple and Eecient Models for Variable Bit Rate Mpeg Video Traac , 1995 .

[61]  Friedrich Otto,et al.  Growing Context-Sensitive Languages and Church-Rosser Languages , 1995, STACS.

[62]  O. Rosey,et al.  A Comparison of Models for Vbr Video Traac Sources in B-isdn , 1993 .

[63]  Phuoc Tran-Gia,et al.  Discrete-time analysis of cell spacing in ATM systems , 1994, Telecommun. Syst..

[64]  M. Ritter.  Steady State Analysis of the Rate Based Congestion Control Mechanism for ABR Services in ATM Networks , 1995 .

[65]  Michael Tangemann,et al.  Towards a Channel Allocation Scheme for SDMA-based Mobile Communication Systems , 1995 .

[66]  R. Dittmann,et al.  Discrete-time Analysis of a Cyclic Service System with Gated Limited Service , 1993 .

[67]  F Hh,et al.  Discrete-time Analysis of the Output Process of an Atm Multiplexer with Periodic Input , 1991 .

[68]  Eric Allender,et al.  On the Power of Uniform Families of Constant Depth Treshold Circuits , 1990, MFCS.

[69]  A. Schh,et al.  A Petri Net Approach for the Performance Analysis of Business Processes , 1995 .

[70]  F Hh,et al.  Queueing Analysis of Resource Dispatching and Scheduling in Multi-media Systems , 1991 .

[71]  Ulrich Hertrampf.  Locally Definable Acceptance Types for Polynomial Time Machines , 1992, STACS.

[72]  T. Fritsch,et al.  Communication network routing using neural nets-numerical aspects and alternative approaches , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.

[73]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[74]  Hermann Gold,et al.  Multi Server Batch Service Systems in Push and Pull Operating Mode - a Performance Comparison , 1991 .

[75]  F. H. Ubner,et al.  Performance Analysis of Source Policing Architectures in ATM Systems , 1994 .

[76]  Phuoc Tran-Gia,et al.  An Analysis of Multi-Service Systems with Trunk Reservation Mechanisms , 1992 .

[77]  Phuoc Tran-Gia,et al.  Basic Concepts and Performance of High-Speed Protocols , 1993, Integrated Broadband Communications.

[78]  Phuoc Tran-Gia,et al.  Performance analysis of the CRMA-protocol in high-speed networks , 1991, Performance of Distributed Systems and Integrated Communication Networks.

[79]  Phuoc Tran-Gia,et al.  A layered description of ATM cell traffic streams and correlation analysis , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[80]  Celia Wrathall.  Confluence of One-Rule Thue Systems , 1990, IWWERT.

[81]  Seymour Ginsburg,et al.  Studies In Abstract Families Of Languages , 1969 .

[82]  Walter L. Ruzzo,et al.  Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

[83]  F H Ubner.  Dimensioning of a Peak Cell Rate Monitor Algorithm Using Discrete-time Analysis , 1993 .

[84]  Michael Ritter.  Performance analysis of the dual cell spacer in ATM systems , 1995, HPN.

[85]  Oliver Rose,et al.  Statistical properties of MPEG video traffic and their impact on traffic modeling in ATM systems , 1995, Proceedings of 20th Conference on Local Computer Networks.