Regulated rewriting
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
- 2011
In recent papers [4, 5, 8, 11] Petri net controlled grammars have been introduced and investigated. It was shown that various… (More)
Is this relevant?
2011
2011
- Theor. Comput. Sci.
- 2011
Multicellular organisms undergo a complex developmental process, orchestrated by the genetic information in their cells, in order… (More)
Is this relevant?
2011
2011
- ICTAC
- 2011
We investigate computational resources used by alternating Turing machines (ATMs) to accept Szilard languages (SZLs) of regulated… (More)
Is this relevant?
1999
1999
- Grammatical Models of Multi-Agent Systems
- 1999
We consider regulated (n-dimensional) context-free array grammars of nite index, i.e., with a limited number of active areas… (More)
Is this relevant?
1997
1997
- Acta Informatica
- 1997
In this paper, we investigate the concept of unconditional transfer within various forms of regulated grammars like programmed… (More)
Is this relevant?
1997
1997
- New Trends in Formal Languages
- 1997
Motivated by natural language analysis we introduce restarting automata with rewriting. They are acceptors on the one hand, and… (More)
Is this relevant?
1997
1997
- New Trends in Formal Languages
- 1997
We consider conditional context-free grammars that generate languages of nite index. Thereby, we solve an open problem stated in… (More)
Is this relevant?
1996
1996
- 1996
In this paper, we investigate the concept of unconditional transfer within various forms of regulated grammars like programmed… (More)
Is this relevant?
1996
1996
- 1996
We prove normal form theorems for programmed, ordered, and random context, context-free grammars as well as context-free grammars… (More)
Is this relevant?
1986
1986
- 1986
Context-free grammars are not able to cover all linguistic phenomena. Thus we define some types of grammars where context-free… (More)
Is this relevant?