Modelization of deterministic rational relations

DOI10.1016/S0304-3975(02)00022-1MaRDI QIDQ1603699zbMATH OpenFDO

Authors Serge Grigorieff

Publication date 15 July 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(02)00022-1

zbMATH Keywords

classes of automatadeterministic rational relations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Some decisional problems on rational relations
• scientific article; zbMATH DE number 7058469
• Decision problems for subclasses of rational relations over finite and infinite words
• Decision problems among the main subfamilies of rational relations
• Rational equivalence relations

Cites work

• A Bound on Solutions of Linear Integer Equalities and Inequalities
• A simplified proof of Parikh's theorem
• A variant of a recursively unsolvable problem
• Bounds on Positive Integral Solutions of Linear Diophantine Equations
• Classical recursion theory. Vol. II
• Decision problems for semi-Thue systems with a few rules
• scientific article; zbMATH DE number 4083375 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Integer Programming with a Fixed Number of Variables
• Multitape one-way nonwriting automata
• On Context-Free Languages
• On Relations Defined by Generalized Finite Automata
• On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
• On the definition of a family of automata
• On the Forms of the Predicates in the Theory of Constructive Ordinals
• On the representation of finite deterministic 2-tape automata
• Rational sets in commutative monoids
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Semigroups, Presburger formulas, and languages
• The complexity of decision problems for finite-turn multicounter machines
• 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
• Transductions des langages de Chomsky

Cited in

(6)

• Some decisional problems on rational relations
• Useful mathematical relationships embedded in Tversky's \textit{elimination by aspects} model.
• On the representation of finite deterministic 2-tape automata
• An Automata Theoretic Approach to Rational Tree Relations
• Preface
• Separability of rational relations in A^* N^m by recognizable relations is decidable

This page was built for publication: Modelization of deterministic rational relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603699)