On the descriptional power of heads, counters, and pebbles (Q1763719): 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/j.tcs.2004.04.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082543289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-complexity of finite-state devices, state compressibility and incompressibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-determinacy in simple computing devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Succinctness of Different Representations of Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on rebound automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds on the size of sweeping automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4465339 / 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: Transformational methods and their application to complexity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformational methods and their application to complexity problems. Corrigenda / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language recognition by marking automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism and the size of two way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on multihead automata and context-sensitive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinctness of Descriptions of Unambiguous Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating refined space complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halting space-bounded computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of sweeping automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the succinctness of descriptions of deterministic languages / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:29, 7 June 2024

scientific article
Language Label Description Also known as
English
On the descriptional power of heads, counters, and pebbles
scientific article

    Statements

    On the descriptional power of heads, counters, and pebbles (English)
    0 references
    0 references
    22 February 2005
    0 references
    0 references
    Descriptional complexity
    0 references
    State complexity
    0 references
    Non-recursive trade-offs
    0 references
    Finite automata
    0 references
    0 references