One way finite visit automata
type: Item
instance of: scholarly article
title: One way finite visit automata
zbMATH Open document ID: 0368.68059
DOI: 10.1016/0304-3975(78)90035-X
published in: Theoretical Computer Science
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D10
zbMATH DE Number: 3574990
author: Sheila A. Greibach
MaRDI profile type: Publication
cites work: Reversal-bounded multipushdown machines
cites work: Phrase structure languages, finite machines, and channel capacity
cites work: Quasi-realtime languages
cites work: On certain formal properties of grammars
cites work: Two-way sequential transductions and stack automata
cites work: On Relations Defined by Generalized Finite Automata
cites work: The reduction of tape reversals for off-line one-tape Turing machines
cites work: Studies in abstract families of languages
cites work: On AFL generators for finitely encoded AFA
cites work: Principal AFL
cites work: AFL with the semilinear property
cites work: Control sets on grammars
cites work: Derivation-bounded languages
cites work: Finite-Turn Pushdown Automata
cites work: Chains of full AFL's
cites work: Checking automata and one-way stack languages
cites work: Control sets on context-free grammar forms
cites work: An Infinite Hierarchy of Context-Free Languages
cites work: Syntactic operators on full semiAFLs
cites work: Tape-reversal bounded Turing machine computations
cites work: Linear Automaton Transformations
cites work: On Context-Free Languages
cites work: Q5541339
cites work: Absolutely parallel grammars and two-way finite-state transducers
cites work: Bounded-crossing transducers
cites work: Q4122826
cites work: Finite-turn checking automata
cites work: On equal matrix languages
cites work: A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
cites work: Left-derivation bounded languages
cites work: Simple Representations of Certain Classes of Languages
cites work: Uniformly erasable AFL
cites work: Controlled pushdown automata
cites work: Control sets on linear grammars
cites work: A geometric hierarchy of languages
cites work: The complexity of the membership problem for some extensions of context-free languagest†
cites work: Two-way A-transducers and AFL
cites work: Stack Machines and Classes of Nonnested Macro Languages
description: scientific article; zbMATH DE number 3574990