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

DOI10.1007/BF01692070zbMath0638.68088MaRDI QIDQ3779775

Paavo Turakainen

Publication date: 1987

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

zbMATH Keywords

equivalencedecidabilityformal power seriesgeneralized sequential machinedeterministic gsm replicationsQ-rational languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Systems of word equations, polynomials and linear algebra: a new approach

Cites Work

• Unnamed Item
• Syntactic operators on full semiAFLs
• Reset machines
• 2DST mappings of languages and related problems
• One way finite visit automata
• AFL with the semilinear property
• On some transducer equivalence problems for families of languages
• Generalized Automata and Stochastic Languages

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