Consensual languages and matching finite-state computations (Q3006160): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2121164581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensual Definition of Languages by Regular Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensual languages and matching finite-state computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence of four extensions of context-free grammars / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:20, 4 July 2024

scientific article
Language Label Description Also known as
English
Consensual languages and matching finite-state computations
scientific article

    Statements

    Consensual languages and matching finite-state computations (English)
    0 references
    10 June 2011
    0 references
    formal languages
    0 references
    finite automata
    0 references
    consensual languages
    0 references
    counter machines
    0 references
    polynomial time parsing
    0 references
    non-semilinear languages
    0 references
    Parikh mapping
    0 references
    descriptive complexity of regular languages
    0 references
    degree of grammaticality
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references