A characterisation of deterministic context-free languages by means of right-congruences (Q913524): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thue systems as rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic Thue systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4176990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On jump-deterministic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental properties of infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Pushdown Store Automata and Regular Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3868790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite regular Thue systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence and inclusion problems for NTS languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decision problems about controlled rewriting systems / rank
 
Normal rank

Latest revision as of 15:46, 20 June 2024

scientific article
Language Label Description Also known as
English
A characterisation of deterministic context-free languages by means of right-congruences
scientific article

    Statements

    A characterisation of deterministic context-free languages by means of right-congruences (English)
    0 references
    1990
    0 references
    0 references
    congruences
    0 references
    controlled rewriting systems
    0 references
    deterministic context-free languages
    0 references