Computing by commuting. (Q2490820): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2006.01.051 / rank
Normal rank
 
Property / author
 
Property / author: Juhani Karhumäki / rank
Normal rank
 
Property / author
 
Property / author: Juhani Karhumäki / 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.1016/j.tcs.2006.01.051 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977870924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in a Description Logic with Transitive Closure of Roles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular canonical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical systems which produce periodic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the regular structure of prefix rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on decidability questions on presentations of word semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deleting string rewriting systems preserve regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machines, Computations, and Universality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4665743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular solutions of language inequalities and well quasi-orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments in Language Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of linear conjunctive grammars and trellis automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of the matrix representation of transductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Reductions of the General Combinatorial Decision Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2006.01.051 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:01, 19 December 2024

scientific article
Language Label Description Also known as
English
Computing by commuting.
scientific article

    Statements

    Computing by commuting. (English)
    0 references
    0 references
    0 references
    0 references
    18 May 2006
    0 references
    rewriting systems
    0 references
    regular languages
    0 references
    commutation of languages
    0 references
    rational relations
    0 references

    Identifiers