Skip to search formSkip to main contentSkip to account menu

Descriptive complexity theory

Known as: Descriptional complexity, Descriptive complexity 
Descriptive complexity is a branch of computational complexity theory and of finite model theory that characterizes complexity classes by the type of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

24 relations
AC0Abstract machineComplexity classComputational complexity theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Reversible Ordered Restarting Automata
Stateless deterministic ordered restarting automata characterize the class of regular languages. Here we introduce a notion of… 
2009
2009
Concatenation of Regular Languages and Descriptional Complexity
We investigate the deterministic and nondeterministic state complexity of languages resulting from the concatenation of two… 
2007
2007
Accepting Networks of Evolutionary Processors with Filtered Connections
In this paper we simplify a recent model of computation considered in (Margenstern et al. 2005), namely accepting network of… 
2004
2004
Two-Way Metalinear PC Grammar Systems and Their Descriptional Complexity
Besides a derivation step and a communication step, a two-way PC grammar system can make a reduction step during which it reduces… 
2000
2000
Biogeochemical Models in the Environmental Sciences The Dynamical System Paradigm and the Role of Simulation Modeling
Dynamical systems are the paradigm for the representation of complex systems. The fixed encoding in a closed set of equations… 
1998
1998
Over Words, Two Variables Are as Powerful as One Quantiier Alternation: Fo 2 = 2 \ 2
We show a property of strings is expressible in the two-variable fragment of rst-order logic if and only if it is expressible by… 
1997
1997
Adjunction As Substitution: An Algebraic Formulation of Regular Context-Free and Tree Adjoining Languages
This note presents a method of interpreting the tree adjoining languages as the natural third step in a hierarchy that starts… 
1997
1997
"Grammarless" Phrase Structure Grammar
We sketch an axiomatic reformalization of Generalized Phrase StructureGrammar (GPSG) – a definition purely within the language… 
1990
1990
Stabbing and ray shooting in 3 dimensional space
In this paper we consider the following problems: given a set <italic>T</italic> of triangles in 3-space, with |<italic>T</italic… 
1989
1989
Design for Verifiability
  • G. Milne
  • Hardware Specification, Verification and…
  • 1989
  • Corpus ID: 28230140
The concept of Design for Verifiability is introduced as a means of attacking the complexity problem encountered when verifying… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)