Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages (Q3014932): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-21493-6_5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W140044370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational model for tiling recognizable two-dimensional languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unambiguous recognizable two-dimensional languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic and unambiguous two-dimensional languages over one-letter alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of two-dimensional languages and recognizability conditions / 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: Q3431476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tile rewriting grammars and picture languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order logic over rectangular pictures and recognizability by tiling systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound technique for the size of nondeterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Lower Bounds for Nondeterministic State Complexity Is Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity method for measuring nondeterminism in finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Picture Recognizability with Automata Based on Wang Tiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic quantifier alternation hierarchy over grids and graphs / rank
 
Normal rank

Latest revision as of 05:59, 4 July 2024

scientific article
Language Label Description Also known as
English
Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages
scientific article

    Statements

    Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages (English)
    0 references
    0 references
    0 references
    8 July 2011
    0 references
    two-dimensional languages
    0 references
    lower bound techniques on NFA
    0 references

    Identifiers