scientific article; zbMATH DE number 1949651

zbMATH Open1015.68525MaRDI QIDQ4412574FDOQ4412574

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (1)

• Deciding sequentiability of finite-state transducers by finite-state pattern-matching.

Recommendations

• Finite state transducers with predicates and identities 👍 👎
• Deciding sequentiability of finite-state transducers by finite-state pattern-matching. 👍 👎
• Finite transducers and nondeterministic state complexity of regular languages 👍 👎
• Inference of finite-state transducers from regular languages 👍 👎
• Finite State Transducers with Intuition 👍 👎
• FINITELY SUBSEQUENTIAL TRANSDUCERS 👍 👎
• Are Statecharts Finite Automata? 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)