LANGAGE: A Maple package for automaton characterization of regular languages

DOI10.1016/S0304-3975(99)00013-4zbMath0951.68527MaRDI QIDQ1575906

Pascal Caron

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

MapleLANGAGE

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Formal languages and automata (68Q45)

Related Items (1)

LANGAGE

Uses Software

• Maple
• AG

Cites Work

• Unnamed Item
• Unnamed Item
• Languages and scanners
• Families of locally testable languages
• Locally testable languages
• Characterizations of locally testable events
• Complexity of some problems from the theory of automata
• Algebraic decision procedures for local testability
• On finite monoids having only trivial subgroups
• A polynomial time algorithm for the local testability problem of deterministic finite automata

This page was built for publication: LANGAGE: A Maple package for automaton characterization of regular languages