Open AccessJournal Article
On some classes of tree automata and tree languages
4
TL;DR: This paper homomorphically represents the classes of nilpotent, deflnite, and mono- tone tree automata by means of quasi-cascade-products of unary nilpotents and unary deflnites in the flrst two cases, and by products of simpler tree Automata in the third case.
read more
Abstract: In this paper we give a structural characterization of three classes of tree au- tomata. Namely, we shall homomorphically represent the classes of nilpotent, deflnite, and mono- tone tree automata by means of quasi-cascade-products of unary nilpotent and unary deflnite tree automata in the flrst two cases, and by means of products of simpler tree automata in the third case.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Conditional Lindenmayer systems with subregular conditions: The non-extended case
Jürgen Dassow,Stefan Rudolf +1 more
TL;DR: The hierarchy of language families obtained from conditional Lindenmayer systems with subregular conditions is almost identical to the hierarchy of families of subregular languages.
Conditional Lindenmayer Systems with Subregular Conditions: The Extended Case
Jürgen Dassow,Stefan Rudolf +1 more
TL;DR: This work studies the generative power of extended conditional Lindenmayer systems where the conditions are finite, monoidal, combinational, definite, nilpotent, strictly locally (k)-testable, commutative, circular, suffix-closed, starfree, and union-free regular languages.
On monotone languages and their characterization by regular expressions
TL;DR: It has turned out that the monotone string languages are exactly those languages that can be represented by finite unions of seminormal chain languages.
2
References
Ultimate-Definite and Symmetric-Definite Events and Automata
A. Paz,Bezalel Peleg +1 more
TL;DR: Effective decision procedures whereby it can be decided whether a given finite automata defines such an event are given are given and unique canonical representations for these events are derived.
32
Homomorphic Representations by Producs of Tree Automata
Ferenc Gécseg
- 10 Jun 1994
TL;DR: In this article, necessary and sufficient conditions for sets of frontier-to-root tree automata to be homomorphically complete are given. But they do not cover the case of root-tofrontier automata.
5