Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity (Q2799199): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2150868717 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1410.2737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Reachability Analysis of Acyclic Networks of Pushdown Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing Context-Free Grammars Using an Incremental SAT Solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing ambiguity of context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4713368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPsolve: A Generic Solver for Fixpoint Equations over Semirings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded underapproximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on the Size of Higman-Haines Sets: Effective Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Downward-Closure of Petri Net Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective constructions in well-partially-ordered free monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3527019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the State Complexity of Scattered Substrings and Superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2893312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conservative Ambiguity Detection in Context-Free Grammars / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:05, 11 July 2024

scientific article
Language Label Description Also known as
English
Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity
scientific article

    Statements

    Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity (English)
    0 references
    0 references
    0 references
    0 references
    8 April 2016
    0 references
    descriptional complexity
    0 references
    subword closure
    0 references
    NFA equivalence
    0 references
    language approximation
    0 references

    Identifiers

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