scientific article; zbMATH DE number 3604381
From MaRDI portal
Publication:4170259
Cites work
- scientific article; zbMATH DE number 3603267 (Why is no real title available?)
- A note on AFLs and bounded erasing
- AFL with the semilinear property
- Absolutely parallel grammars and two-way finite-state transducers
- An Infinite Hierarchy of Context-Free Languages
- Bounded-crossing transducers
- Computation sequence sets
- Continuous operations on languages
- Control sets on context-free grammar forms
- Counter machines and counter languages
- Erasing in context-free AFLs
- Intersection-closed full AFL and the recursively enumerable languages
- Linear Languages and the Intersection Closures of Classes of Languages
- Multitape AFA
- On equal matrix languages
- On languages specified by relative acceptance
- One way finite visit automata
- One-way stack automata
- Principal AFL
- Quasi-realtime languages
- Remarks on blind and partially blind one-way multicounter machines
- Remarks on the complexity of nondeterministic counter languages
- Reversal-Bounded Acceptors and Intersections of Linear Languages
- Reversal-bounded multipushdown machines
- Separating Nondeterministic Time Complexity Classes
- Simple Representations of Certain Classes of Languages
- Syntactic operators on full semiAFLs
- The Unsolvability of the Recognition of Linear Context-Free Languages
Cited in
(4)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170259)