Deterministic Caterpillar Expressions (Q3503898): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q418765
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Sheng Yu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-76336-9_11 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1598379535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-walking automata cannot be determinized / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-walking automata do not recognize all regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambiguity in Graphs and Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-unambiguous regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4269133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing<i>ϵ</i>-Free NFA from Regular Expressions in<i>O</i>(<i>n</i>log<sup>2</sup>(<i>n</i>)) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: SGML and XML document grammars and exceptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typechecking for XML transformers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of tree-walking automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4799361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Expressions and NFAs Without ε-Transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing regular languages with polynomial densities / rank
 
Normal rank

Latest revision as of 11:37, 28 June 2024

scientific article
Language Label Description Also known as
English
Deterministic Caterpillar Expressions
scientific article

    Statements

    Deterministic Caterpillar Expressions (English)
    0 references
    0 references
    0 references
    0 references
    10 June 2008
    0 references
    regular expressions
    0 references
    tree walking automata
    0 references
    determinism
    0 references
    decidability
    0 references

    Identifiers