Visibly pushdown transducers (Q1672009): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q129576861, #quickstatements; #temporary_batch_1728557513293
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.jcss.2018.05.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2881695248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Marrying Words and Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order and Temporal Logics for Nested Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal Reasoning for Procedural Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly pushdown languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding nesting structure to words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Squaring transducers: An efficient procedure for deciding functionality and sequentiality. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Uniformization Theorem for Nested Word to Word Transductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Relations Defined by Generalized Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree transducers for partial functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Macro Tree Translations of Linear Size Increase are MSO Definable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Macro tree transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2911634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of Visibly Pushdown Transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly Pushdown Transducers with Look-Ahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliest Query Answering for Deterministic Nested Word Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on finite-valued and finitely ambiguous transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decision problems concerning semilinearity and commutation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer aided verification. 24th international conference, CAV 2012, Berkeley, CA, USA, July 7--13, 2012. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested interpolants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query Automata for Nested Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of typechecking top-down XML transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frontiers of tractability for typechecking simple XML transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query automata over finite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Macro forest transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly Pushdown Transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly Pushdown Transducers with Well-Nested Outputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic decomposition of \(k\)-valued transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur les rélations rationnelles entre monoides libres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of Deterministic Nested Word to Word Transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly Pushdown Transducers for Approximate Validation of Streaming XML / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-20 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Finite-Valued Transducers and Deciding Their Equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economy of description for single-valued transducers / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129576861 / rank
 
Normal rank

Latest revision as of 12:16, 10 October 2024

scientific article
Language Label Description Also known as
English
Visibly pushdown transducers
scientific article

    Statements

    Visibly pushdown transducers (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 September 2018
    0 references
    visibly pushdown automata
    0 references
    transducers
    0 references
    functionality
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers