All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

13 603 (0,154s)

Result

Jumping Pure Grammars

This paper introduces and studies jumping pure grammars, which are conceptualized just like classical pure grammars except that during the applications. The paper compares the generative power of jumping pure

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2019
  • Jimp
  • Link
Result

On Positioned Eco-Grammar Systems and Pure Grammars of Type 0

with pure regulated context-free grammars (see [3]). We will show that the family of languages generated by the pure grammars of type 0 is a proper subclass of the family of languages generated by positioned eco-<...

IN - Informatika

  • 2013
  • Jx
  • Link
Result

Positioned agents in eco-grammar systems with border markers and pure regulated grammars

in the eco-grammar systems and pure grammars. We extend model of the positioned eco-grammar systems by boundary markers and we introduce bordered positioned eco-grammar systems with three types of pur...

IN - Informatika

  • 2012
  • Jx
  • Link
Result

A Variant of Pure Two-dimensional Context-free Grammars generating Picture Languages

Considering a large variety of approaches in generating picture languages, the notion of pure two-dimensional context-free grammar (P2DCFG) represents a simple yet expressive non-isometric language generator of picture arrays. In th...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2014
  • D
  • Link
Result

Limits of Pure Grammars with Monotone Productions.

BA - Obecná matematika

  • 1998
  • X
Result

Limits of Pure Grammars with Monotone Productions.

BA - Obecná matematika

  • 1998
  • Jx
Result

Positioned agents in Eco-grammar systems

with three types of pure (regulated) grammarsPositioned eco-grammar systems (PEG systems, for short) were introduced in Langer, M.: Agents placed in the environment of eco-grammar systems ? Positioned eco-gram...

IN - Informatika

  • 2011
  • Jx
  • Link
Result

Solutions To Four Open Problems Concerning Controlled Pure Grammar Systems

In this paper, we address several open problems concerning pure grammar systems (pGSs) and their controlled versions. More specifically, we prove the following four results. (I) Regular-controlled pGSs having a single component defi...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2014
  • Jimp
  • Link
Result

Controlled Pure Grammar Systems

This paper discusses grammar systems that have only terminals, work in the leftmost way, and generate their languages under the regulation by control languages over rule labels. It establishes three results concerning their generative power-...

IN - Informatika

  • 2012
  • Jx
  • Link
Result

On the weight of universal insertion grammars

We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achieved by either applying an inverse morphism and a weak coding, or a left (right) quotient with a regular language. W...

IN - Informatika

  • 2008
  • Jx
  • 1 - 10 out of 13 603