Geometrical regular languages and linear Diophantine equations: the strongly connected case (Q443737): 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.1016/j.tcs.2012.04.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003854010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem of Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometricity of Binary Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Geometrical Languages and Tiling the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4313096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Powers of Non-Negative Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5582375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified dense linear system solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Automaton Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of the Elementary Circuits of a Directed Graph / rank
 
Normal rank

Latest revision as of 12:52, 5 July 2024

scientific article
Language Label Description Also known as
English
Geometrical regular languages and linear Diophantine equations: the strongly connected case
scientific article

    Statements

    Geometrical regular languages and linear Diophantine equations: the strongly connected case (English)
    0 references
    0 references
    0 references
    0 references
    13 August 2012
    0 references
    regular language
    0 references
    minimal deterministic automaton
    0 references
    Parikh image
    0 references
    geometrical language
    0 references
    Diophantine equation
    0 references

    Identifiers