Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 1361501

From MaRDI portal
Publication:4699320
Jump to:navigation, search

zbMATH Open0947.68069MaRDI QIDQ4699320FDOQ4699320


Authors: Arfst Nickelsen Edit this on Wikidata


Publication date: 1997



Title of this publication is not available (Why is that?)



Recommendations

  • Comparing verboseness for finite automata and Turing machines
  • On polynomially \(\mathcal{D}\)-verbose sets
  • scientific article; zbMATH DE number 2086408
  • Terse, superterse, and verbose sets


zbMATH Keywords

Turing machine


Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)



Cited In (3)

  • On polynomially \(\mathcal{D}\)-verbose sets
  • Comparing verboseness for finite automata and Turing machines
  • Title not available (Why is that?)





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 Q4699320)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4699320&oldid=18932864"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 19:38. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki