One counter languages and the IRS condition
TLDR
Any one counter language that is not nonterminal bounded must contain an infinite regular set; every generator of the family of one counter languages must contain a finite regular set.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1975-04-01 and is currently open access. It has received 34 citations till now. The article focuses on the topics: Bounded function & Generator (mathematics).read more
Citations
More filters
Journal ArticleDOI
Cônes rationnels commutativement clos
Journal ArticleDOI
Langages á un Compteur
TL;DR: Nous montrons que tout generateur de Rocl est bifidele et qu'il existe un langage a un compteur qui domine tous les autres par transduction rationnelle preservant les longueurs.
Journal ArticleDOI
Generateurs algebriques et systemes de paires iterantes
TL;DR: This theorem means that any combination of certain iterative pairs in the image language by a rational transduction must appear, in a similar way, in the source language.
Journal ArticleDOI
On nonstochastic languages and homomorphic images of stochastic languages
TL;DR: Using the theory of uniformly distributed sequences, a sufficient condition for a one-letter language to be nonstochastic is presented and among the applications is the result that {ap¦p is a prime} is nonStochastic.
Journal ArticleDOI
On some transducer equivalence problems for families of languages
TL;DR: In this article, the equivalence and length equivalence of compositions of a morphism and an inverse morphism are studied. But the equivalences of morphisms and their inverses are not considered.
References
More filters
Book ChapterDOI
The Algebraic Theory of Context-Free Languages*
TL;DR: This chapter discusses the several classes of sentence-generating devices that are closely related, in various ways, to the grammars of both natural languages and artificial languages of various kinds.
Journal ArticleDOI
Linear automaton transformations
TL;DR: For a finite commutative ring with unit the authors determine which linear transformations M: RN—+RN can be realized by finite automata.
Journal ArticleDOI
On relations defined by generalized finite automata
C. C. Elgot,J. E. Mezei +1 more
TL;DR: A transduction, in the sense of this paper, is a n-ary word relation (which may be a function) describable by a finite directed labeled graph that constitutes the equilibrium (potential) behavior of 1-dimensional, bilateral iterative networks.
Proceedings ArticleDOI
Abstract families of languages
TL;DR: The notion of an abstract family of languages (AFL) as a family of sets of words satisfying certain properties common to many types of formal languages is introduced and operations preserving AFL are considered.
Journal ArticleDOI
Finite-Turn Pushdown Automata
TL;DR: A study of these finite-turn pda and the context free languages they recognize and their characterized both in terms of grammars and generation from finite sets by three operations.