\(\mathrm{GF}(2)\)-operations on basic families of formal languages (Q6204546): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Formal languages over GF(2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On time computability of functions in one-way cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systolic trellis automatata † / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systolic trellis automatat† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semirings and Formal Power Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of weighted automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way bounded cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic context free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preservation of unambiguity and inherent ambiguity in context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations on Permutation Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and computational complexity of systolic trellis automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded languages described by GF(2)-grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressive power of GF(2)-grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-closure under complementation for unambiguous linear grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of linear conjunctive grammars and trellis automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tale of conjunctive grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of GF(2)-operations on unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Systems and Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time language recognition by one-dimensional cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On real time one-way cellular array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language not recognizable in real time by one-way cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some computational limits of trellis automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A property of real-time trellis automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:46, 29 August 2024

scientific article; zbMATH DE number 7826201
Language Label Description Also known as
English
\(\mathrm{GF}(2)\)-operations on basic families of formal languages
scientific article; zbMATH DE number 7826201

    Statements

    \(\mathrm{GF}(2)\)-operations on basic families of formal languages (English)
    0 references
    0 references
    0 references
    0 references
    28 March 2024
    0 references
    finite automata
    0 references
    permutation automata
    0 references
    group languages
    0 references
    trellis automata
    0 references
    cellular automata
    0 references
    deterministic pushdown automata
    0 references
    \(\mathrm{GF}(2)\)-concatenation
    0 references
    \(\mathrm{GF}(2)\)-inverse
    0 references
    \(\mathrm{GF}(2)\)-star
    0 references
    0 references
    0 references

    Identifiers