Advocating ownership
From MaRDI portal
Publication:6567779
DOI10.1007/3-540-62034-6_57zbMATH Open1541.68133MaRDI QIDQ6567779
Henning Fernau, Klaus Reinhardt, Klaus-Jörn Lange
Publication date: 5 July 2024
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Classical models of computation (Turing machines, etc.) (68Q04) Networks and circuits as models of computation; circuit complexity (68Q06)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast recognition of deterministic cfl's with a smaller number of processors
- Two-way automata with more than one storage medium
- Complexity theory of parallel time and hardware
- On uniform circuit complexity
- Unambiguity of circuits
- Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits
- Simulation of Parallel Random Access Machines by Circuits
- On the Tape Complexity of Deterministic Context-Free Languages
- A unified approach to models of synchronous parallel machines
- Parallelism in random access machines
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
This page was built for publication: Advocating ownership
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567779)
