scientific article; zbMATH DE number 2081051

zbMATH Open1050.68044MaRDI QIDQ4474158FDOQ4474158

Authors: Gheorghe Păun, Gabriel Thierrin 

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2214/22140140.htm

Title of this publication is not available (Why is that?)

Recommendations

• Translating Multiset Tree Automata into P Systems
• scientific article; zbMATH DE number 2080936
• From Nondeterministic to Multi-Head Deterministic Finite-State Transducers
• scientific article; zbMATH DE number 5593273
• Finite state transducers
• Symbolic finite state transducers: algorithms and applications
• Multiset random context grammars, checkers, and transducers
• Fuzzy multiset finite automata and their languages
• A filter-based algorithm for efficient composition of finite-state transducers
• The complexity of optimizing finite-state transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (2)

• Minimal multiset grammars for recurrent dynamics
• MEALY MULTISET AUTOMATA

This page was built for publication:

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