A context-free tree grammar is linear, if no rule permits the copying of subtrees. For this class of linear context-free tree languages we show that the grammar derivation mode, which is very important for the general class of context-free tree languages, is immaterial. The main result we...
2009) on the state-complexity of representing sub- or superword closures of context-free grammars (CFGs): (1) We prove a (tight) upper bound of $2^{\\mathcal{O}(n)}$ on the size of nondeterministic finite automata (NFAs) representing the subword closure of a CFG of size $n$. ...
Several proofs of the closure of the context-free languages under cyclic shift are known [125,126]; in particular, Hopcroft and Ullman [132, Exercise 3.4(c)] present a transformation of a context-free grammar to a grammar for its cyclic shift. Whether anything similar holds for Boolean ...
We study the Kleene closure operation on regular and prefix-free languages. Using an alphabet of size 2 n , we get the contiguous range from 1 to 3/4·2 n of complexities of the Kleene closure of regular languages accepted by minimal n -state deterministic finite automata. In the case of...
tiontreesofgrammarformalismsthatextendthe context-freelanguages.However,findingtheright formalismthatextendsMSOhasbeenachallenge toresearchers.Weproposeheretoconsiderfirst- ordertransitiveclosurelogic(FO(TC)),whichwas originallydefinedtocapturethecomplexityclass ...
We study the Kleene closure operation on regular and prefix-free languages. Using an alphabet of size 2n, we get the contiguous range from 1 to 3/4·2n of complexities of the Kleene closure of regular languages accepted by minimal n-state deterministic finite automata. In the case of prefix...
context-free languages ; Parikh mapping ; presburger arithmetic ; sets of integers M Rigo - Elsevier Science Publishers B. V. 被引量: 1发表: 2003年 Separate bridge beach area after the inner closure apparatus and method for removal of the slip formwork 本发明公开了一种滩涂区分离式桥梁合龙后...
yes, closures can be used in server-side scripting languages such as php and python. these languages support closures, allowing developers to take advantage of the benefits closures offer, such as encapsulation and callback functionality. can closures be used in mobile app development for handling ...
Context-free evolutionary grammars and the structural language of nucleic acids Basic questions regarding these devices and their generated languages are investigated: generative capacity, closure properties, decidability. We also briefly ... Jürgen,Dassow,and,... - 《Biosystems》 被引量: 34发表: 19...
On the Step Branching Time Closure of Free-Choice Petri Nets Stephan Mennicke, Jens-Wolfhard Schicke-Uffmann, and Ursula Goltz TU Braunschweig, Germany {mennicke,goltz}@ips.cs.tu-bs.de, drahflow@gmx.de Abstract. Free-choice Petri nets constitute a non-trivial subclass of Petri nets, ...