Fixed points of operators are widely studied, and they have been used to describe, for example, the semantics of recursive function definitions (Manna & Shamir [1977]), stability in discrete models for biological development (Herman and Walker [1976]), and to obtain results about cellular spaces (Takahashi [1976]). The regular languages have been characterized by Van Leewen [1975] as homomorphic images of the fixed points of monogenic functions. Herman and Walker [1976] have shown that the set of fixed points of an L-scheme, that is the set of all strings over an alphabet such that each string derives only itself under parallel replacement rules, is a regular language. This result was obtained by showing that, in a self-derivation step, a d...
It is well known that for each context-free language there exists a regular language with the same P...
Tiling systems that recognize two-dimensional languages are intrinsically non-deterministic models. ...
It is well known that the class of regular languages coincides with the class of languages recognize...
In this paper we study the classic problem of determining whether the deterministic and non-determin...
A number of results about deterministic languages (languages accepted by pushdown automata with no c...
This paper considers equality languages and fixed-point languages of homomorphisms and deterministic...
AbstractG-machines are considered as generators of sets of finite and infinite sequences, called G-l...
the date of receipt and acceptance should be inserted later Abstract A special kind of substitution ...
AbstractIt is shown that the problem whether an effectively given deterministic ω-context-free langu...
By relating positive inductive definitions to space-bounded computations of alternating Turing machi...
Abstract. Nested words are a restriction of the class of visibly pushdown lan-guages that provide a ...
AbstractWe establish a pumping lemma for real-time deterministic context-free languages. The pumping...
The existence and complexity of decision procedures for families of deterministic pushdown automata ...
We give a coalgebraic account of context-free languages using the functor ${\cal D}(X) = 2 \times X...
In 1965 Hennie proved that one-tape deterministic Turing machines working in linear time are equival...
It is well known that for each context-free language there exists a regular language with the same P...
Tiling systems that recognize two-dimensional languages are intrinsically non-deterministic models. ...
It is well known that the class of regular languages coincides with the class of languages recognize...
In this paper we study the classic problem of determining whether the deterministic and non-determin...
A number of results about deterministic languages (languages accepted by pushdown automata with no c...
This paper considers equality languages and fixed-point languages of homomorphisms and deterministic...
AbstractG-machines are considered as generators of sets of finite and infinite sequences, called G-l...
the date of receipt and acceptance should be inserted later Abstract A special kind of substitution ...
AbstractIt is shown that the problem whether an effectively given deterministic ω-context-free langu...
By relating positive inductive definitions to space-bounded computations of alternating Turing machi...
Abstract. Nested words are a restriction of the class of visibly pushdown lan-guages that provide a ...
AbstractWe establish a pumping lemma for real-time deterministic context-free languages. The pumping...
The existence and complexity of decision procedures for families of deterministic pushdown automata ...
We give a coalgebraic account of context-free languages using the functor ${\cal D}(X) = 2 \times X...
In 1965 Hennie proved that one-tape deterministic Turing machines working in linear time are equival...
It is well known that for each context-free language there exists a regular language with the same P...
Tiling systems that recognize two-dimensional languages are intrinsically non-deterministic models. ...
It is well known that the class of regular languages coincides with the class of languages recognize...