Some decisional problems on rational relations

DOI10.1016/S0304-3975(96)00098-9MaRDI QIDQ1390853zbMATH OpenFDO

Authors Maria Madonia, Stefano Varricchio

Publication date 22 July 1998

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

zbMATH Keywords

decidabilitystar-freerational relationrecursive solvability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Word problems, etc. in computability and recursion theory (03D40)

Recommendations

• Decision problems among the main subfamilies of rational relations
• scientific article; zbMATH DE number 2209441
• scientific article; zbMATH DE number 7058469
• Decision problems for subclasses of rational relations over finite and infinite words
• On rational choice and the representation of decision problems
• scientific article; zbMATH DE number 65938
• scientific article; zbMATH DE number 4102758
• Decision problems for equational theories of relation algebras
• scientific article; zbMATH DE number 638616
• Modelization of deterministic rational relations

Cites work

• scientific article; zbMATH DE number 3970128 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (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 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• Learning two-tape automata from queries and counterexamples
• On Relations Defined by Generalized Finite Automata
• On finite monoids having only trivial subgroups
• Rational equivalence relations
• Star-free trace languages
• The equivalence problem of multitape finite automata

Cited in

(11)

• A combinatorial study of \(k\)-valued rational relations
• Rational equivalence relations
• Modelization of deterministic rational relations
• Decision problems among the main subfamilies of rational relations
• scientific article; zbMATH DE number 3911744 (Why is no real title available?)
• Decision problems for subclasses of rational relations over finite and infinite words
• Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable
• An Hadamard operation on rational relations
• Stefano Varricchio (1960-2008)
• scientific article; zbMATH DE number 1836425 (Why is no real title available?)
• scientific article; zbMATH DE number 3982545 (Why is no real title available?)

This page was built for publication: Some decisional problems on rational relations

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