On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- 1 August 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 14 (3), 598-611
- https://doi.org/10.1137/0214044
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- On the finite-valuedness problem for sequential machinesTheoretical Computer Science, 1988
- A note on finite-valued and finitely ambiguous transducersTheory of Computing Systems, 1983
- Observations on the complexity of regular expression problemsJournal of Computer and System Sciences, 1979
- Equivalence problem of non-deterministic finite automataJournal of Computer and System Sciences, 1979
- On the equivalence, containment, and covering problems for the regular and context-free languagesJournal of Computer and System Sciences, 1976
- The loop complexity of regular eventsInformation Sciences, 1969
- Structural equivalence of context-free grammarsJournal of Computer and System Sciences, 1968