This HTML5 document contains 37 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n12http://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Embedded_pushdown_automaton
rdf:type
dbo:Person
rdfs:label
Embedded pushdown automaton
rdfs:comment
An embedded pushdown automaton or EPDA is a computational model for parsing languages generated by tree-adjoining grammars (TAGs). It is similar to the context-free grammar-parsing pushdown automaton, but instead of using a plain stack to store symbols, it has a stack of iterated stacks that store symbols, giving TAGs a generative capacity between context-free and context-sensitive grammars, or a subset of mildly context-sensitive grammars.Embedded pushdown automata should not be confused with nested stack automata which have more computational power.
owl:sameAs
freebase:m.03d1658 yago-res:Embedded_pushdown_automaton
dbp:wikiPageUsesTemplate
dbt:Cleanup dbt:Formal_languages_and_grammars dbt:Clarify_span dbt:Reflist dbt:Clarify dbt:Citation_needed dbt:Cite_book
dct:subject
dbc:Models_of_computation dbc:Automata_(computation)
gold:hypernym
dbr:Model
prov:wasDerivedFrom
n12:Embedded_pushdown_automaton?oldid=1053050995&ns=0
dbo:wikiPageID
14345961
dbo:wikiPageLength
9410
dbo:wikiPageRevisionID
1053050995
dbo:wikiPageWikiLink
dbc:Models_of_computation dbr:Context-free_grammar dbr:Stack_(abstract_data_type) dbr:Nested_stack_automaton dbr:Computational_model dbc:Automata_(computation) dbr:Pushdown_automaton dbr:Mildly_context-sensitive_grammar_formalism dbr:Kleene_star dbr:Indexed_grammar dbr:Computational_linguistics dbr:Combinatory_categorial_grammar dbr:Tree-adjoining_grammar dbr:Context-sensitive_grammar dbr:Transformational_grammar dbr:Chomsky_hierarchy
dbo:abstract
An embedded pushdown automaton or EPDA is a computational model for parsing languages generated by tree-adjoining grammars (TAGs). It is similar to the context-free grammar-parsing pushdown automaton, but instead of using a plain stack to store symbols, it has a stack of iterated stacks that store symbols, giving TAGs a generative capacity between context-free and context-sensitive grammars, or a subset of mildly context-sensitive grammars.Embedded pushdown automata should not be confused with nested stack automata which have more computational power.
foaf:isPrimaryTopicOf
n12:Embedded_pushdown_automaton