On coordinated selective substitutions: Towards a unified theory of grammars and machines
type: Item
instance of: scholarly article
title: On coordinated selective substitutions: Towards a unified theory of grammars and machines
zbMATH Open document ID: 0601.68054
DOI: 10.1016/0304-3975(85)90086-6
published in: Theoretical Computer Science
publication date: 1985-01-01T00:00:00Z
review text: The notion of a coordinated table selective substitution system (a cts system) is introduced. It provides a unifying framework for both grammars and machines (automata) and hence a really broad framework for formal language theory. An extensive number of examples is given which illustrate how a quite considerable number of grammars and automata considered in the literature may be 'naturally' interpreted as special instances (subclasses of the class) of cts systems.
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3970129
zbMATH Keywords: selector
zbMATH Keywords: coordinated table selective substitution system
zbMATH Keywords: cts system
zbMATH Keywords: formal language
author: Grzegorz Rozenberg
MaRDI profile type: Publication
full work available at URL: 0304-3975(85)90086-6
OpenAlex ID: W2063558945
cites work: CTS systems and Petri nets
cites work: Net theory and applications. Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg, October 8-19, 1979. Ed. by Wilfried Brauer
cites work: Regular canonical systems
cites work: Q4048566
cites work: Q4079524
cites work: Q4089754
cites work: TOL schemes and control sets
cites work: Q3206318
cites work: Q4198075
cites work: Context-free like restrictions on selective rewriting
cites work: Sequential, continuous and parallel grammars
cites work: Q5565118
cites work: Q4162498
cites work: Q4140407
cites work: Q5678435
cites work: Some definitional suggestions for automata theory
cites work: Q4766065
description: scientific article; zbMATH DE number 3970129