Syntactic operators on full semiAFLs

DOI10.1016/S0022-0000(72)80039-4zbMath0269.68046MaRDI QIDQ758321

Sheila A. Greibach

Publication date: 1972

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (28)

Sur la structure des langages algébriques ⋮ Unnamed Item ⋮ Representations of language families by homomorphic equality operations and generalized equality sets ⋮ On the usefulness of bifaithful rational cones ⋮ Familles de langages fermées par crochet ouvert ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Cônes rationnels commutatifs ⋮ Tree transducers, L systems, and two-way machines ⋮ A propos du lemme de substitution ⋮ Independance forte de certaines opérations ⋮ The equivalence of deterministic gsm replications onQ-rational languages is decidable ⋮ Array automata and operations on array languages ⋮ Langages satures et cônes decroissants. Langages et cônes bifideles ⋮ On incomparable abstract family of languages (AFL) ⋮ Familles de langages translatables et fermées par crochet ⋮ Context-free grammar forms ⋮ Comparing language operations ⋮ Proving containment of bounded AFL ⋮ Control sets on context-free grammar forms ⋮ One way finite visit automata ⋮ Générateurs algébriques et systèmes de paires iterantes ⋮ Compelled operations and operations of degreeP ⋮ Substitution and bounded languages ⋮ Three hierarchies of transducers ⋮ Hierarchies of hyper-AFLs ⋮ A note on non-generators of full afl's

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transductions des langages de Chomsky
• Checking automata and one-way stack languages
• Derivation-bounded languages
• Principal AFL
• Substitution in families of languages
• AFL with the semilinear property
• Linear Automaton Transformations
• Intercalation theorems for stack languages
• On Relations Defined by Generalized Finite Automata
• Bounded Algol-Like Languages
• A Characterization of Machine Mappings
• Bounded Regular Sets
• Finite-Turn Pushdown Automata
• Quotients of Context-Free Languages
• The Unsolvability of the Recognition of Linear Context-Free Languages
• Counter machines and counter languages
• On equal matrix languages
• One-way stack automata
• An Infinite Hierarchy of Context-Free Languages
• Full AFLs and nested iterated substitution
• Quasi-realtime languages
• Studies in abstract families of languages
• Chains of full AFL's
• Inclusion relations among families of context-free languages
• Characteristic and ultrarealtime languages
• Multitape AFA
• Phrase structure languages, finite machines, and channel capacity

This page was built for publication: Syntactic operators on full semiAFLs