Symmetries and the complexity of pure Nash equilibrium
Nondeterministic Descriptional Complexity Of Regular Languages
- M. Holzer, Martin Kutrib
- Computer ScienceInternational Journal of Foundations of Computer…
- 1 December 2003
Bounds are shown for Boolean operations, catenation operations – concatenation, iteration, λ-free iteration – and the reversal on finite and infinite regular languages over unary and arbitrary alphabets.
On deterministic finite automata and syntactic monoid size
Automata That Take Advice
Based on this, complete separations of the classes of the Chomsky hierarchy relative to advices are obtained.
On Emptiness and Counting for Alternating Finite Automata
- M. Holzer
- Materials ScienceInternational Conference on Developments in…
This invention relates to an improvement in a transverse, force-connected body with variable profiling, particularly an airplane wing, containing flexible upper, lower, and nose skin parts and…
Descriptional Complexity - An Introductory Survey
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
It is shown that the maximal attainable lower bound for each of the above mentioned techniques can be algorithmically deduced from a canonical finite graph, the so called dependency graph of a regular language.
Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity
This paper discusses recent developments relevant to NFAs related problems like, for example, simulation of and by several types of finite automata, minimization and approximation, size estimation of minimal NFAs, and state complexity of language operations.
On the average state and transition complexity of finite languages
Finite Automata, Digraph Connectivity, and Regular Expression Size
- Hermann Gruber, M. Holzer
- Computer ScienceInternational Colloquium on Automata, Languages…
- 7 July 2008
This work develops a different, more versatile lower bound technique that is based on the star height of regular languages, which is tied to cycle rank, a structural complexity measure for digraphs proposed by Eggan and Buchi, which measures the degree of connectivity of directed graphs.