Queue automaton

Known as: Queue machine 
A queue machine or queue automaton is a finite state machine with the ability to store and retrieve data from an infinite-memory queue. It is a model… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1985-2016
01219852016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Many recent processor architectures expose their datapaths so that the compiler can not only schedule instructions to increase… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 5
Is this relevant?
2009
2009
Queue processors are a viable alternative for high performance embedded computing and parallel processing. We present the design… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2007
2007
Embedded systems very often demand small memory footprint code. A popular architectural modification to improve code density in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Machines whose sole function is to re-order their input data are considered. Every such machine defines a set of allowable input… (More)
  • figure 1
  • figure 2
Is this relevant?
1998
1998
We show how to accept a context-free language nondeterministically in O( n log n) time on a two-queue machine. 
Is this relevant?
1994
1994
  • 1994
The Argument Forwarding Queue (AFQ) machine architecture combines the control ow paradigm of Von Neumann machines with the… (More)
Is this relevant?
1994
1994
We define an infinite Lyndon word as the limit of an increasing sequence of prefix preserving Lyndon words and show that some of… (More)
Is this relevant?
1988
1988
We define and develop a theory of bzes~th-first (BF) phrase-structure grailars. ~aeir novelty comes from a different application… (More)
Is this relevant?
1985
1985
An execution model that supports program reentrancy, recursion, and automatic run-time loop unravelling is described. This… (More)
Is this relevant?