Breadth-first phrase structure grammars and queue automata

Allevi, Elisabetta; Cherubini, Alessandra; Crespi-Reghizzi, Stefano

doi:10.1007/bfb0017139

Cited by 8 publications

(39 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Case (1). We create for G 0 the new non-terminal hXY i (1) and we replace the production A ! ( ) 1 by A !…”

Section: Is the I?th Component Of A Production Of Ggmentioning

confidence: 99%

“…Catenation. Let L 1 = L(G 1 ) and L 2 = L(G 2 ), where V (1) N \ V (2) N = ;. Construct G = (V N ; V T ; P; S) as follows.…”

Section: Statement22mentioning

confidence: 99%

“…of symbols. The alphabet of the generalized Dyck language consists of nitely many (n + 1)-tuples of symbols aa (1) . .…”

Section: Statement22mentioning

confidence: 99%

“…As an example we give the D 2 grammar G = (V N ;~ ; P; S) generating the generalized Dyck language D(fa; bg; 2): V N = fS; A (1) ; A (2) ; B (1) ; B (2) g~ = fa; a (1) ; a (2) ; b; b (1) ; b (2)…”

Section: De Nition31 the Generalized Dyck Language Over An Alphabet mentioning

confidence: 99%

“…Here follows an example of a derivation in G. S ) a(SA (1) ) 1 (A (2) ) 2 ) ab(SB (1) A (1) ) 1 (B (2) A (2) ) 2 ) ab(B (1) A (1) ) 1 (B (2) A (2) ) 2 ) abb (1) (SA (1) ) 1 (B (2) A (2) ) 2 ) abb (1) a(SA (1) A (1) ) 1 (A (2) B (2) A (2) ) 2 ) abb (1) a(A (1) A (1) ) 1 (A (2) B (2) A (2) ) 2 ) abb (1) aa (1) (SA (1) ) 1 (A (2) B (2) A (2) ) 2 ) abb (1) aa (1) (1) aa (1) a (1) (1) aa (1) a (1) (1) aa (1) a (1) a (2) a(SA (1) (1) aa (1) a (1) a (2) a(A (1) ) 1 (A (2) B (2) A (2) ) 2 ) . .…”

Section: De Nition31 the Generalized Dyck Language Over An Alphabet unclassified

See 4 more Smart Citations

Multi-Push-Down Languages and Grammars

Breveglieri

Cherubini

Citrini

et al. 1996

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

A new class of languages, called multi-push-down (mpd), that generalize the classical context-free (cf, or Chomsky type 2) ones is introduced. These languages preserve some important properties of cf languages: a generalization of the Chomsky-Schützenberger homomorphic characterization theorem, the Parikh theorem and a “pumping lemma” are proved. Multi-push-down languages are an AFL. Their recognizers are automata equipped with a multi-push-down tape. Multi-push-down languages form a hierarchy based on the number of push-down tapes.

show abstract

“…Case (1). We create for G 0 the new non-terminal hXY i (1) and we replace the production A ! ( ) 1 by A !…”

Section: Is the I?th Component Of A Production Of Ggmentioning

confidence: 99%

“…Catenation. Let L 1 = L(G 1 ) and L 2 = L(G 2 ), where V (1) N \ V (2) N = ;. Construct G = (V N ; V T ; P; S) as follows.…”

Section: Statement22mentioning

confidence: 99%

“…of symbols. The alphabet of the generalized Dyck language consists of nitely many (n + 1)-tuples of symbols aa (1) . .…”

Section: Statement22mentioning

confidence: 99%

Section: De Nition31 the Generalized Dyck Language Over An Alphabet mentioning

confidence: 99%

Section: De Nition31 the Generalized Dyck Language Over An Alphabet unclassified

See 3 more Smart Citations

Multi-Push-Down Languages and Grammars

Breveglieri

Cherubini

Citrini

et al. 1996

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

show abstract

Queue Automata of Constant Length

Jakobi¹,

Meckel²,

Mereghetti

et al. 2013

Descriptional Complexity of Formal Systems

View full text Add to dashboard Cite

The descriptional power of queue automata of constant length

Jakobi¹,

Meckel²,

Mereghetti

et al. 2021

Acta Informatica

View full text Add to dashboard Cite

We 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.

show abstract

Breadth-first phrase structure grammars and queue automata

Cited by 8 publications

References 3 publications

Multi-Push-Down Languages and Grammars

Multi-Push-Down Languages and Grammars

Queue Automata of Constant Length

The descriptional power of queue automata of constant length

Contact Info

Product

Resources

About