Th. Kretschmer, A closure property of regular languages, Theoret. Comput. Sci. 61 (1988) 283-287. [9] K. Madlener, P. Narendran, F. Otto and L. Zhang, On weakly confluent monadic string-rewritingT. Kretschmer, A closure property of regular languages, Theoret Comput. Sci. , 61 (...
THE CONGRUENCE THEORY OF CLOSURE-PROPERTIES OF REGULAR TREE-LANGUAGES TIRRI,S - 《Theoretical Computer Science》 被引量: 3发表: 1990年 THE CONGRUENCE THEORY OF CLOSURE-PROPERTIES OF REGULAR TREE-LANGUAGES -TIRRI-THEOR COMPUT SCITirri S (1990) The congruence theory of closure properties of regular...
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-free languages, the Kleene closure may attain just three possible ...
We also consider regular languages of infinite nested words and show that the closure properties, MSO-characterization, and decidability of decision problems ... RAJEEV ALUR,P. MADHUSUDAN - 《Journal of the Acm》 被引量: 583发表: 2009年 Context-Dependent Nondeterminism for Pushdown Automata the ...
Complexity classes of the form , whose elements are languages recognizable by polynomial-time Turing machines with oracles for languages in C [19], automatically inherit from many closure properties. For instance, the determinism of Turing machines characterising implies closure under complement, simply ...
A class of languages is closed under a given operation if the resulting language belongs to this class whenever the operands belong to it. We examine the closure properties of various subclasses of regular languages under basic operations of intersection, union, concatenation and power, positive ...
Prefix-free regular languages: Closure properties, difference, and left quotient. In Z. Kot´asek, J. Bouda, I. Cerna´, L. Sekanina, T. Vojnar, and D. Antos, editors, MEMICS, volume 7119 of Lecture Notes in Computer Science, pages 114-122. Springer, 2011.Krausova´, M.: ...
Closure algorithms and the star-height problem of regular languagesRoland BackhouseBackhouse, R.: Closure Algorithms and the Star-Height Problem of Regular Languages. Ph.D. thesis, Imperial College, London (1975)
Family of fuzzy multiset regular languages is known to be closed under regular operations. The paper extends the knowledge and proves that the family is also closed under the operations of intersection, complement, and arbitrary homomorphism.Pavel Martinek...
regular expressionKleene-closure operationIt has been proved that regular language is a subclass of Petri net languages. Standard properly end Petri net, a subclass of Petri nets is defined in the related references, and the equivalency between a standard properly end Petri net and a regular ...