Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity (Q1998865)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7318711
Language Label Description Also known as
default for all languages
No label defined
    English
    Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
    scientific article; zbMATH DE number 7318711

      Statements

      Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      9 March 2021
      0 references
      ET0L-systems
      0 references
      matrix grammars
      0 references
      rational series
      0 references
      commutative equivalence
      0 references
      counter machines
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers