On the complexity of 2-monotone restarting automata (Q927391): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s00224-007-9004-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048478966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growing context-sensitive languages and Church-Rosser languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membership for growing context-sensitive grammars is polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5486000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree adjunct grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: SHRINKING RESTARTING AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of non-monotonicity for restarting automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5716611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments in Language Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Church-Rosser Thue systems and formal languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scale of context sensitive languages: Applications to natural language / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence of four extensions of context-free grammars / rank
 
Normal rank

Latest revision as of 10:25, 28 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of 2-monotone restarting automata
scientific article

    Statements

    Identifiers