scientific article; zbMATH DE number 3551930
From MaRDI portal
Publication:4125808
zbMath0354.68103MaRDI QIDQ4125808
Publication date: 1977
Full work available at URL: https://eudml.org/doc/92040
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Single-tape reset machines ⋮ Unnamed Item ⋮ Sur les générateurs algébriques et linéaires ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Cônes rationnels commutatifs ⋮ Recursivite et cônes rationnels fermés par intersection ⋮ Unnamed Item ⋮ Morphismes et bimorphismes d'arbres ⋮ A result concerning the trios generated by commutative SLIP-languages ⋮ Refining the hierarchy of blind multicounter languages and twist-closed trios. ⋮ Unnamed Item ⋮ Produit dans le cône rationnel engendre par D ⋮ Remarks on blind and partially blind one-way multicounter machines ⋮ An undecidable problem about rational sets and contour words of polyominoes ⋮ Intersections de langages algébriques bornes ⋮ Every commutative quasirational language is regular ⋮ On some bounded semiAFLs and AFLs ⋮ Langages à un compteur
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Syntactic operators on full semiAFLs
- Two iteration theorems for some families of languages
- One counter languages and the IRS condition
- Reversal-bounded multipushdown machines
- Transductions des langages de Chomsky
- Proving containment of bounded AFL
- Every semilinear set is a finite union of disjoint linear sets
- Principal AFL
- Rational sets in commutative monoids
- A characterization of semilinear sets
- Substitution and bounded languages
- AFL with the semilinear property
- Sur diverses familles de langages fermées par transduction rationnelle
- Bounded Algol-Like Languages
- Real-time solutions of the origin-crossing problem
- Quasi-realtime languages
- Chains of full AFL's
- Multitape AFA
- An infinite hierarchy of intersections of context-free languages
- Une hiérarchie des parties rationnelles de N2
- Intersection-closed full AFL and the recursively enumerable languages
