ACME: Automata With Counters, Monoids and Equivalence

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-11936-6_12
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

On Finite Monoids of Cellular Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Combinatorial Group Theory, Inverse Monoids, Automata, and Global Semigroup Theory

International Journal of Algebra and Computation
Mathematics
2002English

Automata Language Equivalence vs. Simulations for Model-Based Mutant Equivalence: An Empirical Evaluation

2017English

Inverse Automata and Monoids and the Undecidability of the Cayley Subgraph Problem for Groups

Glasgow Mathematical Journal
Mathematics
2000English

Equivalence in Knowledge Representation: Automata, Recurrent Neural Networks, and Dynamical Fuzzy Systems

Proceedings of the IEEE
Electronic EngineeringElectricalComputer Science
1999English

$$\Mathbb {A}^{1}$$ a 1 -Connectivity on Chow Monoids Versus Rational Equivalence of Algebraic Cycles

European Journal of Mathematics
Mathematics
2016English

A Timed Failure Equivalence Preserving Abstraction for Parametric Time-Interval Automata

International Journal of Foundations of Computer Science
Computer Science
2006English

Congruences on Free Monoids and Submonoids of Polycyclic Monoids

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1993English

F-Monoids

Communications in Algebra
Number TheoryAlgebra
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy