Regulated rewriting is a specific area of formal languages studying grammatical systems which are able to take some kind of control over theâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

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

- Daniel Lobo, Francisco J. Vico, JÃ¼rgen Dassow
- 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

- Liliana Cojocaru, Erkki MÃ¤kinen
- 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

- Henning Fernau, Rudolf Freund, Markus Holzer
- 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

- Henning Fernau
- 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

- Petr Jancar, Frantisek MrÃ¡z, Martin PlÃ¡tek, JÃ¶rg Vogel
- 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

- Henning Fernau, Markus Holzer
- 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

- Henning Fernau
- 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

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

- JÃ¼rgen Dassow
- 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?