Login / Signup

State complexity of binary coded regular languages.

Viliam GeffertDominika PalisínováAlexander Szabari
Published in: Theor. Comput. Sci. (2024)
Keyphrases
  • regular languages
  • grammatical inference
  • finite automata
  • decision problems
  • context free grammars
  • context free languages
  • state space
  • regular expressions
  • finite state machines