On linear languages recognized by deterministic biautomata (Q2672654): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2021.104778 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3178428074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-bounded multipushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTIC BIAUTOMATA AND THEIR DESCRIPTIONAL COMPLEXITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization and Characterizations for Biautomata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptional and computational complexity of finite automata -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some subclasses of context-free languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic biautomata and subclasses of deterministic linear languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded reducibility among combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biautomata for k-Piecewise Testable Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On biautomata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On top-to-bottom recognition and left recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Context Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mappings induced by PGSM-mappings and some recursively unsolvable problems of finite probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for LL- and LR-regular grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine realization of the linear context-free languages / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 06:47, 29 July 2024

scientific article
Language Label Description Also known as
English
On linear languages recognized by deterministic biautomata
scientific article

    Statements

    On linear languages recognized by deterministic biautomata (English)
    0 references
    0 references
    0 references
    13 June 2022
    0 references
    linear languages
    0 references
    deterministic biautomata
    0 references
    deterministic linear grammars
    0 references

    Identifiers