Abstract families of relations

Authors:
Karel ulík, II
Affiliations:
-
Venue:
Journal of Computer and System Sciences
Year:
1971

Citing 10
Cited 0

Stack automata and compiling

Journal of the ACM (JACM)
Syntax-Directed Transduction

Journal of the ACM (JACM)
An Infinite Hierarchy of Context-Free Languages

Journal of the ACM (JACM)
Nested Stack Automata

Journal of the ACM (JACM)
Finite automata and their decision problems

IBM Journal of Research and Development
On relations defined by generalized finite automata

IBM Journal of Research and Development
Syntax directed translations and the pushdown assembler

Journal of Computer and System Sciences
Properties of syntax directed translations

Journal of Computer and System Sciences
Multitape one-way nonwriting automata

Journal of Computer and System Sciences
Principal AFL

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

A generalization of an abstract family of languages-abstract family of relations (AFR)-is introduced and its special cases are considered. The properties of AFR's and their special cases and their relation to abstract families of languages are studied. Many known formal schemes for description of language translations are shown to define AFRs. As an application of the concept of AFR, it is shown that the class of mappings defined by any finitely encodable abstract family of transducers can be generated from a single language over a 2-letter alphabet by pairs of finite state transductions.