Multiset processing by means of systems of finite state transducers

DOI10.1007/3-540-45526-4_13MaRDI QIDQ4474158zbMATH OpenFDO

Authors Gheorghe Păun, Gabriel Thierrin

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Translating Multiset Tree Automata into P Systems
• Multiset automata
• 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

Cited in

(2)

• Minimal multiset grammars for recurrent dynamics
• MEALY MULTISET AUTOMATA

This page was built for publication: Multiset processing by means of systems of finite state transducers

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