scientific article; zbMATH DE number 1949651

MaRDI QIDQ4412574zbMATH OpenFDO

Authors Tamás Gaál

Publication date 15 July 2003

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Finite state transducers
• Deciding sequentiability of finite-state transducers by finite-state pattern-matching.
• Finite State Transducers with Intuition
• Finite state transducers with predicates and identities
• FINITELY SUBSEQUENTIAL TRANSDUCERS
• Are Statecharts Finite Automata?
• scientific article; zbMATH DE number 2050927
• Inference of finite-state transducers from regular languages
• Finite transducers and nondeterministic state complexity of regular languages
• scientific article; zbMATH DE number 1670708

Cited in

(5)

• Deciding sequentiability of finite-state transducers by finite-state pattern-matching.
• Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
• scientific article; zbMATH DE number 1773097 (Why is no real title available?)
• scientific article; zbMATH DE number 1870549 (Why is no real title available?)
• Sequentiality of string-to-context transducers

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 Q4412574)