Add to ORKGSIGLEAvailable from TIB Hannover: RO 9119(2001,7) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
Given a number of tape symbols, we define the state complexity of a partial-recursive function f as ...
AbstractWe investigate the state complexity of some operations on binary regular languages. In parti...
In this paper we give the cost, in terms of states, of some basic operations (union, intersection, c...
SIGLEAvailable from TIB Hannover: RO 9119(2001,3) / FIZ - Fachinformationszzentrum Karlsruhe / TIB -...
We investigate the nondeterministic state complexity of basic operations for suffix-free regular lan...
Abstract. The state complexity of a regular language is the number of states of its minimal determin...
AbstractWe study the state complexity of combined operations on regular languages. Each of the combi...
We investigate the nondeterministic state complexity of basic operations for prefix-free regular lan...
We compare the nondeterministic state complexity of unary regular languages and that of their comple...
AbstractWe compare the nondeterministic state complexity of unary regular languages and that of thei...
SIGLEAvailable from TIB Hannover: RO 9119(2001,4) / FIZ - Fachinformationszzentrum Karlsruhe / TIB -...
Copy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Karlsruh...
AbstractThe number of transitions required by a nondeterministic finite automaton (NFA) to accept a ...
AbstractWe investigate the state complexity of basic operations for suffix-free regular languages. T...
Considering the uniform distribution on sets of m non-empty words whose sum of lengths is n, we est...
Given a number of tape symbols, we define the state complexity of a partial-recursive function f as ...
AbstractWe investigate the state complexity of some operations on binary regular languages. In parti...
In this paper we give the cost, in terms of states, of some basic operations (union, intersection, c...
SIGLEAvailable from TIB Hannover: RO 9119(2001,3) / FIZ - Fachinformationszzentrum Karlsruhe / TIB -...
We investigate the nondeterministic state complexity of basic operations for suffix-free regular lan...
Abstract. The state complexity of a regular language is the number of states of its minimal determin...
AbstractWe study the state complexity of combined operations on regular languages. Each of the combi...
We investigate the nondeterministic state complexity of basic operations for prefix-free regular lan...
We compare the nondeterministic state complexity of unary regular languages and that of their comple...
AbstractWe compare the nondeterministic state complexity of unary regular languages and that of thei...
SIGLEAvailable from TIB Hannover: RO 9119(2001,4) / FIZ - Fachinformationszzentrum Karlsruhe / TIB -...
Copy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Karlsruh...
AbstractThe number of transitions required by a nondeterministic finite automaton (NFA) to accept a ...
AbstractWe investigate the state complexity of basic operations for suffix-free regular languages. T...
Considering the uniform distribution on sets of m non-empty words whose sum of lengths is n, we est...
Given a number of tape symbols, we define the state complexity of a partial-recursive function f as ...
AbstractWe investigate the state complexity of some operations on binary regular languages. In parti...
In this paper we give the cost, in terms of states, of some basic operations (union, intersection, c...