LANGAGE: A Maple package for automaton characterization of regular languages
From MaRDI portal
Publication:1575906
DOI10.1016/S0304-3975(99)00013-4zbMath0951.68527MaRDI QIDQ1575906
Publication date: 23 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item