About: Embedded pushdown automaton

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Embedded pushdown automaton Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Person, within Data Space : el.dbpedia.org associated with source document(s)

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.

Attributes	Values
rdf:type	person
rdfs:label	Embedded pushdown automaton (en)
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. (en)
sameAs	Embedded pushdown automaton Embedded pushdown automaton
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Cite_book dbt:Clarify dbt:Clarify_span dbt:Cleanup dbt:Reflist dbt:Formal_languages_and_grammars
Subject	Automata (computation) Models of computation
gold:hypernym	Model
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Embedded_pushdown_automaton?oldid=1053050995&ns=0
Wikipage page ID	14345961 (xsd:integer)
page length (characters) of wiki page	9410 (xsd:nonNegativeInteger)
Wikipage revision ID	1053050995 (xsd:integer)
Link from a Wikipage to another Wikipage	Automata (computation) Models of computation Chomsky hierarchy Pushdown automaton Combinatory categorial grammar Computational linguistics Computational model Context-free grammar Context-sensitive grammar Indexed grammar Mildly context-sensitive grammar formalism Deep structure and surface structure Tree-adjoining grammar dbr:Nested_stack_automaton Stack (abstract data type) Kleene star
has 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. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Embedded_pushdown_automaton
is Wikipage redirect of	EPDA Embedded pushdown automata Weir hierarchy
is Link from a Wikipage to another Wikipage of	Combinatory categorial grammar Context-free language Mildly context-sensitive grammar formalism EPDA Embedded pushdown automata
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Embedded_pushdown_automaton

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (82 GB total memory, 2 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software