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”

Final sentential forms

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F23%3APU149400" target="_blank" >RIV/00216305:26230/23:PU149400 - isvavai.cz</a>

  • Result on the web

    <a href="https://arxiv.org/abs/2309.08719v1" target="_blank" >https://arxiv.org/abs/2309.08719v1</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.4204/EPTCS.388.6" target="_blank" >10.4204/EPTCS.388.6</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Final sentential forms

  • Original language description

    Let G be a context-free grammar with a total alphabet V, and let F be a final language over an alphabet W as a subset of V. A final sentential form is any sentential form of G that, after omitting symbols from V-W, it belongs to F. The string resulting from the elimination of all nonterminals from W in a final sentential form is in the language of G finalized by F if and only if it contains only terminals. The language of any context-free grammar finalized by a regular language is context-free. On the other hand, it is demonstrated that L is a recursively enumerable language if and only if there exists a propagating context-free grammar G such that L equals the language of G finalized by {w#rev(w):string w over alphabet {0,1}}, where rev(w) is the reversal of w.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

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

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2023

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings 13th International Workshop on Non-Classical Models of Automata and Applications

  • ISBN

  • ISSN

    2075-2180

  • e-ISSN

  • Number of pages

    9

  • Pages from-to

    38-47

  • Publisher name

    School of Computer Science and Engineering, University of New South Wales

  • Place of publication

    Famagusta

  • Event location

    Famagusta, Cyprus

  • Event date

    Sep 18, 2023

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article