Relating timed and register automata
From MaRDI portal
Publication:2971073
DOI10.1017/S0960129514000322zbMath1362.68138arXiv1011.6432MaRDI QIDQ2971073
Sławomir Lasota, Piotr Hofman, Diego Figueira
Publication date: 4 April 2017
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.6432
68Q45: Formal languages and automata
Related Items
Extending two-variable logic on data trees with order on data values and its automata, Unnamed Item, The containment problem for unambiguous register automata and unambiguous timed automata, Complexity Hierarchies beyond Elementary, Weighted Register Automata and Weighted Logic on Data Words
Cites Work
- A theory of timed automata
- Finite-memory automata
- An algebraic approach to data languages and timed languages
- A Machine-Independent Characterization of Timed Languages
- Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
- Finite state machines for strings over infinite alphabets
- Hierarchies of number-theoretic functions. I