Modelization of deterministic rational relations
From MaRDI portal
Publication:1603699
DOI10.1016/S0304-3975(02)00022-1zbMath0997.68072MaRDI QIDQ1603699
Publication date: 15 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (3)
Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable ⋮ Preface ⋮ An Automata Theoretic Approach to Rational Tree Relations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The equivalence problem for deterministic two-tape automata
- The equivalence problem of multitape finite automata
- The inclusion problem for some classes of deterministic multitape automata
- The complexity of decision problems for finite-turn multicounter machines
- Transductions des langages de Chomsky
- A simplified proof of Parikh's theorem
- Classical recursion theory. Vol. II
- Decision problems for semi-Thue systems with a few rules
- On the representation of finite deterministic 2-tape automata
- Semigroups, Presburger formulas, and languages
- Multitape one-way nonwriting automata
- Rational sets in commutative monoids
- Integer Programming with a Fixed Number of Variables
- On the definition of a family of automata
- On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- A Bound on Solutions of Linear Integer Equalities and Inequalities
- On Relations Defined by Generalized Finite Automata
- On Context-Free Languages
- On the Forms of the Predicates in the Theory of Constructive Ordinals
- A variant of a recursively unsolvable problem
This page was built for publication: Modelization of deterministic rational relations
