The equivalence problem of multitape finite automata
From MaRDI portal
Publication:804302
Recommendations
- Revisiting the equivalence problem for finite multitape automata
- A class of multitape automata with a decidable equivalence problem
- The equivalence problem of multidimensional multitape automata
- scientific article; zbMATH DE number 4769
- On the equivalence problem for deterministic multitape automata and transducers
Cites work
- scientific article; zbMATH DE number 4028926 (Why is no real title available?)
- scientific article; zbMATH DE number 4077461 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 41838 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 3222127 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3085223 (Why is no real title available?)
- HDTOL matching of computations of multitape automata
- Observations on group rings
- On Ordered Division Rings
- On sentential forms of context-free grammars
- The equivalence problem for deterministic finite-turn pushdown automata
- The equivalence problem for deterministic two-tape automata
- The inclusion problem for some classes of deterministic multitape automata
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
Cited in
(77)- Revisiting the equivalence problem for finite multitape automata
- On the decidability of the equivalence problem for partially commutative rational power series
- Minimality and deadlockness of multitape automata
- Symmetries of knowledge bases
- Reversibility of computations in graph-walking automata
- Finite transducers and rational transductions
- Another approach to the equivalence of measure-many one-way quantum finite automata and its application
- Many aspects of defect theorems
- HDTOL matching of computations of multitape automata
- Synchronized tree automata
- Direct and dual laws for automata with multiplicities
- Using algebraic models of programs for detecting metamorphic malwares
- The validity of weighted automata
- On the Class of Predicates Decidable by Two-Way Multitape Finite Automata
- On morphically generated formal power series
- On D0L power series
- Iterative pairs and multitape automata
- Equivalence of two-dimensional multitape automata
- On the representation of finite deterministic 2-tape automata
- Automaton semigroup models of programs
- Polynomial algorithm for equivalence problem of deterministic multitape finite automata
- scientific article; zbMATH DE number 4037263 (Why is no real title available?)
- Algorithm for establishing the equivalence of deterministic multitape automata
- Synchronized rational relations of finite and infinite words
- Decidability of equivalence for deterministic synchronized tree automata
- Solution of the generalized minimization problem for two-tape automata with one fixed tape
- Modelization of deterministic rational relations
- On the ambiguity and finite-valuedness problems in acceptors and transducers
- Equations over finite sets of words and equivalence problems in automata theory
- A polynomial algorithm testing partial confluence of basic semi-Thue systems
- scientific article; zbMATH DE number 4072419 (Why is no real title available?)
- On size reduction techniques for multitape automata
- Some results on regular expressions for multitape finite automata
- A polynomial algorithm testing partial confluence of basic semi-Thue systems
- Weighted automata with discounting
- Equivalence checking of prefix-free transducers and deterministic two-tape automata
- Highly Undecidable Problems For Infinite Computations
- The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape
- On the Decidability of the Equivalence Problem for Monadic Recursive Programs
- Rational and Recognisable Power Series
- Reflections on the phenomenon of Aleksej Andreevich Lyapunov
- The equivalence problem of multidimensional multitape automata
- Multiplicities: A deterministic view of nondeterminism
- Inclusion is undecidable for pattern languages
- A class of multitape automata with a decidable equivalence problem
- \(L(A)=L(B)\)? decidability results from complete formal systems
- Decidability of equivalence for deterministic synchronized tree automata
- scientific article; zbMATH DE number 177806 (Why is no real title available?)
- SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS
- Complete system of equivalent transformations for two-tape automata with disjoint loops
- A note on the equivalence problem of rational formal power series
- On equality of multiplicity sets of regular languages
- On decision problems for parameterized machines
- Weighted automata
- On synchronized multi-tape and multi-head automata
- Automata, Languages and Programming
- On Lindenmayerian algebraic power series
- On Lindenmayerian algebraic sequences
- Some decisional problems on rational relations
- The ``equal last letter predicate for words on infinite alphabets and classes of multitape automata
- The problem of equivalent transformations for homogeneous multitape automata
- On the equivalence problem of context-free and DT0L languages
- Equivalence Testing of Weighted Automata over Partially Commutative Monoids
- An iteration property of Lindenmayerian power series
- scientific article; zbMATH DE number 1948505 (Why is no real title available?)
- On power series over a graded monoid
- Why we need semirings in automata theory (extended abstract)
- Systems of equations over a finite set of words and automata theory
- LABELLING MULTI-TAPE AUTOMATA WITH CONSTRAINED SYMBOL CLASSES
- On Hadamard series and rotating \(\mathbb{Q}\)-automata
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
- scientific article; zbMATH DE number 3992935 (Why is no real title available?)
- Program equivalence checking by two-tape automata
- On the multiplicity equivalence problem for context-free grammars
- Decidability and syntactic control of interference
- Some results on regular events for multitape finite automata: a preliminary report
- On Synchronized Multitape and Multihead Automata
This page was built for publication: The equivalence problem of multitape finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804302)
