"State complexity of binary coded regular languages."

Viliam Geffert, Dominika Palisínová, Alexander Szabari (2024)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2024.114399

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/GeffertPS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/GeffertPS24
Viliam Geffert, Dominika Palisínová, Alexander Szabari:
State complexity of binary coded regular languages. Theor. Comput. Sci. 990: 114399 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.