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”

On linear languages recognized by deterministic biautomata

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F22%3A00129032" target="_blank" >RIV/00216224:14310/22:00129032 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.sciencedirect.com/science/article/pii/S0890540121000936#" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0890540121000936#</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.ic.2021.104778" target="_blank" >10.1016/j.ic.2021.104778</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On linear languages recognized by deterministic biautomata

  • Original language description

    We introduce the notion of a deterministic biautomaton, a device that reads inputs from both ends, and admits at most one computation on every input word. We show that deterministic biautomata recognize a class of languages which is properly included in the class of linear languages, and which is incomparable to the class of languages recognized by deterministic one-turn pushdown automata. We propose three restrictions of the basic model of deterministic biautomata to characterize the classes of languages generated by DL, linear LL(1), and NH-DL grammars. This results in a chain of four subclasses of linear languages in which all inclusions are strict. For these subclasses and basic operations, we show whether or not a particular class is closed under a considered operation. We prove that it is undecidable whether a linear language belongs to any of these four classes and answer some other decidability questions.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • 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

    <a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2022

  • 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

  • Name of the periodical

    Information and Computation

  • ISSN

    0890-5401

  • e-ISSN

    1090-2651

  • Volume of the periodical

    286

  • Issue of the periodical within the volume

    July

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    22

  • Pages from-to

    1-22

  • UT code for WoS article

    000816167600008

  • EID of the result in the Scopus database

    2-s2.0-85110419611