Decidability of reachability problems for classes of two counters automata (Q4501546)

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 1500528
Language Label Description Also known as
default for all languages
No label defined
    English
    Decidability of reachability problems for classes of two counters automata
    scientific article; zbMATH DE number 1500528

      Statements

      0 references
      0 references
      29 January 2001
      0 references
      two counter automata
      0 references
      semilinearity
      0 references
      symbolic reachability tree algorithm
      0 references
      Decidability of reachability problems for classes of two counters automata (English)
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references