The equivalence of deterministic gsm replications onQ-rational languages is decidable

DOI10.1007/BF01692070MaRDI QIDQ3779775zbMATH OpenFDO

Authors Paavo Turakainen

Publication date 1987

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01692070

zbMATH Keywords

decidabilitydeterministic gsm replicationsequivalenceformal power seriesgeneralized sequential machineQ-rational languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4058890
• On some transducer equivalence problems for families of languages
• scientific article; zbMATH DE number 1232245
• The equivalence problem for deterministic pushdown automata is decidable
• \(L(A)=L(B)\)? decidability results from complete formal systems

Cites work

• 2DST mappings of languages and related problems
• AFL with the semilinear property
• Generalized Automata and Stochastic Languages
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• On some transducer equivalence problems for families of languages
• One way finite visit automata
• Reset machines
• Syntactic operators on full semiAFLs

Cited in

(2)

• Systems of word equations, polynomials and linear algebra: a new approach
• scientific article; zbMATH DE number 4058890 (Why is no real title available?)

This page was built for publication: The equivalence of deterministic gsm replications onQ-rational languages is decidable

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