Results 1  10
of
15
Learning a Regular Tree Language From a Teacher
 LNCS 2710, PP. 279291, PROC. DLT '03
, 2003
"... We generalize an inference algorithm by Angluin, that learns a regular string language from a "minimally adequate teacher", to regular tree languages. This improves a similar algorithm proposed by Sakakibara. In particular ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We generalize an inference algorithm by Angluin, that learns a regular string language from a "minimally adequate teacher", to regular tree languages. This improves a similar algorithm proposed by Sakakibara. In particular
TreeBased Generation of Languages of Fractals
 Theoretical Computer Science
, 1999
"... . The notion of Pinterpreted topdown tree generators is introduced, combining the nondeterministic nature of grammars as known from formal language theory with the innite renement of pictures studied in fractal geometry. 1 Introduction This paper introduces an approach to generate languages of ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
(Show Context)
. The notion of Pinterpreted topdown tree generators is introduced, combining the nondeterministic nature of grammars as known from formal language theory with the innite renement of pictures studied in fractal geometry. 1 Introduction This paper introduces an approach to generate languages of fractals, thus combining fractal geometry with one of the main ideas of formal language theory, namely to consider innite sets of objects related by a common grammatical description. The theory of formal languages is normally concerned with the grammatical generation of sets of discrete objects, these sets being called languages. Traditional questions ask for the properties of these languages and their recognition by various sorts of automata. While the objects of interest had initially been words, the ideas were soon taken up by researchers interested in more complex data structures like arrays, trees, and graphs (see the recently published books [RS97] for a representative overview of...
Picking Knots from Trees  The Syntactic Structure of Celtic Knotwork
 Proc. 1st Intl. Conference on Theory and Application of Diagrams 2000, volume 1889 of Lecture Notes in Arti cial Intelligence
, 2000
"... . Interlacing knotwork forms a signicant part of celtic art. From the perspective of computer science, it is a visual language following mathematically precise rules of construction. In this paper, we study the syntactic generation of celtic knots using collage grammars. Several syntactic regulat ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
. Interlacing knotwork forms a signicant part of celtic art. From the perspective of computer science, it is a visual language following mathematically precise rules of construction. In this paper, we study the syntactic generation of celtic knots using collage grammars. Several syntactic regulation mechanisms are employed in order to ensure that only consistent designs are generated. 1 Introduction A typical characteristic of visual languages is that the diagrams in such a language are related by a common structure and layout. In other words, the language is dened by a set of syntactic visual rules yielding the acceptable pictures. Formal picturegenerating methods help to understand the structure of the languages in question, to classify them, and to generate them automatically by means of computer programs. Fig. 1. A celtic knot Artists from many cultures have been using visual rules since ancient times in order to design diagrams of various sorts. Celtic diagrams, and in ...
Towards the Tree Automata Workbench MARBLES
, 2009
"... We sketch the conceptual ideas that are intended to become the basis for the Tree Automata Workbench MARBLES, an extensible system that will facilitate the experimentation with virtually any kind of algorithms on tree automata. Moreover, the system will come with a library and an application program ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We sketch the conceptual ideas that are intended to become the basis for the Tree Automata Workbench MARBLES, an extensible system that will facilitate the experimentation with virtually any kind of algorithms on tree automata. Moreover, the system will come with a library and an application programmer’s interface that can be used by anyone wanting to apply such algorithms in research and development.
Appligraph: Applications of Graph Transformation  Fourth Annual Progress Report
, 2001
"... This report summarizes the activities in the fourth year of the ESPRIT Working Group APPLIGRAPH, covering the period from April 1, 2000, to March 31, 2001. The principal objective of this Working Group is to promote applied graph transformation as a rulebased framework for the specication and devel ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This report summarizes the activities in the fourth year of the ESPRIT Working Group APPLIGRAPH, covering the period from April 1, 2000, to March 31, 2001. The principal objective of this Working Group is to promote applied graph transformation as a rulebased framework for the specication and development of systems, languages, and tools and to improve the awareness of its industrial relevance
Links
, 2007
"... We define the notion of links, thus generalizing the chaincode, turtle geometry, and collage formalisms. As links can be concatenated, link grammars can be defined in a similar way as chaincode grammars. Contextfree link grammars are shown to be strictly more powerful than both contextfree chai ..."
Abstract
 Add to MetaCart
We define the notion of links, thus generalizing the chaincode, turtle geometry, and collage formalisms. As links can be concatenated, link grammars can be defined in a similar way as chaincode grammars. Contextfree link grammars are shown to be strictly more powerful than both contextfree chaincode grammars and contextfree collage grammars. Moreover, we study the generalization obtained by extending the formalism with the brackets known from the turtle geometry.
Branching Grammars: A Generalization of ET0L Systems
, 2003
"... Generalizing ET0L systems, we introduce branching synchronization grammars with nested tables. Branching synchronization grammars with tables of nesting depth n have the same string and treegenerating power as nfold compositions of topdown tree transducers. ..."
Abstract
 Add to MetaCart
Generalizing ET0L systems, we introduce branching synchronization grammars with nested tables. Branching synchronization grammars with tables of nesting depth n have the same string and treegenerating power as nfold compositions of topdown tree transducers.
Branching Synchronization Grammars with Nested Tables
, 2002
"... A generalization of ET0L systems is introduced: grammars with branching synchronization and nested tables. Branching synchronization grammars with tables of nesting depth n have the same string and treegenerating power as nfold compositions of topdown tree transducers. ..."
Abstract
 Add to MetaCart
A generalization of ET0L systems is introduced: grammars with branching synchronization and nested tables. Branching synchronization grammars with tables of nesting depth n have the same string and treegenerating power as nfold compositions of topdown tree transducers.
Collage grammars based on tree grammars
"... The tree grammar based approach for picture generating is introduced ..."