The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Decidability of the multiplicity equivalence of multitape finite automata
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Even Simple Programs Are Hard To Analyze
Journal of the ACM (JACM)
MSO definable string transductions and two-way finite-state transducers
ACM Transactions on Computational Logic (TOCL)
Even simple programs are hard to analyze
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Equivalence Problem of Finite Substitutions on ab*c, with Applications
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Economy of description for basic constructions on rational transductions
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
The equivalence problem for deterministic MSO tree transducers is decidable
Information Processing Letters
On the Decidability of the Equivalence for k-Valued Transducers
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Enumeration of context-free languages and related structures
Journal of Automata, Languages and Combinatorics
Deciding equivalence of top--down XML transformations in polynomial time
Journal of Computer and System Sciences
The unsolvability of the equality problem for sentential forms of context-free grammars
Journal of Computer and System Sciences
View update translation for XML
Proceedings of the 14th International Conference on Database Theory
Normalization of sequential top-down tree-to-word transducers
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Nondeterministic streaming string transducers
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
DLT'11 Proceedings of the 15th international conference on Developments in language theory
On the containment and equivalence problems for GSMs, transducers, and linear CFGs
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Symbolic finite state transducers: algorithms and applications
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The equivalence problem for deterministic MSO tree transducers is decidable
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Finite sets of words and computing
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
On the containment and equivalence problems for two-way transducers
Theoretical Computer Science
State-Identification problems for finite-state transducers
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
The simplest language where equivalence of finite substitutions is undecidable
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Revisiting the equivalence problem for finite multitape automata
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Equivalence of extended symbolic finite transducers
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.01 |
It is shown that the equivalence problem for A-free nondeterministic generalized machines is unsolvable, and it is observed that this result implies the unsolvability of the equality problem for c-finite languages.