QRT FIFO automata, breadth-first grammars and their relations
Authors:
- Alessandra CherubiniACAlessandra Cherubini
- Claudio CitriniCCClaudio Citrini
- Stefano Crespi ReghizziSRStefano Crespi Reghizzi
- Dino MandrioliDMDino Mandrioli
- 1 August 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 85 (1) , 171-203
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the intersection of stacks and queuesTheoretical Computer Science, 1988
- On Deterministic Multi-Pass AnalysisSIAM Journal on Computing, 1986
- Multiple equality sets and post machinesJournal of Computer and System Sciences, 1980
- Automates a fileTheoretical Computer Science, 1980
- Reset machinesJournal of Computer and System Sciences, 1979
- k + 1 Heads Are Better than kJournal of the ACM, 1978
- One-way multihead writing finite automataInformation and Control, 1976
- Über einen Automaten mit PufferspeicherungComputing, 1970
- Real-Time Definable LanguagesJournal of the ACM, 1967
- Mappings of languages by two-tape devicesJournal of the ACM, 1965