scientific article; zbMATH DE number 3604381
From MaRDI portal
Publication:4170259
zbMath0388.68068MaRDI QIDQ4170259
Sheila A. Greibach, Ronald V. Book
Publication date: 1978
Full work available at URL: https://eudml.org/doc/92086
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Representations of language families by homomorphic equality operations and generalized equality sets ⋮ Independance forte de certaines opérations ⋮ Refining the hierarchy of blind multicounter languages and twist-closed trios. ⋮ On some bounded semiAFLs and AFLs
Cites Work
- Unnamed Item
- Syntactic operators on full semiAFLs
- Reversal-bounded multipushdown machines
- Remarks on the complexity of nondeterministic counter languages
- Computation sequence sets
- Control sets on context-free grammar forms
- One way finite visit automata
- On languages specified by relative acceptance
- Remarks on blind and partially blind one-way multicounter machines
- Principal AFL
- AFL with the semilinear property
- Absolutely parallel grammars and two-way finite-state transducers
- Reversal-Bounded Acceptors and Intersections of Linear Languages
- Bounded-crossing transducers
- Continuous operations on languages
- Simple Representations of Certain Classes of Languages
- Separating Nondeterministic Time Complexity Classes
- Linear Languages and the Intersection Closures of Classes of Languages
- The Unsolvability of the Recognition of Linear Context-Free Languages
- Counter machines and counter languages
- On equal matrix languages
- One-way stack automata
- An Infinite Hierarchy of Context-Free Languages
- Quasi-realtime languages
- A note on AFLs and bounded erasing
- Multitape AFA
- Erasing in context-free AFLs
- Intersection-closed full AFL and the recursively enumerable languages
This page was built for publication:
