scholarly journals Unary Pushdown Automata and Straight-Line Programs

2014 ◽  
pp. 146-157 ◽  
Author(s):  
Dmitry Chistikov ◽  
Rupak Majumdar
Keyword(s):  
Straight Line ◽  
Pushdown Automata ◽  
Straight Line Programs

scholarly journals The descriptional power of queue automata of constant length

2021 ◽  
Vol 58 (4) ◽  
pp. 335-356
Author(s):  
Sebastian Jakobi ◽  
Katja Meckel ◽  
Carlo Mereghetti ◽  
Beatrice Palano
Keyword(s):  
Blow Up ◽  
Regular Expressions ◽  
Constant Length ◽  
Straight Line ◽  
Constant Height ◽  
Double Exponential ◽  
Finite State ◽  
Pushdown Automata ◽  
Exponential Size ◽  
Straight Line Programs

AbstractWe consider the notion of a constant length queue automaton—i.e., a traditional queue automaton with a built-in constant limit on the length of its queue—as a formalism for representing regular languages. We show that the descriptional power of constant length queue automata greatly outperforms that of traditional finite state automata, of constant height pushdown automata, and of straight line programs for regular expressions, by providing optimal exponential and double-exponential size gaps. Moreover, we prove that constant height pushdown automata can be simulated by constant length queue automata paying only by a linear size increase, and that removing nondeterminism in constant length queue automata requires an optimal exponential size blow-up, against the optimal double-exponential cost for determinizing constant height pushdown automata. Finally, we investigate the size cost of implementing Boolean language operations on deterministic and nondeterministic constant length queue automata.

scholarly journals A NEW LINEAR GENETIC PROGRAMMING APPROACH BASED ON STRAIGHT LINE PROGRAMS: SOME THEORETICAL AND EXPERIMENTAL ASPECTS

2009 ◽  
Vol 18 (05) ◽  
pp. 757-781 ◽  
Author(s):  
CÉSAR L. ALONSO ◽  
JOSÉ LUIS MONTAÑA ◽  
JORGE PUENTE ◽  
CRUZ ENRIQUE BORGES
Keyword(s):  
Data Structure ◽  
Genetic Programming ◽  
Computer Programs ◽  
Symbolic Regression ◽  
Programming Approach ◽  
Linear Genetic Programming ◽  
Straight Line ◽  
Structured Representations ◽  
Regression Problems ◽  
Straight Line Programs

Tree encodings of programs are well known for their representative power and are used very often in Genetic Programming. In this paper we experiment with a new data structure, named straight line program (slp), to represent computer programs. The main features of this structure are described, new recombination operators for GP related to slp's are introduced and a study of the Vapnik-Chervonenkis dimension of families of slp's is done. Experiments have been performed on symbolic regression problems. Results are encouraging and suggest that the GP approach based on slp's consistently outperforms conventional GP based on tree structured representations.

On the average-case complexity of underdetermined functions

2018 ◽  
Vol 28 (4) ◽  
pp. 201-221
Author(s):  
Aleksandr V. Chashkin
Keyword(s):  
Boolean Functions ◽  
Correct Order ◽  
Average Case ◽  
Case Complexity ◽  
Average Case Complexity ◽  
Straight Line ◽  
Straight Line Programs

Abstract The average-case complexity of computation of underdetermined functions by straight-line programs with conditional stop over the basis of all at most two-place Boolean functions is considered. Correct order estimates of the average-case complexity of functions with maximum average-case complexity among all underdetermined functions are derived depending on the degree of their determinacy, the size of their domain, and the size of their support.

scholarly journals Aliased register allocation for straight-line programs is NP-complete

2008 ◽  
Vol 407 (1-3) ◽  
pp. 258-273 ◽  
Author(s):  
Jonathan K. Lee ◽  
Jens Palsberg ◽  
Fernando Magno Quintão Pereira
Keyword(s):  
Register Allocation ◽  
Straight Line ◽  
Np Complete ◽  
Straight Line Programs
Sign in / Sign up

Export Citation Format

Share Document