Deterministic Pushdown Automata and Unary Languages (Q3602818): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q61677520 / 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-70844-5_24 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1804899877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds on the length of word chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Application of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5834367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating finite automata with context-free grammars. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mappings which preserve context sensitive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Families of Languages Related to ALGOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pushdown automaton or a context-free grammar - which is more economical? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the translation of languages from left to right / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Simulations between Unary Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A regularity test for pushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity and Related Problems for Deterministic Pushdown Automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:17, 29 June 2024

scientific article
Language Label Description Also known as
English
Deterministic Pushdown Automata and Unary Languages
scientific article

    Statements

    Identifiers