Linearly bounded infinite graphs (Q852011): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Context-Sensitive Languages, Rational Graphs and Determinism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On infinite transition graphs having a decidable monadic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the transition graphs of Turing machines. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An internal presentation of regular graphs by prefix-recognizable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain formal properties of grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs, II: Infinite graphs of bounded width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Relations Defined by Generalized Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronized rational relations of finite and infinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of languages and linear-bounded automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of ends, pushdown automata, and second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2842874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of bisimulation equivalence for normed pushdown processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of forced enumeration for nondeterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a $k$-valued transducer into $k$ unambiguous ones / rank
 
Normal rank

Revision as of 09:39, 25 June 2024

scientific article
Language Label Description Also known as
English
Linearly bounded infinite graphs
scientific article

    Statements

    Linearly bounded infinite graphs (English)
    0 references
    0 references
    0 references
    27 November 2006
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references