نتایج جستجو برای: state alternating regular tree grammar

تعداد نتایج: 1173205  

2010
Jacques Chabin Mirian Halfeld Ferrari Alves Martin A. Musicante Pierre Réty

In this paper, we propose algorithms that extend a given regular tree grammar G0 to a new grammar G respecting the following two properties: (i) G belongs to the sub-class of local or single-type tree grammars and (ii) G is the least grammar (in the sense of language inclusion) that contains the language of G0. Our algorithms give rise to important tools in the context of web service compositio...

Journal: :J. Symb. Log. 2009
Stefan Göller Markus Lohrey Carsten Lutz

We study satisfiability and infinite-state model checking in ICPDL, which extends Propositional Dynamic Logic (PDL) with intersection and converse operators on programs. The two main results of this paper are that (i) satisfiability is in 2EXP, thus 2EXP-complete by an existing lower bound, and (ii) infinite-state model checking of basic process algebras and pushdown systems is also 2EXP-comple...

Journal: :Inf. Comput. 2015
Frank Drewes Joost Engelfriet

A device that generates trees over a ranked alphabet Σ, together with an interpretation of the symbols in Σ as functions or relations on a domain A, generates subsets of A. This concept of tree-based generators is well known and essentially already present in the seminal paper by Mezei and Wright from 1967. A delegation network is a system consisting of a finite set of such generators that can ...

Journal: :CoRR 1994
Robert Frank

Current syntactic theory limits the range of grammatical variation so severely that the logical problem of grammar learning is essentially trivialized. Yet, children exhibit characteristic stages in syntactic development at least through their sixth year. Rather than positing maturational delays in the substantive principles of children's grammars, I suggest that acquisition di culties are the ...

2010
Orna Kupferman Nir Piterman Moshe Y. Vardi

In this paper we develop an automata-theoretic framework for reasoning about infinite-state sequential systems. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finite-state automata. Checking that a system satisfies a tem...

Journal: :Acta Cybern. 2006
András Hócza

This paper presents a method for parsing Hungarian texts using a machine learning approach. The method collects the initial grammar for a learner from an annotated corpus with the help of tree shapes. The PGS algorithm, an improved version of the RGLearn algorithm, was developed and applied to learning tree patterns with various phrase types described by regular expressions. The method also cal...

2007
Frank Drewes Johanna Björklund

We present an algebra whose operations act on musical pieces, and show how this algebra can be used to generate music in a tree-based fashion. Starting from input which is either generated by a regular tree grammar or provided by the user via a digital keyboard, a sequence of top-down tree transducers is applied to generate a tree over the operations provided by the music algebra. The evaluatio...

Journal: : 2023

We show that it is decidable whether the language generated by a given context-free grammar over tree alphabet language. Furthermore, if answer to this question “yes”, then we can even effectively construct regular which generates

2016
B. K. Sharma Apostolos Syropoulos S. P. Tiwari

The main goal of this paper is to introduce and study fuzzy multiset regular grammar to show that fuzzy multiset finite automata and fuzzy multiset regular grammars are equivalent. We also study fuzzy multiset linear grammars and fuzzy multiset regular grammars in normal form. Furthermore, we show the equivalence of fuzzy multiset regular grammars, fuzzy multiset left linear grammars, fuzzy mul...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید