Leftmost derivations of propagating scattered context grammars: a new proof

Leftmost derivations of propagating scattered context grammars: a new proof

Automata, Logic and Semantics

Bibliographic Details
Main Authors:	Tomáš Masopust, Jiří Techet
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2008-01-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/446/pdf

Similar Items

A chip-firing variation and a new proof of Cayley's formula
by: Peter Mark Kayll, et al.
Published: (2013-03-01)

Random Horn formulas and propagation connectivity for directed hypergraphs
by: Robert H. Sloan, et al.
Published: (2012-08-01)

Gray codes avoiding matchings
by: Darko Dimitrov, et al.
Published: (2009-01-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-01-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-03-01)

On the k-restricted structure ratio in planar and outerplanar graphs
by: Gruia Călinescu, et al.
Published: (2008-01-01)

On quadratic residue codes and hyperelliptic curves
by: David Joyner
Published: (2008-01-01)

On the size of induced acyclic subgraphs in random digraphs
by: Joel Spencer, et al.
Published: (2008-01-01)

Analysis of some parameters for random nodes in priority trees
by: Alois Panholzer
Published: (2008-01-01)

Simultaneous generation for zeta values by the Markov-WZ method
by: Khodabakhsh Hessami Pilehrood, et al.
Published: (2008-01-01)

Counting descents, rises, and levels, with prescribed first element, in words
by: Sergey Kitaev, et al.
Published: (2008-01-01)

On symmetric structures of order two
by: Michel Bousquet, et al.
Published: (2008-01-01)

Total domination in K₅- and K₆-covered graphs
by: Odile Favaron, et al.
Published: (2008-01-01)

Progress on the traceability conjecture for oriented graphs
by: Marietjie Frick, et al.
Published: (2008-01-01)

Multidimensional cellular automata and generalization of Fekete's lemma
by: Silvio Capobianco
Published: (2008-01-01)

Spanning forests on the Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2008-01-01)

On Compact Encoding of Pagenumber $k$ Graphs
by: Cyril Gavoille, et al.
Published: (2008-01-01)

Extremal K_(s,t)-free bipartite graphs
by: Camino Balbuena, et al.
Published: (2008-01-01)

An optimal permutation routing algorithm on full-duplex hexagonal networks
by: Ignasi Sau, et al.
Published: (2008-01-01)

Shifts with decidable language and non-computable entropy
by: Peter Hertling, et al.
Published: (2008-01-01)

Interaction properties of relational periods
by: Vesa Halava, et al.
Published: (2008-01-01)

On-line Ramsey numbers for paths and stars
by: J. A. Grytczuk, et al.
Published: (2008-01-01)

Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach
by: Gregory Nuel
Published: (2008-01-01)

A note on compact and compact circular edge-colorings of graphs
by: Dariusz Dereniowski, et al.
Published: (2008-01-01)

Recurrence among trees with most numerous efficient dominating sets
by: Dorota Bród, et al.
Published: (2008-01-01)

Bounded-degree graphs have arbitrarily large queue-number
by: David R. Wood
Published: (2008-01-01)

Sufficient conditions for labelled 0-1 laws
by: Stanley N. Burris, et al.
Published: (2008-01-01)

A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
by: David Callan
Published: (2008-01-01)

On hereditary Helly classes of graphs
by: Marina Groshaus, et al.
Published: (2008-01-01)

The Laplacian spread of a tree
by: Yi-Zheng Fan, et al.
Published: (2008-01-01)

The location of the first maximum in the first sojourn of a Dyck path
by: Helmut Prodinger
Published: (2008-01-01)

Ore and Erdős type conditions for long cycles in balanced bipartite graphs
by: Janusz Adamus, et al.
Published: (2009-01-01)

A construction of small regular bipartite graphs of girth 8
by: Camino Balbuena
Published: (2009-01-01)

Computation of L_⊕ for several cubic Pisot numbers
by: Julien Bernat
Published: (2007-01-01)

Structure of spanning trees on the two-dimensional Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2011-01-01)

Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
by: Gábor Bacsó, et al.
Published: (2009-01-01)

On the complexity of the balanced vertex ordering problem
by: Jan Kára, et al.
Published: (2007-01-01)

Regular languages and associative language descriptions
by: Marcella Anselmo, et al.
Published: (2007-01-01)

Generating involutions, derangements, and relatives by ECO
by: Vincent Vajnovszki
Published: (2010-01-01)

Tribes of cubic partial cubes
by: Sandi Klavžar, et al.
Published: (2007-01-01)