State-complexity of finite-state devices, state compressibility and incompressibility (Q5289271): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Optimization of LR(k) parsers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concatenation of inputs in a two-way automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way automata and length-preserving homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: STRICT LOCAL TESTABILITY OF THE FINITE CONTROL OF TWO-WAY AUTOMATA AND OF REGULAR PICTURE DESCRIPTION LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial orders on words, minimal elements of regular languages, and state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection and union of regular languages and state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-realtime languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equations for regular languages, finite automata, and sequential networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-tape, off-line Turing machine computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Pushdown and Stack Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representation of regular languages by Boolean automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representation of regular languages by Boolean automata. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On classes of tractable unrestricted regular expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / 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: Q5541340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halting space-bounded computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the reduction of two-way automata to one-way automata / rank
 
Normal rank

Revision as of 17:33, 17 May 2024

scientific article; zbMATH DE number 279276
Language Label Description Also known as
English
State-complexity of finite-state devices, state compressibility and incompressibility
scientific article; zbMATH DE number 279276

    Statements

    State-complexity of finite-state devices, state compressibility and incompressibility (English)
    0 references
    22 August 1993
    0 references
    finite-state automata
    0 references

    Identifiers