Succinct representation of regular sets using gotos and Boolean variables (Q1101207): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equations for regular languages, finite automata, and sequential networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures for regular expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mappings of languages by two-tape devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of program structures: Schemes, semantics, verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The propositional dynamic logic of deterministic, well-structured programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Techniques: Regular expression search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326832 / rank
 
Normal rank

Latest revision as of 16:53, 18 June 2024

scientific article
Language Label Description Also known as
English
Succinct representation of regular sets using gotos and Boolean variables
scientific article

    Statements

    Succinct representation of regular sets using gotos and Boolean variables (English)
    0 references
    0 references
    1987
    0 references
    0 references
    propositional dynamic logic
    0 references
    regular sets of strings
    0 references
    gotos
    0 references
    Boolean variables
    0 references
    regular expressions
    0 references
    0 references