UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Descendants of a recognizable tree language for sets of linear monadic term rewrite rules

Information processing letters, 2006, Vol.99 (3), p.111-118

Vágvölgyi, Sándor

2006

Volltextzugriff (PDF)

Shuffle Quotient and Decompositions

Developments in Language Theory, 2002, p.186-196

2002

Volltextzugriff (PDF)

Restricted ground tree transducers

Theoretical computer science, 2001-01, Vol.250 (1), p.219-233

2001

Volltextzugriff (PDF)

A property of left-linear rewrite systems preserving recognizability

Theoretical computer science, 2000-07, Vol.242 (1), p.477-498

2000

Volltextzugriff (PDF)

Relationships between sunflower variety, sowing date and the extent of damage caused by the European sunflower moth (Homoeosoma nebulellum Den. et Schiff.)

Helia (Novi Sad), 2010, Vol.33 (52), p.37-45

2010

Volltextzugriff (PDF)

SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES

International journal of foundations of computer science, 2002-12, Vol.13 (6), p.799-816

2002

Volltextzugriff (PDF)

On one-pass term rewriting

Lecture notes in computer science, 1998, p.248-256

1998

Volltextzugriff (PDF)

Deterministic bottom-up tree transducers and ground term rewrite systems

Theoretical computer science, 2009-05, Vol.410 (21), p.2250-2278

Vagvolgyi, S

2009

Volltextzugriff (PDF)

Congruential complements of ground term rewrite systems

Theoretical computer science, 2000-05, Vol.238 (1), p.247-274

Vágvölgyi, Sándor

2000

Volltextzugriff (PDF)

A hierarchy of deterministic top-down tree transformations

Mathematical Systems Theory, 1996-04, Vol.29 (2), p.169-188

1996

Volltextzugriff (PDF)

Term rewriting restricted to ground terms

Theoretical computer science, 2003-06, Vol.302 (1), p.135-165

Vágvölgyi, Sándor

2003

Volltextzugriff (PDF)

Right-linear half-monadic term rewrite systems

Theoretical computer science, 2003-12, Vol.309 (1), p.195-211

Vágvölgyi, Sándor

2003

Volltextzugriff (PDF)

Intersection of finitely generated congruences over term algebra

Theoretical computer science, 2003-05, Vol.300 (1), p.209-234

Vágvölgyi, Sándor

2003

Volltextzugriff (PDF)

Bottom-up tree pushdown automata and rewrite systems

Rewriting Techniques and Applications, 2005, p.287-298

2005

Volltextzugriff (PDF)

Linear generalized semi-monadic rewrite systems effectively preserve recognizability

Theoretical computer science, 1998-03, Vol.194 (1), p.87-122

1998

Volltextzugriff (PDF)

Storage-to-tree transducers with look-ahead

Theoretical computer science, 2004-12, Vol.329 (1-3), p.115-158

2004

Volltextzugriff (PDF)

A fast algorithm for constructing a tree automaton recognizing a congruential tree language

Theoretical computer science, 1993-07, Vol.115 (2), p.391-399

Vágvölgyi, Sándor

1993

Volltextzugriff (PDF)

P376Ophiobolins redistribute Kv4.x ion channels and connexin26 in cardiac muscle

Cardiovascular research, 2014-07, Vol.103 (suppl 1), p.S69-S69

2014

Volltextzugriff (PDF)

P685Reorganization of Kir2.x ion channel complex under stress effects on cardiomyocytes and neuronal cells

Cardiovascular research, 2014-07, Vol.103 (suppl 1), p.S125-S125

2014

Volltextzugriff (PDF)

Attributed Tree Transducers Cannot Induce All Deterministic Bottom-up Tree Transformations

Information and computation, 1995-02, Vol.116 (2), p.231-240

1995

Volltextzugriff (PDF)

Bottom-up tree pushdown automata: classification and connection with rewrite systems

Theoretical computer science, 1994-01, Vol.127 (1), p.69-98

1994

Volltextzugriff (PDF)

A complete classification of deterministic root-to-frontier tree transformation classes

Theoretical computer science, 1991-04, Vol.81 (1), p.1-15

1991

Volltextzugriff (PDF)

Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations

Theoretical computer science, 1996-03, Vol.156 (1), p.71-97

1996

Volltextzugriff (PDF)

Minimal equational representations of recognizable tree languages

Acta informatica, 1997-01, Vol.34 (1), p.59-84

1997

Volltextzugriff (PDF)

Deterministic top-down tree transducers with iterated look-ahead

Theoretical computer science, 1995-06, Vol.143 (2), p.285-308

1995

Volltextzugriff (PDF)

1 – 25 von 765

Menü

Weitere Dienste

Einstellungen

Descendants of a recognizable tree language for sets of linear monadic term rewrite rules

Shuffle Quotient and Decompositions

Restricted ground tree transducers

A property of left-linear rewrite systems preserving recognizability

Relationships between sunflower variety, sowing date and the extent of damage caused by the European sunflower moth (Homoeosoma nebulellum Den. et Schiff.)

SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES

On one-pass term rewriting

Deterministic bottom-up tree transducers and ground term rewrite systems

Congruential complements of ground term rewrite systems

A hierarchy of deterministic top-down tree transformations

Term rewriting restricted to ground terms

Right-linear half-monadic term rewrite systems

Intersection of finitely generated congruences over term algebra

Bottom-up tree pushdown automata and rewrite systems

Linear generalized semi-monadic rewrite systems effectively preserve recognizability

Storage-to-tree transducers with look-ahead

A fast algorithm for constructing a tree automaton recognizing a congruential tree language

P376Ophiobolins redistribute Kv4.x ion channels and connexin26 in cardiac muscle

P685Reorganization of Kir2.x ion channel complex under stress effects on cardiomyocytes and neuronal cells

Attributed Tree Transducers Cannot Induce All Deterministic Bottom-up Tree Transformations

Bottom-up tree pushdown automata: classification and connection with rewrite systems

A complete classification of deterministic root-to-frontier tree transformation classes

Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations

Minimal equational representations of recognizable tree languages

Deterministic top-down tree transducers with iterated look-ahead

Suchergebnisse filtern