There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 12

Record: found
Abstract: not found
Book Chapter: not found

Testing equivalence of morphisms on context-free languages

Wojciech Plandowski (1994)

0 comments Cited 25 times – based on 0 reviews

Bookmark

Record: found
Abstract: not found
Article: not found

Learning subsequential transducers for pattern recognition interpretation tasks

E. Vidal, J. Oncina, P. Garcia (1993)

0 comments Cited 14 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Book Chapter: not found

The equivalence problem for deterministic pushdown automata is decidable

Géraud Sénizergues (1997)

0 comments Cited 10 times – based on 0 reviews

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2009

Pages: 310-322

DOI: 10.1007/978-3-642-03409-1_28

SO-VID: 1f8c4170-07e4-4d68-984d-478d9c60ac4d

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 8

See all cited by

Equivalence of Deterministic Nested Word to Word Transducers

Read this book at

Related collections

Journal for the History of Environment and Society

Most cited references 12

Testing equivalence of morphisms on context-free languages

Learning subsequential transducers for pattern recognition interpretation tasks

The equivalence problem for deterministic pushdown automata is decidable

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 1,844

Cited by 8