scientific article
From MaRDI portal
Publication:3657451
zbMath0512.68055MaRDI QIDQ3657451
Publication date: 1983
Full work available at URL: https://eudml.org/doc/92180
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
context-free languagesone-counter languagesspace complexity classeschecking stack languageserasing bounded transducers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reversal-bounded multipushdown machines
- Translational lemmas, polynomial time, and \((\log n)^j\)-space
- Remarks on the complexity of nondeterministic counter languages
- Time- and tape-bounded Turing acceptors and AFLs
- Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
- Optimization of LR(k) parsers
- A homomorphic characterization of time and space complexity classes of languages†
- Equality Sets and Complexity Classes
- Reversal-Bounded Acceptors and Intersections of Linear Languages
- On the Tape Complexity of Deterministic Context-Free Languages
- Counter machines and counter languages
- Quasi-realtime languages
- Characterizations of transductions defined by abstract families of transducers
This page was built for publication:
