QRT FIFO automata, breadth-first grammars and their relations

Cherubini, Alessandra; Citrini, Claudio; Reghizzi, Stefano Crespi; Mandrioli, Dino

doi:10.1016/0304-3975(91)90053-5

Cited by 35 publications

(24 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The language of non-deterministic palindromes P -{uu R \u E £*}, over some alphabet |E| > 2, is a wellknown context-free language. In [Bre93,Fri94] a construction is given for building a one-queue automaton (see Cherubini et alii in [Che91] for a review of queue automata and Manna in [Man74] for a related argument, Post machines) that recognizes a given fFLL\L\. If the flattened FE generating L is [ej-free then the obtained one-queue automaton is quasi-real-time (QRT).…”

Section: Decidability Propertiesmentioning

confidence: 99%

Fair expressions and regular languages over lists

Breveglieri¹

1997

RAIRO-Theor. Inf. Appl.

View full text Add to dashboard Cite

Section: Decidability Propertiesmentioning

confidence: 99%

Fair expressions and regular languages over lists

Breveglieri¹

1997

RAIRO-Theor. Inf. Appl.

View full text Add to dashboard Cite

“…The Morse sequence 0110 1001 1001 0110 · · · generated by 0 → 01, 1 → 10 is its complement in reverse, so a two-stack machine can easily be constructed for it. On the other hand, the Fibonacci sequence abaab aba abaab · · · generated by a → ab, b → a, which occurs in the quasiperiodic behavior of coupled oscillators, can be recognized with a queue [4] but does not seem to have any obvious palindromic or stack-like structure. We leave this as an open question.…”

Section: The Dynamical Zeta Functionmentioning

confidence: 99%

“…where L BCF is breadth-first context-free, R is regular, and h is a a homomorphism that maps symbols to strings [4]. The idea is that L BCF ∩ R is a language in a decorated alphabet, whose variables are the queue symbols and whose terminals include both the input symbol and the machine's internal state.…”

Section: Zeromentioning

confidence: 99%

“…Cherubini et al [4] define a real-time queue automaton as a finite-state automaton with access to a finite number of queues, in which it is allowed to make exactly one computation step per input symbol. The educated reader may know that, given unlimited time, a machine with a queue can simulate a universal Turing machine with quadratic slowdown.…”

Section: One Queue Can Toomentioning

confidence: 99%

See 1 more Smart Citation

Queues, stacks, and transcendentality at the transition to chaos

Moore¹,

Lakdawala²

2000

Physica D: Nonlinear Phenomena

View full text Add to dashboard Cite

Abstract. We examine the one-humped map at the period-doubling transition to chaos, and ask whether its long-term memory is stack-like (last-in, first-out) or queue-like (first-in, first-out). We show that it can be recognized by a real-time automaton with one queue, or two stacks, and give several new grammatical characterizations of it. We argue that its memory has a queue-like character, since a single stack does not suffice. We also show that its dynamical zeta function, generating function and growth function are transcendental. The same results hold for any periodmultiplying cascade. We suggest that transcendentality might be a sign of dynamical phase transitions in other systems as well.

show abstract

“…It is known that pushdown automata accept only semilinear unary languages, hence regular languages, whereas even quasi-real-time queue automata may accept non-semilinear unary languages [1].…”

mentioning

confidence: 99%

Deterministic Set Automata

Kutrib¹,

Malcher²,

Wendlandt³

2014

Developments in Language Theory

View full text Add to dashboard Cite

Abstract. We consider the model of deterministic set automata which are basically deterministic finite automata equipped with a set as an additional storage medium. The basic operations on the set are the insertion of elements, the removing of elements, and the test whether or not an element is in the set. We investigate the computational power of deterministic set automata and compare the language class accepted with the context-free languages and classes of languages accepted by queue automata. As results the incomparability to all classes considered is obtained. In the second part of the paper, we examine the closure properties of the class of DSA languages under Boolean operations. Finally, we show that deterministic set automata may be an interesting model from a practical point of view by proving that their emptiness problem is decidable.

show abstract

QRT FIFO automata, breadth-first grammars and their relations

Cited by 35 publications

References 10 publications

Fair expressions and regular languages over lists

Fair expressions and regular languages over lists

Queues, stacks, and transcendentality at the transition to chaos

Deterministic Set Automata

Contact Info

Product

Resources

About