LABELLING MULTI-TAPE AUTOMATA WITH CONSTRAINED SYMBOL CLASSES

DOI10.1142/S0129054107005017MaRDI QIDQ3503099zbMATH OpenOpenAlexFDO

Authors Florent Nicart, Tibor Csáki, Tamás Gaál, André Kempe, Jean-Marc Champarnaud

Publication date 20 May 2008

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054107005017

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Multi-tape Automata with Symbol Classes
• A class of multitape automata with a decidable equivalence problem
• Formalization of the concept of multitape automaton
• Labelled domains and automata with concurrency
• The equivalence problem of multitape finite automata
• Combinatorics of labelling in higher-dimensional automata
• Revisiting the equivalence problem for finite multitape automata
• The equivalence problem of multidimensional multitape automata
• scientific article; zbMATH DE number 4047169
• On the equivalence problem for deterministic multitape automata and transducers

Cites work

• A logic language for combinatorial optimization
• Finite state transducers with predicates and identities

Cited in

(2)

• Finite-state registered automata for non-concatenative morphology
• Multi-tape Automata with Symbol Classes

Describes a project that uses

Uses Software

• WFSC

This page was built for publication: LABELLING MULTI-TAPE AUTOMATA WITH CONSTRAINED SYMBOL CLASSES

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