The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata

2011 ◽  
pp. 80-92 ◽  
Author(s):  
Zuzana Bednárová ◽  
Viliam Geffert ◽  
Carlo Mereghetti ◽  
Beatrice Palano
Keyword(s):  
Boolean Operations ◽  
Constant Height ◽  
Pushdown Automata

scholarly journals The size-cost of Boolean operations on constant height deterministic pushdown automata

2012 ◽  
Vol 449 ◽  
pp. 23-36 ◽  
Author(s):  
Zuzana Bednárová ◽  
Viliam Geffert ◽  
Carlo Mereghetti ◽  
Beatrice Palano
Keyword(s):  
Boolean Operations ◽  
Constant Height ◽  
Pushdown Automata

Removing Nondeterminism in Constant Height Pushdown Automata

2012 ◽  
pp. 76-88 ◽  
Author(s):  
Zuzana Bednárová ◽  
Viliam Geffert ◽  
Carlo Mereghetti ◽  
Beatrice Palano
Keyword(s):  
Constant Height ◽  
Pushdown Automata

Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata

2020 ◽  
pp. 1-25
Author(s):  
Bruno Guillon ◽  
Giovanni Pighizzini ◽  
Luca Prigioniero
Keyword(s):  
Finite Automata ◽  
Regular Languages ◽  
Deterministic Finite Automata ◽  
Polynomial Size ◽  
Constant Height ◽  
Double Exponential ◽  
Recursive Structures ◽  
Deterministic Formula ◽  
Context Free ◽  
Pushdown Automata

Non-self-embedding grammars are a restriction of context-free grammars which does not allow to describe recursive structures and, hence, which characterizes only the class of regular languages. A double exponential gap in size from non-self-embedding grammars to deterministic finite automata is known. The same size gap is also known from constant-height pushdown automata and [Formula: see text]-limited automata to deterministic finite automata. Constant-height pushdown automata and [Formula: see text]-limited automata are compared with non-self-embedding grammars. It is proved that non-self-embedding grammars and constant-height pushdown automata are polynomially related in size. Furthermore, a polynomial size simulation by [Formula: see text]-limited automata is presented. However, the converse transformation is proved to cost exponential. Finally, a different simulation shows that also the conversion of deterministic constant-height pushdown automata into deterministic [Formula: see text]-limited automata costs polynomial.

scholarly journals Removing nondeterminism in constant height pushdown automata

2014 ◽  
Vol 237 ◽  
pp. 257-267 ◽  
Author(s):  
Zuzana Bednárová ◽  
Viliam Geffert ◽  
Carlo Mereghetti ◽  
Beatrice Palano
Keyword(s):  
Constant Height ◽  
Pushdown Automata

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.

FUZZY CONJUNCTIVE GRAMMAR AND FUZZY SYNCHRONIZED ALTERNATING PUSHDOWN AUTOMATA

2020 ◽  
Vol 9 (11) ◽  
pp. 9463-9480
Author(s):  
R. Pathrakumar ◽  
M. Rajasekar
Keyword(s):  
Pushdown Automata ◽  
Conjunctive Grammar

scholarly journals Evaluation of the Ability to Accurately Produce Angular Details by 3D Printing of Plastic Parts

Machines ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 150
Author(s):  
Andrei Marius Mihalache ◽  
Gheorghe Nagîț ◽  
Laurențiu Slătineanu ◽  
Adelina Hrițuc ◽  
Angelos Markopoulos ◽  
...  
Keyword(s):  
3D Printing ◽  
Point Of View ◽  
Vertex Angle ◽  
Function Type ◽  
Constant Height ◽  
3D Printers ◽  
3D Printed ◽  
Mathematical Processing ◽  
Plastic Parts

3D printing is a process that has become widely used in recent years, allowing the production of parts with relatively complicated shapes from metallic and non-metallic materials. In some cases, it is challenging to evaluate the ability of 3D printers to make fine details of parts. For such an assessment, the printing of samples showing intersections of surfaces with low angle values was considered. An experimental plan was designed and materialized to highlight the influence of different factors, such as the thickness of the deposited material layer, the printing speed, the cooling and filling conditions of the 3D-printed part, and the thickness of the sample. Samples using areas in the form of isosceles triangles with constant height or bases with the same length, respectively, were used. The mathematical processing of the experimental results allowed the determination of empirical mathematical models of the power-function type. It allowed the detection of both the direction of actions and the intensity of the influence exerted by the input factors. It is concluded that the strongest influence on the printer’s ability to produce fine detail, from the point of view addressed in the paper, is exerted by the vertex angle, whose reduction leads to a decrease in printing accuracy.

Sign in / Sign up

Export Citation Format

Share Document