DPDA's in 'Atomic normal form' and applications to equivalence problems (Q1158965): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(81)90055-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012313512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A representation of trees by languages. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On jump-deterministic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness results for the equivalence of recursive schemas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple program schemes and formal languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: IO and OI. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inclusion problem for simple languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence problems for deterministic context-free languages and monadic recursion schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple context-free languages and free monadic recursion schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superdeterministic DPDAs: The method of accepting does affect decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursion-closed algebraic theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular trees and the free iterative theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial Algebra Semantics and Continuous Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict deterministic grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parsing of Deterministic Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4116078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decidability of equivalence for deterministic stateless pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for real-time strict deterministic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-Manipulating Systems and Church-Rosser Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program equivalence and context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A result on the equivalence problem for deterministic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of a Two-Phase Strategy for Routing in Interconnection Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for deterministic finite-turn pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic one-counter automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:28, 13 June 2024

scientific article
Language Label Description Also known as
English
DPDA's in 'Atomic normal form' and applications to equivalence problems
scientific article

    Statements

    DPDA's in 'Atomic normal form' and applications to equivalence problems (English)
    0 references
    0 references
    1981
    0 references
    address language
    0 references
    recursion schemes
    0 references
    deterministic pushdown automata
    0 references
    encoding of trees
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers