Non-returning deterministic and nondeterministic finite automata with translucent letters (Q6186539): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Properties of right one-way jumping finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic right one-way jumping finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On input-revolving deterministic and nondeterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growing context-sensitive languages and Church-Rosser languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Way Jumping Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5871911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jumping Finite Automata: Characterizations and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restarting automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Context Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: JUMPING FINITE AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5867524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 5′→3′ Sensing Watson-Crick Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally Deterministic CD-Systems of Stateless R(1)-Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On CD-systems of stateless deterministic R-automata with window size one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally deterministic CD-systems of stateless R-automata with window size 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in formal languages and applications. / rank
 
Normal rank

Revision as of 11:29, 26 August 2024

scientific article; zbMATH DE number 7799054
Language Label Description Also known as
English
Non-returning deterministic and nondeterministic finite automata with translucent letters
scientific article; zbMATH DE number 7799054

    Statements

    Non-returning deterministic and nondeterministic finite automata with translucent letters (English)
    0 references
    0 references
    0 references
    2 February 2024
    0 references
    finite automaton
    0 references
    translucent letter
    0 references
    language class
    0 references

    Identifiers