We show how alternating automata provide decision procedures for the equality of inductively de3ned Boolean functions and present applications to reasoning about parameterized families of circuits. We use alternating word automata to formalize families of linearly structured circuits and alternating tree automata to formalize families of tree structured circuits. We provide complexity bounds fo...

Software demonstrators are effective tools to show and understand scientific and engineering concepts in function, and they also allow rapid experiments. In the field of grammatical inference, there is a lack of “ready-to-use” grammar synthesis tools, with simple interfaces showing intermediate stages of the grammar inference process, and the presented work addresses this issue by giving tools ...

This paper presents a novel grammar formalism, Synchronous Tree Unification Grammar (STUG), that borrows ideas from two rather distinct exemplars of tree-based grammar formalisms, namely Synchronous Tree Adjoining Grammar and Tree Unification Grammar. At the same time STUG differs considerably from those in that it allows for a clean separation of syntax and valency. Exploiting this potential i...

This article is devoted to a grammar of the Akkadian verb using finite state technology. It is based on new techniques for which relationships between several representations of a form (four in the Akkadian grammar) are expressed using a tree structure. Feature structures compiled statically in finite transducers are also involved. MOTS-CLÉS : akkadien, morphologie, machines finies à états, str...

this study was an attempt to explore the beliefs of iranian efl teachers about the role of grammar in english language teaching in both state schools and private language institutes. data were collected through a questionnaire developed by burgess and etherington (2002), which consisted of 11 main subscales and was divided into two sections. the first section dealt with approaches to grammar te...

We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus cannot be accepted by a finite tree automaton. The proof is extended to cover the proofs used by grammars based on the Lambek calculus, which typically use only a subset of the set of all proofs. While Lambek grammars can assign...

Tree walking automata TWAs recently received new attention in the elds of formal languages and databases Towards a better understanding of their expressiveness we characterize them in terms of transitive closure logic formulas in normal form It is conjectured by Engelfriet and Hoogeboom that TWAs cannot de ne all regular tree languages or equivalently all of monadic second order logic We proof ...

A new sort of combinatorial generating system, called bud generating system, is introduced. Bud generating systems are devices for specifying sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous grammars, allowing to work with all these generating systems in a unified way. The theory of bud generating sy...

Given any dag t representing a fully or partially compressed XML document, we present a method for evaluating any positive unary query expressed in terms of Core XPath axes, on t, without unfolding t into a tree. To each Core XPath query of a certain basic type, we associate a word automaton; these automata run on the graph of dependency between the non-terminals of the straightline regular tre...

This paper investigates Kamp-like and Büchi-like theorems for 1-clock Alternating Timed Automata (1-ATA) and its natural subclasses. A notion of 1-ATA with loop-free-resets is defined. This automaton class is shown to be expressively equivalent to the temporal logic RatMTL which is MTL[FI] extended with a regular expression guarded modality. Moreover, a subclass of future timed MSO with k-varia...